./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8bbbd483a09fdeea97ffdf681e0639d6c4265da0 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:54:39,142 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:54:39,145 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:54:39,161 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:54:39,161 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:54:39,163 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:54:39,164 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:54:39,166 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:54:39,168 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:54:39,169 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:54:39,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:54:39,171 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:54:39,172 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:54:39,173 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:54:39,174 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:54:39,175 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:54:39,176 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:54:39,178 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:54:39,182 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:54:39,186 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:54:39,188 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:54:39,192 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:54:39,193 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:54:39,196 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:54:39,198 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:54:39,199 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:54:39,199 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:54:39,200 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:54:39,200 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:54:39,201 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:54:39,202 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:54:39,202 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:54:39,203 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:54:39,204 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:54:39,205 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:54:39,205 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:54:39,206 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:54:39,206 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:54:39,207 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:54:39,208 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:54:39,208 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:54:39,209 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-11-28 02:54:39,233 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:54:39,233 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:54:39,235 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:54:39,235 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:54:39,235 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:54:39,236 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:54:39,236 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:54:39,236 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:54:39,236 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:54:39,236 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:54:39,238 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:54:39,238 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 02:54:39,238 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:54:39,238 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 02:54:39,239 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-28 02:54:39,239 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:54:39,239 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 02:54:39,239 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:54:39,239 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 02:54:39,240 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:54:39,240 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:54:39,240 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:54:39,241 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:54:39,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:54:39,241 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:54:39,241 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:54:39,242 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 02:54:39,242 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:54:39,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:54:39,242 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 02:54:39,242 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8bbbd483a09fdeea97ffdf681e0639d6c4265da0 [2019-11-28 02:54:39,546 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:54:39,560 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:54:39,564 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:54:39,565 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:54:39,566 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:54:39,567 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2019-11-28 02:54:39,640 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fe153de4/a3792c6821f647cf9e690e0d1a286728/FLAG44c3506f8 [2019-11-28 02:54:40,143 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:54:40,144 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2019-11-28 02:54:40,155 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fe153de4/a3792c6821f647cf9e690e0d1a286728/FLAG44c3506f8 [2019-11-28 02:54:40,534 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fe153de4/a3792c6821f647cf9e690e0d1a286728 [2019-11-28 02:54:40,538 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:54:40,540 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 02:54:40,541 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:54:40,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:54:40,545 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:54:40,547 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:54:40" (1/1) ... [2019-11-28 02:54:40,550 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76e9968b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:40, skipping insertion in model container [2019-11-28 02:54:40,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:54:40" (1/1) ... [2019-11-28 02:54:40,560 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:54:40,614 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:54:40,823 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:54:40,827 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:54:40,938 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:54:40,955 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:54:40,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:40 WrapperNode [2019-11-28 02:54:40,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:54:40,957 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 02:54:40,957 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 02:54:40,957 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 02:54:40,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:40" (1/1) ... [2019-11-28 02:54:40,974 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:40" (1/1) ... [2019-11-28 02:54:41,006 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 02:54:41,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:54:41,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:54:41,007 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:54:41,017 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:40" (1/1) ... [2019-11-28 02:54:41,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:40" (1/1) ... [2019-11-28 02:54:41,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:40" (1/1) ... [2019-11-28 02:54:41,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:40" (1/1) ... [2019-11-28 02:54:41,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:40" (1/1) ... [2019-11-28 02:54:41,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:40" (1/1) ... [2019-11-28 02:54:41,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:40" (1/1) ... [2019-11-28 02:54:41,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:54:41,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:54:41,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:54:41,046 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:54:41,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:54:41,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:54:41,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:54:41,773 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:54:41,773 INFO L297 CfgBuilder]: Removed 28 assume(true) statements. [2019-11-28 02:54:41,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:54:41 BoogieIcfgContainer [2019-11-28 02:54:41,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:54:41,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:54:41,776 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:54:41,780 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:54:41,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:54:40" (1/3) ... [2019-11-28 02:54:41,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:54:41, skipping insertion in model container [2019-11-28 02:54:41,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:40" (2/3) ... [2019-11-28 02:54:41,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:54:41, skipping insertion in model container [2019-11-28 02:54:41,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:54:41" (3/3) ... [2019-11-28 02:54:41,784 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_1-2a.c.cil.c [2019-11-28 02:54:41,794 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:54:41,803 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. [2019-11-28 02:54:41,816 INFO L249 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2019-11-28 02:54:41,845 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:54:41,845 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 02:54:41,845 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:54:41,846 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:54:41,846 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:54:41,846 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:54:41,847 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:54:41,847 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:54:41,873 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2019-11-28 02:54:41,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-28 02:54:41,878 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:41,879 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-28 02:54:41,881 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:41,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:41,887 INFO L82 PathProgramCache]: Analyzing trace with hash 922901410, now seen corresponding path program 1 times [2019-11-28 02:54:41,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:41,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122347187] [2019-11-28 02:54:41,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:42,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:54:42,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122347187] [2019-11-28 02:54:42,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:42,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:42,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280710834] [2019-11-28 02:54:42,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 02:54:42,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:42,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 02:54:42,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 02:54:42,061 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 2 states. [2019-11-28 02:54:42,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:42,096 INFO L93 Difference]: Finished difference Result 263 states and 369 transitions. [2019-11-28 02:54:42,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 02:54:42,097 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-11-28 02:54:42,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:42,108 INFO L225 Difference]: With dead ends: 263 [2019-11-28 02:54:42,108 INFO L226 Difference]: Without dead ends: 104 [2019-11-28 02:54:42,112 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 02:54:42,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-28 02:54:42,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-28 02:54:42,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-28 02:54:42,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 127 transitions. [2019-11-28 02:54:42,163 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 127 transitions. Word has length 6 [2019-11-28 02:54:42,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:42,163 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 127 transitions. [2019-11-28 02:54:42,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 02:54:42,164 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 127 transitions. [2019-11-28 02:54:42,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-28 02:54:42,164 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:42,165 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-28 02:54:42,165 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:42,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:42,166 INFO L82 PathProgramCache]: Analyzing trace with hash 921960144, now seen corresponding path program 1 times [2019-11-28 02:54:42,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:42,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86145861] [2019-11-28 02:54:42,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:42,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:54:42,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86145861] [2019-11-28 02:54:42,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:42,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:42,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888126131] [2019-11-28 02:54:42,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:54:42,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:42,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:54:42,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:54:42,275 INFO L87 Difference]: Start difference. First operand 104 states and 127 transitions. Second operand 4 states. [2019-11-28 02:54:42,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:42,434 INFO L93 Difference]: Finished difference Result 224 states and 269 transitions. [2019-11-28 02:54:42,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:54:42,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-11-28 02:54:42,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:42,436 INFO L225 Difference]: With dead ends: 224 [2019-11-28 02:54:42,436 INFO L226 Difference]: Without dead ends: 122 [2019-11-28 02:54:42,438 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:54:42,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-28 02:54:42,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 84. [2019-11-28 02:54:42,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-28 02:54:42,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 101 transitions. [2019-11-28 02:54:42,449 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 101 transitions. Word has length 6 [2019-11-28 02:54:42,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:42,449 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 101 transitions. [2019-11-28 02:54:42,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:54:42,449 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2019-11-28 02:54:42,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 02:54:42,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:42,450 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:42,451 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:42,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:42,451 INFO L82 PathProgramCache]: Analyzing trace with hash -118682603, now seen corresponding path program 1 times [2019-11-28 02:54:42,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:42,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321659372] [2019-11-28 02:54:42,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:42,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:54:42,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321659372] [2019-11-28 02:54:42,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:42,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:42,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973179274] [2019-11-28 02:54:42,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:54:42,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:42,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:54:42,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:54:42,522 INFO L87 Difference]: Start difference. First operand 84 states and 101 transitions. Second operand 4 states. [2019-11-28 02:54:42,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:42,625 INFO L93 Difference]: Finished difference Result 129 states and 154 transitions. [2019-11-28 02:54:42,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:54:42,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-28 02:54:42,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:42,627 INFO L225 Difference]: With dead ends: 129 [2019-11-28 02:54:42,628 INFO L226 Difference]: Without dead ends: 125 [2019-11-28 02:54:42,628 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:54:42,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-28 02:54:42,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 85. [2019-11-28 02:54:42,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-28 02:54:42,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2019-11-28 02:54:42,640 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 9 [2019-11-28 02:54:42,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:42,640 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2019-11-28 02:54:42,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:54:42,641 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2019-11-28 02:54:42,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 02:54:42,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:42,642 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:42,642 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:42,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:42,643 INFO L82 PathProgramCache]: Analyzing trace with hash 615806736, now seen corresponding path program 1 times [2019-11-28 02:54:42,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:42,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962505711] [2019-11-28 02:54:42,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:42,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:54:42,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962505711] [2019-11-28 02:54:42,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:42,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:42,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174250896] [2019-11-28 02:54:42,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:54:42,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:42,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:54:42,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:42,683 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand 3 states. [2019-11-28 02:54:42,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:42,757 INFO L93 Difference]: Finished difference Result 123 states and 146 transitions. [2019-11-28 02:54:42,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:54:42,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-28 02:54:42,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:42,761 INFO L225 Difference]: With dead ends: 123 [2019-11-28 02:54:42,762 INFO L226 Difference]: Without dead ends: 121 [2019-11-28 02:54:42,762 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:42,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-28 02:54:42,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 83. [2019-11-28 02:54:42,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-28 02:54:42,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-11-28 02:54:42,783 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 10 [2019-11-28 02:54:42,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:42,783 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-11-28 02:54:42,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:54:42,783 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-11-28 02:54:42,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 02:54:42,784 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:42,784 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:42,785 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:42,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:42,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1497311933, now seen corresponding path program 1 times [2019-11-28 02:54:42,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:42,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301402266] [2019-11-28 02:54:42,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:42,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:54:42,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301402266] [2019-11-28 02:54:42,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:42,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:42,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125111063] [2019-11-28 02:54:42,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:54:42,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:42,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:54:42,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:54:42,860 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 4 states. [2019-11-28 02:54:42,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:42,943 INFO L93 Difference]: Finished difference Result 127 states and 151 transitions. [2019-11-28 02:54:42,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:54:42,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 02:54:42,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:42,945 INFO L225 Difference]: With dead ends: 127 [2019-11-28 02:54:42,946 INFO L226 Difference]: Without dead ends: 125 [2019-11-28 02:54:42,946 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:54:42,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-28 02:54:42,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 85. [2019-11-28 02:54:42,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-28 02:54:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2019-11-28 02:54:42,972 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 11 [2019-11-28 02:54:42,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:42,974 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2019-11-28 02:54:42,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:54:42,974 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2019-11-28 02:54:42,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 02:54:42,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:42,975 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:42,976 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:42,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:42,976 INFO L82 PathProgramCache]: Analyzing trace with hash -832741477, now seen corresponding path program 1 times [2019-11-28 02:54:42,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:42,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533521930] [2019-11-28 02:54:42,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:43,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:54:43,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533521930] [2019-11-28 02:54:43,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:43,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:43,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600415159] [2019-11-28 02:54:43,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:54:43,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:43,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:54:43,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:54:43,050 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand 4 states. [2019-11-28 02:54:43,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:43,134 INFO L93 Difference]: Finished difference Result 130 states and 156 transitions. [2019-11-28 02:54:43,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:54:43,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-28 02:54:43,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:43,136 INFO L225 Difference]: With dead ends: 130 [2019-11-28 02:54:43,136 INFO L226 Difference]: Without dead ends: 128 [2019-11-28 02:54:43,137 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:54:43,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-28 02:54:43,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 88. [2019-11-28 02:54:43,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-28 02:54:43,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2019-11-28 02:54:43,149 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 12 [2019-11-28 02:54:43,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:43,150 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2019-11-28 02:54:43,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:54:43,150 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2019-11-28 02:54:43,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 02:54:43,153 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:43,154 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:43,158 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:43,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:43,159 INFO L82 PathProgramCache]: Analyzing trace with hash 952355221, now seen corresponding path program 1 times [2019-11-28 02:54:43,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:43,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719792330] [2019-11-28 02:54:43,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:43,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:54:43,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719792330] [2019-11-28 02:54:43,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:43,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:54:43,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449698409] [2019-11-28 02:54:43,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:54:43,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:43,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:54:43,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:54:43,207 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand 4 states. [2019-11-28 02:54:43,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:43,289 INFO L93 Difference]: Finished difference Result 172 states and 203 transitions. [2019-11-28 02:54:43,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:54:43,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 02:54:43,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:43,291 INFO L225 Difference]: With dead ends: 172 [2019-11-28 02:54:43,292 INFO L226 Difference]: Without dead ends: 170 [2019-11-28 02:54:43,292 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:54:43,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-28 02:54:43,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 87. [2019-11-28 02:54:43,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-28 02:54:43,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2019-11-28 02:54:43,300 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 14 [2019-11-28 02:54:43,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:43,301 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2019-11-28 02:54:43,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:54:43,301 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2019-11-28 02:54:43,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 02:54:43,302 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:43,302 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:43,303 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:43,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:43,303 INFO L82 PathProgramCache]: Analyzing trace with hash -513187613, now seen corresponding path program 1 times [2019-11-28 02:54:43,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:43,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833961892] [2019-11-28 02:54:43,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:43,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:54:43,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833961892] [2019-11-28 02:54:43,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:43,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:43,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411801379] [2019-11-28 02:54:43,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:54:43,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:43,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:54:43,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:54:43,345 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand 4 states. [2019-11-28 02:54:43,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:43,432 INFO L93 Difference]: Finished difference Result 127 states and 152 transitions. [2019-11-28 02:54:43,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:54:43,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 02:54:43,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:43,433 INFO L225 Difference]: With dead ends: 127 [2019-11-28 02:54:43,434 INFO L226 Difference]: Without dead ends: 125 [2019-11-28 02:54:43,435 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:54:43,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-28 02:54:43,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 82. [2019-11-28 02:54:43,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-28 02:54:43,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2019-11-28 02:54:43,447 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 14 [2019-11-28 02:54:43,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:43,447 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2019-11-28 02:54:43,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:54:43,448 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2019-11-28 02:54:43,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 02:54:43,449 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:43,450 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:43,450 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:43,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:43,451 INFO L82 PathProgramCache]: Analyzing trace with hash 2134556229, now seen corresponding path program 1 times [2019-11-28 02:54:43,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:43,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905966733] [2019-11-28 02:54:43,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:43,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:43,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:54:43,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905966733] [2019-11-28 02:54:43,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:43,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:54:43,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925842276] [2019-11-28 02:54:43,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:54:43,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:43,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:54:43,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:54:43,527 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand 4 states. [2019-11-28 02:54:43,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:43,611 INFO L93 Difference]: Finished difference Result 162 states and 193 transitions. [2019-11-28 02:54:43,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:54:43,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-28 02:54:43,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:43,613 INFO L225 Difference]: With dead ends: 162 [2019-11-28 02:54:43,614 INFO L226 Difference]: Without dead ends: 160 [2019-11-28 02:54:43,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:54:43,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-28 02:54:43,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 72. [2019-11-28 02:54:43,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-28 02:54:43,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions. [2019-11-28 02:54:43,623 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 89 transitions. Word has length 15 [2019-11-28 02:54:43,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:43,623 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 89 transitions. [2019-11-28 02:54:43,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:54:43,624 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2019-11-28 02:54:43,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 02:54:43,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:43,626 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:43,627 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:43,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:43,628 INFO L82 PathProgramCache]: Analyzing trace with hash -324557016, now seen corresponding path program 1 times [2019-11-28 02:54:43,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:43,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154768883] [2019-11-28 02:54:43,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:43,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:54:43,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154768883] [2019-11-28 02:54:43,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:43,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 02:54:43,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136804808] [2019-11-28 02:54:43,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:54:43,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:43,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:54:43,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:54:43,842 INFO L87 Difference]: Start difference. First operand 72 states and 89 transitions. Second operand 9 states. [2019-11-28 02:54:44,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:44,102 INFO L93 Difference]: Finished difference Result 114 states and 137 transitions. [2019-11-28 02:54:44,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:54:44,103 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-11-28 02:54:44,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:44,104 INFO L225 Difference]: With dead ends: 114 [2019-11-28 02:54:44,104 INFO L226 Difference]: Without dead ends: 74 [2019-11-28 02:54:44,105 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:54:44,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-28 02:54:44,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2019-11-28 02:54:44,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-28 02:54:44,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2019-11-28 02:54:44,111 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 17 [2019-11-28 02:54:44,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:44,117 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2019-11-28 02:54:44,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:54:44,117 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2019-11-28 02:54:44,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:54:44,121 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:44,122 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:44,122 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:44,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:44,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1112826903, now seen corresponding path program 1 times [2019-11-28 02:54:44,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:44,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336638565] [2019-11-28 02:54:44,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:44,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:54:44,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336638565] [2019-11-28 02:54:44,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:44,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 02:54:44,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820334897] [2019-11-28 02:54:44,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:54:44,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:44,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:54:44,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:54:44,322 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand 8 states. [2019-11-28 02:54:44,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:44,560 INFO L93 Difference]: Finished difference Result 162 states and 185 transitions. [2019-11-28 02:54:44,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:54:44,561 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-28 02:54:44,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:44,563 INFO L225 Difference]: With dead ends: 162 [2019-11-28 02:54:44,563 INFO L226 Difference]: Without dead ends: 134 [2019-11-28 02:54:44,565 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:54:44,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-28 02:54:44,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 90. [2019-11-28 02:54:44,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-28 02:54:44,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2019-11-28 02:54:44,573 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 21 [2019-11-28 02:54:44,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:44,575 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2019-11-28 02:54:44,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:54:44,575 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2019-11-28 02:54:44,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 02:54:44,576 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:44,576 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:44,577 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:44,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:44,577 INFO L82 PathProgramCache]: Analyzing trace with hash -2013141521, now seen corresponding path program 1 times [2019-11-28 02:54:44,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:44,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774159807] [2019-11-28 02:54:44,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:44,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:54:44,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774159807] [2019-11-28 02:54:44,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:44,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 02:54:44,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214573992] [2019-11-28 02:54:44,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:54:44,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:44,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:54:44,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:54:44,807 INFO L87 Difference]: Start difference. First operand 90 states and 110 transitions. Second operand 8 states. [2019-11-28 02:54:45,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:45,053 INFO L93 Difference]: Finished difference Result 232 states and 273 transitions. [2019-11-28 02:54:45,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:54:45,053 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-28 02:54:45,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:45,055 INFO L225 Difference]: With dead ends: 232 [2019-11-28 02:54:45,055 INFO L226 Difference]: Without dead ends: 186 [2019-11-28 02:54:45,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:54:45,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-28 02:54:45,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 130. [2019-11-28 02:54:45,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-28 02:54:45,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 161 transitions. [2019-11-28 02:54:45,069 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 161 transitions. Word has length 23 [2019-11-28 02:54:45,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:45,070 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 161 transitions. [2019-11-28 02:54:45,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:54:45,070 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2019-11-28 02:54:45,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 02:54:45,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:45,071 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:45,071 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:45,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:45,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1836591731, now seen corresponding path program 1 times [2019-11-28 02:54:45,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:45,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039725187] [2019-11-28 02:54:45,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:45,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:54:45,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039725187] [2019-11-28 02:54:45,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:45,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 02:54:45,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213174316] [2019-11-28 02:54:45,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:54:45,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:45,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:54:45,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:54:45,200 INFO L87 Difference]: Start difference. First operand 130 states and 161 transitions. Second operand 8 states. [2019-11-28 02:54:45,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:45,484 INFO L93 Difference]: Finished difference Result 162 states and 193 transitions. [2019-11-28 02:54:45,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:54:45,485 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-28 02:54:45,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:45,485 INFO L225 Difference]: With dead ends: 162 [2019-11-28 02:54:45,486 INFO L226 Difference]: Without dead ends: 90 [2019-11-28 02:54:45,486 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:54:45,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-28 02:54:45,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-11-28 02:54:45,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-28 02:54:45,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2019-11-28 02:54:45,494 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 23 [2019-11-28 02:54:45,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:45,494 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2019-11-28 02:54:45,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:54:45,494 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2019-11-28 02:54:45,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 02:54:45,495 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:45,495 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:45,495 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:45,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:45,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1319121376, now seen corresponding path program 1 times [2019-11-28 02:54:45,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:45,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972605404] [2019-11-28 02:54:45,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:45,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:54:45,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972605404] [2019-11-28 02:54:45,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:45,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:54:45,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819247178] [2019-11-28 02:54:45,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:54:45,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:45,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:54:45,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:54:45,628 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand 7 states. [2019-11-28 02:54:45,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:45,861 INFO L93 Difference]: Finished difference Result 294 states and 332 transitions. [2019-11-28 02:54:45,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:54:45,861 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-28 02:54:45,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:45,863 INFO L225 Difference]: With dead ends: 294 [2019-11-28 02:54:45,863 INFO L226 Difference]: Without dead ends: 250 [2019-11-28 02:54:45,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:54:45,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-11-28 02:54:45,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 130. [2019-11-28 02:54:45,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-28 02:54:45,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 159 transitions. [2019-11-28 02:54:45,875 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 159 transitions. Word has length 27 [2019-11-28 02:54:45,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:45,875 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 159 transitions. [2019-11-28 02:54:45,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:54:45,875 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 159 transitions. [2019-11-28 02:54:45,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 02:54:45,876 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:45,876 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:45,876 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:45,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:45,877 INFO L82 PathProgramCache]: Analyzing trace with hash 590911882, now seen corresponding path program 1 times [2019-11-28 02:54:45,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:45,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330059036] [2019-11-28 02:54:45,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:46,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:54:46,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330059036] [2019-11-28 02:54:46,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:46,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 02:54:46,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671739404] [2019-11-28 02:54:46,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:54:46,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:46,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:54:46,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:54:46,126 INFO L87 Difference]: Start difference. First operand 130 states and 159 transitions. Second operand 9 states. [2019-11-28 02:54:46,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:46,474 INFO L93 Difference]: Finished difference Result 175 states and 203 transitions. [2019-11-28 02:54:46,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:54:46,475 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-11-28 02:54:46,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:46,478 INFO L225 Difference]: With dead ends: 175 [2019-11-28 02:54:46,478 INFO L226 Difference]: Without dead ends: 174 [2019-11-28 02:54:46,481 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:54:46,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-28 02:54:46,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 120. [2019-11-28 02:54:46,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-28 02:54:46,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 145 transitions. [2019-11-28 02:54:46,493 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 145 transitions. Word has length 29 [2019-11-28 02:54:46,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:46,494 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 145 transitions. [2019-11-28 02:54:46,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:54:46,494 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 145 transitions. [2019-11-28 02:54:46,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 02:54:46,496 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:46,496 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:46,496 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:46,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:46,497 INFO L82 PathProgramCache]: Analyzing trace with hash 767461672, now seen corresponding path program 1 times [2019-11-28 02:54:46,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:46,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389622606] [2019-11-28 02:54:46,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:46,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:54:46,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389622606] [2019-11-28 02:54:46,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:46,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:54:46,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118831085] [2019-11-28 02:54:46,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:54:46,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:46,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:54:46,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:54:46,617 INFO L87 Difference]: Start difference. First operand 120 states and 145 transitions. Second operand 6 states. [2019-11-28 02:54:46,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:46,721 INFO L93 Difference]: Finished difference Result 166 states and 197 transitions. [2019-11-28 02:54:46,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:54:46,721 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-11-28 02:54:46,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:46,722 INFO L225 Difference]: With dead ends: 166 [2019-11-28 02:54:46,723 INFO L226 Difference]: Without dead ends: 120 [2019-11-28 02:54:46,724 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:54:46,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-28 02:54:46,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2019-11-28 02:54:46,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-28 02:54:46,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 138 transitions. [2019-11-28 02:54:46,736 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 138 transitions. Word has length 29 [2019-11-28 02:54:46,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:46,736 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 138 transitions. [2019-11-28 02:54:46,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:54:46,737 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 138 transitions. [2019-11-28 02:54:46,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 02:54:46,737 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:46,738 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:46,738 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:46,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:46,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1093653162, now seen corresponding path program 1 times [2019-11-28 02:54:46,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:46,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136534356] [2019-11-28 02:54:46,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:46,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:54:46,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136534356] [2019-11-28 02:54:46,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:46,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:54:46,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268391343] [2019-11-28 02:54:46,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:54:46,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:46,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:54:46,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:54:46,835 INFO L87 Difference]: Start difference. First operand 117 states and 138 transitions. Second operand 6 states. [2019-11-28 02:54:46,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:46,982 INFO L93 Difference]: Finished difference Result 227 states and 251 transitions. [2019-11-28 02:54:46,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:54:46,983 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-11-28 02:54:46,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:46,985 INFO L225 Difference]: With dead ends: 227 [2019-11-28 02:54:46,986 INFO L226 Difference]: Without dead ends: 198 [2019-11-28 02:54:46,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:54:46,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-28 02:54:46,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 127. [2019-11-28 02:54:46,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-28 02:54:46,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 149 transitions. [2019-11-28 02:54:46,997 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 149 transitions. Word has length 31 [2019-11-28 02:54:46,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:46,998 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 149 transitions. [2019-11-28 02:54:46,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:54:46,998 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 149 transitions. [2019-11-28 02:54:46,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 02:54:46,999 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:46,999 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:46,999 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:47,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:47,000 INFO L82 PathProgramCache]: Analyzing trace with hash 964745492, now seen corresponding path program 1 times [2019-11-28 02:54:47,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:47,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234961064] [2019-11-28 02:54:47,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:54:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:54:47,088 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:54:47,088 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 02:54:47,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:54:47 BoogieIcfgContainer [2019-11-28 02:54:47,147 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:54:47,147 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:54:47,147 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:54:47,148 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:54:47,148 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:54:41" (3/4) ... [2019-11-28 02:54:47,153 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 02:54:47,153 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:54:47,161 INFO L168 Benchmark]: Toolchain (without parser) took 6615.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.9 MB). Free memory was 955.0 MB in the beginning and 895.2 MB in the end (delta: 59.8 MB). Peak memory consumption was 272.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:54:47,163 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:54:47,168 INFO L168 Benchmark]: CACSL2BoogieTranslator took 415.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -178.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 02:54:47,171 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.28 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:54:47,172 INFO L168 Benchmark]: Boogie Preprocessor took 39.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:54:47,173 INFO L168 Benchmark]: RCFGBuilder took 729.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. [2019-11-28 02:54:47,177 INFO L168 Benchmark]: TraceAbstraction took 5370.74 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 895.2 MB in the end (delta: 187.3 MB). Peak memory consumption was 257.1 MB. Max. memory is 11.5 GB. [2019-11-28 02:54:47,177 INFO L168 Benchmark]: Witness Printer took 6.16 ms. Allocated memory is still 1.2 GB. Free memory is still 895.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:54:47,183 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 415.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -178.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.28 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 729.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5370.74 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 895.2 MB in the end (delta: 187.3 MB). Peak memory consumption was 257.1 MB. Max. memory is 11.5 GB. * Witness Printer took 6.16 ms. Allocated memory is still 1.2 GB. Free memory is still 895.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 103]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseOr at line 101, overapproximation of bitwiseAnd at line 102. Possible FailurePath: [L217] unsigned int a ; [L218] unsigned int ma = __VERIFIER_nondet_uint(); [L219] signed char ea = __VERIFIER_nondet_char(); [L220] unsigned int b ; [L221] unsigned int mb = __VERIFIER_nondet_uint(); [L222] signed char eb = __VERIFIER_nondet_char(); [L223] unsigned int r_add ; [L224] unsigned int zero ; [L225] int sa ; [L226] int sb ; [L227] int tmp ; [L228] int tmp___0 ; [L229] int tmp___1 ; [L230] int tmp___2 ; [L231] int tmp___3 ; [L232] int tmp___4 ; [L233] int tmp___5 ; [L234] int tmp___6 ; [L235] int tmp___7 ; [L236] int tmp___8 ; [L237] int tmp___9 ; [L238] int __retres23 ; [L16] unsigned int res ; [L17] unsigned int __retres4 ; [L20] COND TRUE ! m [L21] __retres4 = 0U [L71] return (__retres4); [L242] zero = base2flt(0, 0) [L16] unsigned int res ; [L17] unsigned int __retres4 ; [L20] COND FALSE !(! m) [L26] COND FALSE !(m < 1U << 24U) [L48] COND TRUE 1 [L50] COND FALSE !(m >= 1U << 25U) [L67] m = m & ~ (1U << 24U) [L68] EXPR e + 128 [L68] res = m | ((unsigned int ) (e + 128) << 24U) [L69] __retres4 = res [L71] return (__retres4); [L243] a = base2flt(ma, ea) [L16] unsigned int res ; [L17] unsigned int __retres4 ; [L20] COND FALSE !(! m) [L26] COND FALSE !(m < 1U << 24U) [L48] COND TRUE 1 [L50] COND TRUE m >= 1U << 25U [L55] COND TRUE e >= 127 [L56] __retres4 = 4294967295U [L71] return (__retres4); [L244] b = base2flt(mb, eb) [L246] COND FALSE !(a < zero) [L249] COND TRUE a > zero [L250] tmp = 1 [L254] sa = tmp [L256] COND FALSE !(b < zero) [L259] COND TRUE b > zero [L260] tmp___0 = 1 [L264] sb = tmp___0 [L75] unsigned int res ; [L76] unsigned int ma ; [L77] unsigned int mb ; [L78] unsigned int delta ; [L79] int ea ; [L80] int eb ; [L81] unsigned int tmp ; [L82] unsigned int __retres10 ; [L85] COND TRUE a < b [L86] tmp = a [L87] a = b [L88] b = tmp [L92] COND FALSE !(! b) [L99] ma = a & ((1U << 24U) - 1U) [L100] EXPR (int )(a >> 24U) - 128 [L100] ea = (int )(a >> 24U) - 128 [L101] ma = ma | (1U << 24U) [L102] mb = b & ((1U << 24U) - 1U) [L103] (int )(b >> 24U) - 128 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 141 locations, 28 error locations. Result: UNSAFE, OverallTime: 5.2s, OverallIterations: 18, TraceHistogramMax: 2, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1850 SDtfs, 2173 SDslu, 4106 SDs, 0 SdLazy, 1090 SolverSat, 133 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 760 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 330 NumberOfCodeBlocks, 330 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 33514 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...