./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-crafted/NestedRecursion_1b.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash cb528549fa76ae8087cf7043645dfa20323a0116 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:50:03,047 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:50:03,050 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:50:03,069 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:50:03,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:50:03,072 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:50:03,074 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:50:03,083 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:50:03,088 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:50:03,092 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:50:03,093 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:50:03,095 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:50:03,095 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:50:03,098 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:50:03,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:50:03,102 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:50:03,103 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:50:03,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:50:03,107 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:50:03,111 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:50:03,115 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:50:03,119 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:50:03,120 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:50:03,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:50:03,126 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:50:03,127 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:50:03,127 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:50:03,129 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:50:03,130 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:50:03,131 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:50:03,131 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:50:03,132 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:50:03,132 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:50:03,134 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:50:03,135 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:50:03,135 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:50:03,136 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:50:03,137 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:50:03,137 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:50:03,138 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:50:03,139 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:50:03,141 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-28 02:50:03,172 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:50:03,172 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:50:03,173 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:50:03,174 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:50:03,174 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:50:03,174 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:50:03,174 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:50:03,175 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:50:03,175 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:50:03,175 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 02:50:03,175 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:50:03,175 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 02:50:03,176 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-28 02:50:03,176 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 02:50:03,176 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:50:03,176 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 02:50:03,176 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:50:03,177 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:50:03,177 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:50:03,177 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:50:03,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:50:03,178 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:50:03,178 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:50:03,178 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 02:50:03,178 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:50:03,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:50:03,179 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 02:50:03,179 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cb528549fa76ae8087cf7043645dfa20323a0116 [2019-11-28 02:50:03,511 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:50:03,521 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:50:03,526 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:50:03,528 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:50:03,528 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:50:03,529 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c [2019-11-28 02:50:03,605 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/430346a7b/2af0cdb9bdbb4854b5418ac3c60ddfda/FLAG95d52c5ed [2019-11-28 02:50:04,061 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:50:04,062 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c [2019-11-28 02:50:04,068 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/430346a7b/2af0cdb9bdbb4854b5418ac3c60ddfda/FLAG95d52c5ed [2019-11-28 02:50:04,501 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/430346a7b/2af0cdb9bdbb4854b5418ac3c60ddfda [2019-11-28 02:50:04,505 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:50:04,507 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 02:50:04,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:50:04,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:50:04,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:50:04,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:50:04" (1/1) ... [2019-11-28 02:50:04,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33144cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:04, skipping insertion in model container [2019-11-28 02:50:04,519 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:50:04" (1/1) ... [2019-11-28 02:50:04,528 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:50:04,545 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:50:04,706 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:50:04,711 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:50:04,740 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:50:04,756 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:50:04,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:04 WrapperNode [2019-11-28 02:50:04,757 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:50:04,758 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 02:50:04,758 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 02:50:04,759 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 02:50:04,767 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:50:04" (1/1) ... [2019-11-28 02:50:04,773 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:50:04" (1/1) ... [2019-11-28 02:50:04,843 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 02:50:04,844 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:50:04,844 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:50:04,844 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:50:04,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:04" (1/1) ... [2019-11-28 02:50:04,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:04" (1/1) ... [2019-11-28 02:50:04,854 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:04" (1/1) ... [2019-11-28 02:50:04,854 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:04" (1/1) ... [2019-11-28 02:50:04,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:04" (1/1) ... [2019-11-28 02:50:04,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:04" (1/1) ... [2019-11-28 02:50:04,859 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:04" (1/1) ... [2019-11-28 02:50:04,860 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:50:04,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:50:04,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:50:04,861 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:50:04,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:04" (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:50:04,918 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2019-11-28 02:50:04,918 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2019-11-28 02:50:04,919 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2019-11-28 02:50:04,919 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2019-11-28 02:50:04,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:50:04,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:50:05,122 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:50:05,122 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 02:50:05,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:50:05 BoogieIcfgContainer [2019-11-28 02:50:05,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:50:05,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:50:05,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:50:05,129 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:50:05,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:50:04" (1/3) ... [2019-11-28 02:50:05,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d13af65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:50:05, skipping insertion in model container [2019-11-28 02:50:05,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:04" (2/3) ... [2019-11-28 02:50:05,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d13af65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:50:05, skipping insertion in model container [2019-11-28 02:50:05,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:50:05" (3/3) ... [2019-11-28 02:50:05,133 INFO L109 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1b.c [2019-11-28 02:50:05,144 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:50:05,151 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-11-28 02:50:05,164 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-11-28 02:50:05,200 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:50:05,200 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 02:50:05,201 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:50:05,201 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:50:05,201 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:50:05,201 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:50:05,202 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:50:05,202 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:50:05,231 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-11-28 02:50:05,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 02:50:05,238 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:05,239 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 02:50:05,240 INFO L410 AbstractCegarLoop]: === Iteration 1 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:05,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:05,247 INFO L82 PathProgramCache]: Analyzing trace with hash 70122184, now seen corresponding path program 1 times [2019-11-28 02:50:05,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:05,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213956455] [2019-11-28 02:50:05,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:05,406 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:50:05,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213956455] [2019-11-28 02:50:05,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:05,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:50:05,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205892900] [2019-11-28 02:50:05,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:50:05,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:05,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:50:05,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:50:05,433 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 5 states. [2019-11-28 02:50:05,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:05,573 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2019-11-28 02:50:05,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:50:05,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-11-28 02:50:05,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:05,586 INFO L225 Difference]: With dead ends: 62 [2019-11-28 02:50:05,587 INFO L226 Difference]: Without dead ends: 55 [2019-11-28 02:50:05,590 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:50:05,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-28 02:50:05,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2019-11-28 02:50:05,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 02:50:05,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2019-11-28 02:50:05,640 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 5 [2019-11-28 02:50:05,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:05,640 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2019-11-28 02:50:05,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:50:05,641 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2019-11-28 02:50:05,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-28 02:50:05,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:05,642 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-28 02:50:05,642 INFO L410 AbstractCegarLoop]: === Iteration 2 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:05,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:05,643 INFO L82 PathProgramCache]: Analyzing trace with hash -2121179530, now seen corresponding path program 1 times [2019-11-28 02:50:05,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:05,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111901714] [2019-11-28 02:50:05,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:05,673 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:50:05,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111901714] [2019-11-28 02:50:05,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:05,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:50:05,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898575579] [2019-11-28 02:50:05,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:50:05,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:05,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:50:05,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:05,677 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 3 states. [2019-11-28 02:50:05,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:05,697 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2019-11-28 02:50:05,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:50:05,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-28 02:50:05,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:05,699 INFO L225 Difference]: With dead ends: 52 [2019-11-28 02:50:05,700 INFO L226 Difference]: Without dead ends: 51 [2019-11-28 02:50:05,701 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:50:05,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-28 02:50:05,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-11-28 02:50:05,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-28 02:50:05,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2019-11-28 02:50:05,714 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 6 [2019-11-28 02:50:05,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:05,714 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2019-11-28 02:50:05,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:50:05,714 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2019-11-28 02:50:05,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 02:50:05,715 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:05,715 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:05,716 INFO L410 AbstractCegarLoop]: === Iteration 3 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:05,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:05,716 INFO L82 PathProgramCache]: Analyzing trace with hash -2074588191, now seen corresponding path program 1 times [2019-11-28 02:50:05,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:05,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722887296] [2019-11-28 02:50:05,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:05,813 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:50:05,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722887296] [2019-11-28 02:50:05,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:05,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:50:05,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812753894] [2019-11-28 02:50:05,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:50:05,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:05,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:50:05,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:50:05,818 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 7 states. [2019-11-28 02:50:06,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:06,043 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2019-11-28 02:50:06,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:50:06,045 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-11-28 02:50:06,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:06,049 INFO L225 Difference]: With dead ends: 77 [2019-11-28 02:50:06,049 INFO L226 Difference]: Without dead ends: 76 [2019-11-28 02:50:06,050 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:50:06,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-28 02:50:06,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2019-11-28 02:50:06,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-28 02:50:06,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2019-11-28 02:50:06,080 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 81 transitions. Word has length 10 [2019-11-28 02:50:06,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:06,080 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 81 transitions. [2019-11-28 02:50:06,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:50:06,081 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2019-11-28 02:50:06,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 02:50:06,081 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:06,081 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:06,082 INFO L410 AbstractCegarLoop]: === Iteration 4 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:06,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:06,082 INFO L82 PathProgramCache]: Analyzing trace with hash 112275557, now seen corresponding path program 1 times [2019-11-28 02:50:06,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:06,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912721121] [2019-11-28 02:50:06,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:06,111 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:50:06,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912721121] [2019-11-28 02:50:06,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:06,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:50:06,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232066598] [2019-11-28 02:50:06,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:50:06,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:06,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:50:06,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:06,114 INFO L87 Difference]: Start difference. First operand 65 states and 81 transitions. Second operand 3 states. [2019-11-28 02:50:06,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:06,130 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2019-11-28 02:50:06,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:50:06,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-28 02:50:06,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:06,132 INFO L225 Difference]: With dead ends: 69 [2019-11-28 02:50:06,132 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 02:50:06,133 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:50:06,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 02:50:06,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2019-11-28 02:50:06,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-28 02:50:06,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2019-11-28 02:50:06,147 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 11 [2019-11-28 02:50:06,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:06,147 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2019-11-28 02:50:06,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:50:06,148 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2019-11-28 02:50:06,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 02:50:06,149 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:06,149 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:06,150 INFO L410 AbstractCegarLoop]: === Iteration 5 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:06,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:06,150 INFO L82 PathProgramCache]: Analyzing trace with hash -2048531074, now seen corresponding path program 1 times [2019-11-28 02:50:06,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:06,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069144013] [2019-11-28 02:50:06,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:06,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:06,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069144013] [2019-11-28 02:50:06,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:06,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:50:06,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553588518] [2019-11-28 02:50:06,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:50:06,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:06,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:50:06,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:50:06,215 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 6 states. [2019-11-28 02:50:06,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:06,278 INFO L93 Difference]: Finished difference Result 125 states and 160 transitions. [2019-11-28 02:50:06,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:50:06,279 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-28 02:50:06,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:06,281 INFO L225 Difference]: With dead ends: 125 [2019-11-28 02:50:06,281 INFO L226 Difference]: Without dead ends: 86 [2019-11-28 02:50:06,283 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:50:06,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-28 02:50:06,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2019-11-28 02:50:06,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-28 02:50:06,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2019-11-28 02:50:06,308 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 16 [2019-11-28 02:50:06,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:06,309 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2019-11-28 02:50:06,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:50:06,309 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2019-11-28 02:50:06,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 02:50:06,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:06,311 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:06,312 INFO L410 AbstractCegarLoop]: === Iteration 6 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:06,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:06,312 INFO L82 PathProgramCache]: Analyzing trace with hash -57180086, now seen corresponding path program 1 times [2019-11-28 02:50:06,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:06,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426616271] [2019-11-28 02:50:06,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:06,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:50:06,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426616271] [2019-11-28 02:50:06,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:06,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:50:06,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815683960] [2019-11-28 02:50:06,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:50:06,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:06,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:50:06,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:06,360 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand 3 states. [2019-11-28 02:50:06,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:06,374 INFO L93 Difference]: Finished difference Result 76 states and 98 transitions. [2019-11-28 02:50:06,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:50:06,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 02:50:06,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:06,376 INFO L225 Difference]: With dead ends: 76 [2019-11-28 02:50:06,376 INFO L226 Difference]: Without dead ends: 75 [2019-11-28 02:50:06,377 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:50:06,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-28 02:50:06,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-11-28 02:50:06,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-28 02:50:06,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2019-11-28 02:50:06,392 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 18 [2019-11-28 02:50:06,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:06,393 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2019-11-28 02:50:06,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:50:06,393 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2019-11-28 02:50:06,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:50:06,394 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:06,394 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:06,395 INFO L410 AbstractCegarLoop]: === Iteration 7 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:06,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:06,395 INFO L82 PathProgramCache]: Analyzing trace with hash -599425808, now seen corresponding path program 1 times [2019-11-28 02:50:06,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:06,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481580314] [2019-11-28 02:50:06,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:06,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:50:06,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481580314] [2019-11-28 02:50:06,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:06,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:50:06,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427270758] [2019-11-28 02:50:06,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:50:06,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:06,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:50:06,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:06,451 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand 3 states. [2019-11-28 02:50:06,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:06,475 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2019-11-28 02:50:06,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:50:06,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 02:50:06,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:06,477 INFO L225 Difference]: With dead ends: 75 [2019-11-28 02:50:06,477 INFO L226 Difference]: Without dead ends: 74 [2019-11-28 02:50:06,478 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:50:06,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-28 02:50:06,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-28 02:50:06,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-28 02:50:06,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2019-11-28 02:50:06,507 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 19 [2019-11-28 02:50:06,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:06,508 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2019-11-28 02:50:06,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:50:06,509 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2019-11-28 02:50:06,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:50:06,510 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:06,510 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:06,511 INFO L410 AbstractCegarLoop]: === Iteration 8 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:06,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:06,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1772582622, now seen corresponding path program 1 times [2019-11-28 02:50:06,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:06,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127375963] [2019-11-28 02:50:06,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:06,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:50:06,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127375963] [2019-11-28 02:50:06,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:06,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:50:06,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616365076] [2019-11-28 02:50:06,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:50:06,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:06,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:50:06,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:50:06,562 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 4 states. [2019-11-28 02:50:06,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:06,590 INFO L93 Difference]: Finished difference Result 95 states and 126 transitions. [2019-11-28 02:50:06,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:50:06,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-28 02:50:06,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:06,592 INFO L225 Difference]: With dead ends: 95 [2019-11-28 02:50:06,593 INFO L226 Difference]: Without dead ends: 94 [2019-11-28 02:50:06,593 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:50:06,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-28 02:50:06,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2019-11-28 02:50:06,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-28 02:50:06,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2019-11-28 02:50:06,607 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 19 [2019-11-28 02:50:06,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:06,607 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2019-11-28 02:50:06,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:50:06,608 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2019-11-28 02:50:06,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 02:50:06,609 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:06,609 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:06,609 INFO L410 AbstractCegarLoop]: === Iteration 9 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:06,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:06,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1402330794, now seen corresponding path program 1 times [2019-11-28 02:50:06,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:06,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156075842] [2019-11-28 02:50:06,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:06,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:06,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:50:06,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156075842] [2019-11-28 02:50:06,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:06,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:50:06,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073660745] [2019-11-28 02:50:06,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:50:06,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:06,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:50:06,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:50:06,690 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand 4 states. [2019-11-28 02:50:06,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:06,712 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2019-11-28 02:50:06,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:50:06,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-28 02:50:06,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:06,714 INFO L225 Difference]: With dead ends: 89 [2019-11-28 02:50:06,715 INFO L226 Difference]: Without dead ends: 83 [2019-11-28 02:50:06,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:50:06,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-28 02:50:06,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-11-28 02:50:06,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-28 02:50:06,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-11-28 02:50:06,730 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 20 [2019-11-28 02:50:06,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:06,731 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-11-28 02:50:06,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:50:06,731 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-11-28 02:50:06,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 02:50:06,732 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:06,733 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:06,734 INFO L410 AbstractCegarLoop]: === Iteration 10 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:06,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:06,734 INFO L82 PathProgramCache]: Analyzing trace with hash 921726737, now seen corresponding path program 1 times [2019-11-28 02:50:06,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:06,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922373730] [2019-11-28 02:50:06,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:06,807 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:50:06,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922373730] [2019-11-28 02:50:06,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:06,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:50:06,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541613647] [2019-11-28 02:50:06,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:50:06,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:06,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:50:06,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:50:06,810 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 6 states. [2019-11-28 02:50:06,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:06,912 INFO L93 Difference]: Finished difference Result 167 states and 222 transitions. [2019-11-28 02:50:06,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:50:06,915 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-11-28 02:50:06,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:06,917 INFO L225 Difference]: With dead ends: 167 [2019-11-28 02:50:06,917 INFO L226 Difference]: Without dead ends: 101 [2019-11-28 02:50:06,928 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 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:50:06,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-28 02:50:06,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2019-11-28 02:50:06,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-28 02:50:06,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2019-11-28 02:50:06,946 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 23 [2019-11-28 02:50:06,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:06,947 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2019-11-28 02:50:06,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:50:06,947 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2019-11-28 02:50:06,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 02:50:06,949 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:06,949 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:06,949 INFO L410 AbstractCegarLoop]: === Iteration 11 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:06,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:06,950 INFO L82 PathProgramCache]: Analyzing trace with hash 970950199, now seen corresponding path program 1 times [2019-11-28 02:50:06,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:06,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927045783] [2019-11-28 02:50:06,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:07,041 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 02:50:07,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927045783] [2019-11-28 02:50:07,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:07,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:50:07,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730570271] [2019-11-28 02:50:07,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:50:07,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:07,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:50:07,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:50:07,045 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand 6 states. [2019-11-28 02:50:07,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:07,128 INFO L93 Difference]: Finished difference Result 176 states and 226 transitions. [2019-11-28 02:50:07,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:50:07,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-28 02:50:07,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:07,132 INFO L225 Difference]: With dead ends: 176 [2019-11-28 02:50:07,132 INFO L226 Difference]: Without dead ends: 105 [2019-11-28 02:50:07,136 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:50:07,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-28 02:50:07,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 97. [2019-11-28 02:50:07,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-28 02:50:07,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2019-11-28 02:50:07,156 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 34 [2019-11-28 02:50:07,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:07,159 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2019-11-28 02:50:07,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:50:07,159 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2019-11-28 02:50:07,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 02:50:07,163 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:07,164 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:07,164 INFO L410 AbstractCegarLoop]: === Iteration 12 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:07,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:07,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1027694963, now seen corresponding path program 1 times [2019-11-28 02:50:07,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:07,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474659397] [2019-11-28 02:50:07,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:07,241 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-28 02:50:07,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474659397] [2019-11-28 02:50:07,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:07,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:50:07,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073077411] [2019-11-28 02:50:07,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:50:07,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:07,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:50:07,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:50:07,244 INFO L87 Difference]: Start difference. First operand 97 states and 117 transitions. Second operand 4 states. [2019-11-28 02:50:07,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:07,266 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2019-11-28 02:50:07,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:50:07,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-28 02:50:07,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:07,272 INFO L225 Difference]: With dead ends: 104 [2019-11-28 02:50:07,272 INFO L226 Difference]: Without dead ends: 103 [2019-11-28 02:50:07,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:50:07,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-28 02:50:07,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-11-28 02:50:07,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-28 02:50:07,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2019-11-28 02:50:07,284 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 37 [2019-11-28 02:50:07,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:07,284 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2019-11-28 02:50:07,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:50:07,284 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2019-11-28 02:50:07,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 02:50:07,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:07,286 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:07,286 INFO L410 AbstractCegarLoop]: === Iteration 13 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:07,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:07,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1793772729, now seen corresponding path program 1 times [2019-11-28 02:50:07,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:07,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908238598] [2019-11-28 02:50:07,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:07,322 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-28 02:50:07,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908238598] [2019-11-28 02:50:07,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:07,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:50:07,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081244974] [2019-11-28 02:50:07,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:50:07,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:07,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:50:07,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:07,324 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand 3 states. [2019-11-28 02:50:07,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:07,344 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2019-11-28 02:50:07,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:50:07,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-28 02:50:07,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:07,346 INFO L225 Difference]: With dead ends: 101 [2019-11-28 02:50:07,347 INFO L226 Difference]: Without dead ends: 100 [2019-11-28 02:50:07,347 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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:50:07,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-28 02:50:07,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-11-28 02:50:07,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-28 02:50:07,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2019-11-28 02:50:07,359 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 38 [2019-11-28 02:50:07,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:07,360 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2019-11-28 02:50:07,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:50:07,360 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2019-11-28 02:50:07,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-28 02:50:07,362 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:07,362 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:07,362 INFO L410 AbstractCegarLoop]: === Iteration 14 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:07,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:07,363 INFO L82 PathProgramCache]: Analyzing trace with hash -747989016, now seen corresponding path program 1 times [2019-11-28 02:50:07,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:07,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534166853] [2019-11-28 02:50:07,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:07,469 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-28 02:50:07,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534166853] [2019-11-28 02:50:07,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:07,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:50:07,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131811875] [2019-11-28 02:50:07,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:50:07,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:07,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:50:07,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:50:07,474 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand 6 states. [2019-11-28 02:50:07,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:07,527 INFO L93 Difference]: Finished difference Result 110 states and 131 transitions. [2019-11-28 02:50:07,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:50:07,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-11-28 02:50:07,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:07,529 INFO L225 Difference]: With dead ends: 110 [2019-11-28 02:50:07,529 INFO L226 Difference]: Without dead ends: 109 [2019-11-28 02:50:07,529 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:50:07,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-28 02:50:07,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2019-11-28 02:50:07,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-28 02:50:07,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 117 transitions. [2019-11-28 02:50:07,539 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 117 transitions. Word has length 43 [2019-11-28 02:50:07,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:07,539 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 117 transitions. [2019-11-28 02:50:07,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:50:07,539 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 117 transitions. [2019-11-28 02:50:07,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-28 02:50:07,541 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:07,541 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 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:50:07,541 INFO L410 AbstractCegarLoop]: === Iteration 15 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:07,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:07,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1488967228, now seen corresponding path program 1 times [2019-11-28 02:50:07,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:07,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058252745] [2019-11-28 02:50:07,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:07,649 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-28 02:50:07,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058252745] [2019-11-28 02:50:07,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140607040] [2019-11-28 02:50:07,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:07,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:50:07,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:07,867 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-28 02:50:07,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:50:07,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2019-11-28 02:50:07,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960576846] [2019-11-28 02:50:07,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:50:07,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:07,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:50:07,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:50:07,874 INFO L87 Difference]: Start difference. First operand 99 states and 117 transitions. Second operand 7 states. [2019-11-28 02:50:07,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:07,972 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2019-11-28 02:50:07,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:50:07,973 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-11-28 02:50:07,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:07,974 INFO L225 Difference]: With dead ends: 100 [2019-11-28 02:50:07,975 INFO L226 Difference]: Without dead ends: 99 [2019-11-28 02:50:07,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-11-28 02:50:07,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-28 02:50:07,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-11-28 02:50:07,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-28 02:50:07,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 116 transitions. [2019-11-28 02:50:07,990 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 116 transitions. Word has length 40 [2019-11-28 02:50:07,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:07,991 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 116 transitions. [2019-11-28 02:50:07,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:50:07,991 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions. [2019-11-28 02:50:07,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 02:50:07,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:07,995 INFO L410 BasicCegarLoop]: trace histogram [7, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:08,210 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:08,210 INFO L410 AbstractCegarLoop]: === Iteration 16 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:08,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:08,211 INFO L82 PathProgramCache]: Analyzing trace with hash 822906818, now seen corresponding path program 1 times [2019-11-28 02:50:08,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:08,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614099643] [2019-11-28 02:50:08,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:08,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:08,320 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-28 02:50:08,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614099643] [2019-11-28 02:50:08,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819285752] [2019-11-28 02:50:08,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:08,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:08,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:50:08,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:08,463 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-28 02:50:08,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:50:08,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2019-11-28 02:50:08,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888596609] [2019-11-28 02:50:08,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:50:08,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:08,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:50:08,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:50:08,465 INFO L87 Difference]: Start difference. First operand 98 states and 116 transitions. Second operand 7 states. [2019-11-28 02:50:08,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:08,693 INFO L93 Difference]: Finished difference Result 126 states and 151 transitions. [2019-11-28 02:50:08,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:50:08,694 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-28 02:50:08,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:08,695 INFO L225 Difference]: With dead ends: 126 [2019-11-28 02:50:08,695 INFO L226 Difference]: Without dead ends: 125 [2019-11-28 02:50:08,696 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-11-28 02:50:08,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-28 02:50:08,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-11-28 02:50:08,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-28 02:50:08,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 150 transitions. [2019-11-28 02:50:08,708 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 150 transitions. Word has length 52 [2019-11-28 02:50:08,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:08,709 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 150 transitions. [2019-11-28 02:50:08,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:50:08,709 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 150 transitions. [2019-11-28 02:50:08,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 02:50:08,710 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:08,710 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 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:50:08,914 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:08,915 INFO L410 AbstractCegarLoop]: === Iteration 17 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:08,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:08,916 INFO L82 PathProgramCache]: Analyzing trace with hash 695736933, now seen corresponding path program 1 times [2019-11-28 02:50:08,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:08,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397813241] [2019-11-28 02:50:08,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,033 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-28 02:50:09,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397813241] [2019-11-28 02:50:09,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498323476] [2019-11-28 02:50:09,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:50:09,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:09,141 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-28 02:50:09,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:50:09,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2019-11-28 02:50:09,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445127416] [2019-11-28 02:50:09,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:50:09,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:09,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:50:09,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:50:09,143 INFO L87 Difference]: Start difference. First operand 124 states and 150 transitions. Second operand 5 states. [2019-11-28 02:50:09,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:09,213 INFO L93 Difference]: Finished difference Result 152 states and 185 transitions. [2019-11-28 02:50:09,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:50:09,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-28 02:50:09,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:09,216 INFO L225 Difference]: With dead ends: 152 [2019-11-28 02:50:09,216 INFO L226 Difference]: Without dead ends: 151 [2019-11-28 02:50:09,217 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:50:09,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-28 02:50:09,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2019-11-28 02:50:09,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-28 02:50:09,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 184 transitions. [2019-11-28 02:50:09,231 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 184 transitions. Word has length 45 [2019-11-28 02:50:09,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:09,232 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 184 transitions. [2019-11-28 02:50:09,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:50:09,232 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 184 transitions. [2019-11-28 02:50:09,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-28 02:50:09,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:09,234 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:50:09,446 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:09,446 INFO L410 AbstractCegarLoop]: === Iteration 18 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:09,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:09,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1252678887, now seen corresponding path program 1 times [2019-11-28 02:50:09,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:09,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930020624] [2019-11-28 02:50:09,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,526 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-28 02:50:09,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930020624] [2019-11-28 02:50:09,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750625386] [2019-11-28 02:50:09,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:50:09,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:09,584 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-28 02:50:09,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:09,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-28 02:50:09,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552583347] [2019-11-28 02:50:09,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:50:09,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:09,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:50:09,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:50:09,587 INFO L87 Difference]: Start difference. First operand 150 states and 184 transitions. Second operand 6 states. [2019-11-28 02:50:09,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:09,612 INFO L93 Difference]: Finished difference Result 159 states and 194 transitions. [2019-11-28 02:50:09,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:50:09,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-11-28 02:50:09,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:09,616 INFO L225 Difference]: With dead ends: 159 [2019-11-28 02:50:09,616 INFO L226 Difference]: Without dead ends: 155 [2019-11-28 02:50:09,618 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:50:09,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-28 02:50:09,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-11-28 02:50:09,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-28 02:50:09,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 189 transitions. [2019-11-28 02:50:09,628 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 189 transitions. Word has length 60 [2019-11-28 02:50:09,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:09,629 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 189 transitions. [2019-11-28 02:50:09,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:50:09,629 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 189 transitions. [2019-11-28 02:50:09,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-28 02:50:09,630 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:09,630 INFO L410 BasicCegarLoop]: trace histogram [10, 8, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:09,832 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:09,833 INFO L410 AbstractCegarLoop]: === Iteration 19 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:09,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:09,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1438531096, now seen corresponding path program 2 times [2019-11-28 02:50:09,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:09,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381557909] [2019-11-28 02:50:09,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,050 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 60 proven. 32 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-28 02:50:10,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381557909] [2019-11-28 02:50:10,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509746377] [2019-11-28 02:50:10,051 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:10,111 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:50:10,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:50:10,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:50:10,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:10,193 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 64 proven. 28 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-28 02:50:10,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:10,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 13 [2019-11-28 02:50:10,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895149588] [2019-11-28 02:50:10,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 02:50:10,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:10,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 02:50:10,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:50:10,195 INFO L87 Difference]: Start difference. First operand 155 states and 189 transitions. Second operand 13 states. [2019-11-28 02:50:10,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:10,426 INFO L93 Difference]: Finished difference Result 234 states and 284 transitions. [2019-11-28 02:50:10,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:50:10,426 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2019-11-28 02:50:10,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:10,428 INFO L225 Difference]: With dead ends: 234 [2019-11-28 02:50:10,428 INFO L226 Difference]: Without dead ends: 97 [2019-11-28 02:50:10,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2019-11-28 02:50:10,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-28 02:50:10,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 85. [2019-11-28 02:50:10,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-28 02:50:10,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2019-11-28 02:50:10,436 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 77 [2019-11-28 02:50:10,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:10,437 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2019-11-28 02:50:10,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 02:50:10,437 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2019-11-28 02:50:10,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-28 02:50:10,442 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:10,442 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 9, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2019-11-28 02:50:10,646 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:10,647 INFO L410 AbstractCegarLoop]: === Iteration 20 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:10,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:10,648 INFO L82 PathProgramCache]: Analyzing trace with hash -151262980, now seen corresponding path program 2 times [2019-11-28 02:50:10,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:10,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216217235] [2019-11-28 02:50:10,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,011 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 73 proven. 96 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-11-28 02:50:11,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216217235] [2019-11-28 02:50:11,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217782371] [2019-11-28 02:50:11,012 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:11,075 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:50:11,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:50:11,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 02:50:11,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:11,180 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 48 proven. 78 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2019-11-28 02:50:11,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:11,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10] total 23 [2019-11-28 02:50:11,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219608271] [2019-11-28 02:50:11,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-28 02:50:11,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:11,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-28 02:50:11,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2019-11-28 02:50:11,182 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 23 states. [2019-11-28 02:50:11,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:11,634 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2019-11-28 02:50:11,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 02:50:11,635 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 124 [2019-11-28 02:50:11,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:11,635 INFO L225 Difference]: With dead ends: 95 [2019-11-28 02:50:11,636 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 02:50:11,637 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2019-11-28 02:50:11,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 02:50:11,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 02:50:11,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 02:50:11,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 02:50:11,638 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 124 [2019-11-28 02:50:11,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:11,639 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:50:11,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-28 02:50:11,639 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:50:11,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 02:50:11,839 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:11,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 02:50:12,160 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 18 [2019-11-28 02:50:12,362 INFO L246 CegarLoopResult]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 02:50:12,362 INFO L246 CegarLoopResult]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2019-11-28 02:50:12,362 INFO L246 CegarLoopResult]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 02:50:12,362 INFO L246 CegarLoopResult]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2019-11-28 02:50:12,362 INFO L246 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2019-11-28 02:50:12,362 INFO L249 CegarLoopResult]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2019-11-28 02:50:12,363 INFO L246 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-11-28 02:50:12,363 INFO L246 CegarLoopResult]: For program point L12(lines 12 13) no Hoare annotation was computed. [2019-11-28 02:50:12,363 INFO L242 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: (and (or (= |rec1_#in~i| rec1_~i) (not (<= |rec1_#in~i| 2147483647))) (not (<= |rec1_#in~i| 0))) [2019-11-28 02:50:12,363 INFO L246 CegarLoopResult]: For program point L14-3(line 14) no Hoare annotation was computed. [2019-11-28 02:50:12,363 INFO L246 CegarLoopResult]: For program point L14-4(line 14) no Hoare annotation was computed. [2019-11-28 02:50:12,363 INFO L246 CegarLoopResult]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 02:50:12,363 INFO L246 CegarLoopResult]: For program point L14-5(line 14) no Hoare annotation was computed. [2019-11-28 02:50:12,364 INFO L242 CegarLoopResult]: At program point L14-6(line 14) the Hoare annotation is: (and (not (<= |rec1_#in~i| 0)) (or (and (= |rec1_#in~i| rec1_~i) (<= |rec1_#t~ret0| 1)) (not (<= |rec1_#in~i| 2147483647)))) [2019-11-28 02:50:12,364 INFO L246 CegarLoopResult]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 02:50:12,364 INFO L246 CegarLoopResult]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 02:50:12,364 INFO L246 CegarLoopResult]: For program point L14-7(line 14) no Hoare annotation was computed. [2019-11-28 02:50:12,364 INFO L246 CegarLoopResult]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 02:50:12,364 INFO L242 CegarLoopResult]: At program point L14-8(line 14) the Hoare annotation is: (and (or (not (<= |rec1_#in~i| 2147483647)) (and (<= |rec1_#t~ret1| 0) (= |rec1_#in~i| rec1_~i) (<= |rec1_#t~ret0| 1))) (or (<= 1 rec1_~i) (not (<= |rec1_#in~i| 2147483646)))) [2019-11-28 02:50:12,364 INFO L246 CegarLoopResult]: For program point L14-9(line 14) no Hoare annotation was computed. [2019-11-28 02:50:12,366 INFO L246 CegarLoopResult]: For program point L14-10(line 14) no Hoare annotation was computed. [2019-11-28 02:50:12,366 INFO L246 CegarLoopResult]: For program point L14-11(line 14) no Hoare annotation was computed. [2019-11-28 02:50:12,366 INFO L246 CegarLoopResult]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 02:50:12,366 INFO L246 CegarLoopResult]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2019-11-28 02:50:12,367 INFO L246 CegarLoopResult]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2019-11-28 02:50:12,367 INFO L246 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2019-11-28 02:50:12,367 INFO L246 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-11-28 02:50:12,367 INFO L246 CegarLoopResult]: For program point L18(lines 18 19) no Hoare annotation was computed. [2019-11-28 02:50:12,367 INFO L242 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (and (or (= rec2_~j |rec2_#in~j|) (not (<= |rec2_#in~j| 2147483647))) (not (<= |rec2_#in~j| 0))) [2019-11-28 02:50:12,367 INFO L246 CegarLoopResult]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-11-28 02:50:12,368 INFO L242 CegarLoopResult]: At program point L20-4(line 20) the Hoare annotation is: (let ((.cse0 (not (<= |rec2_#in~j| 2147483647)))) (and (or (= rec2_~j |rec2_#in~j|) .cse0) (or (and (<= |rec2_#t~ret3| 1) (<= (+ |rec2_#t~ret3| 1) |rec2_#in~j|)) .cse0) (not (<= |rec2_#in~j| 0)))) [2019-11-28 02:50:12,368 INFO L246 CegarLoopResult]: For program point L20-5(line 20) no Hoare annotation was computed. [2019-11-28 02:50:12,368 INFO L246 CegarLoopResult]: For program point L20-6(line 20) no Hoare annotation was computed. [2019-11-28 02:50:12,368 INFO L246 CegarLoopResult]: For program point L20-7(line 20) no Hoare annotation was computed. [2019-11-28 02:50:12,368 INFO L249 CegarLoopResult]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2019-11-28 02:50:12,369 INFO L246 CegarLoopResult]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 02:50:12,369 INFO L246 CegarLoopResult]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 02:50:12,369 INFO L246 CegarLoopResult]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 02:50:12,369 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 02:50:12,369 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 02:50:12,369 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 02:50:12,370 INFO L242 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-11-28 02:50:12,370 INFO L246 CegarLoopResult]: For program point L25-1(line 25) no Hoare annotation was computed. [2019-11-28 02:50:12,370 INFO L246 CegarLoopResult]: For program point L23(lines 23 26) no Hoare annotation was computed. [2019-11-28 02:50:12,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:50:12 BoogieIcfgContainer [2019-11-28 02:50:12,379 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:50:12,380 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:50:12,380 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:50:12,380 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:50:12,380 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:50:05" (3/4) ... [2019-11-28 02:50:12,386 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 02:50:12,398 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2019-11-28 02:50:12,398 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2019-11-28 02:50:12,409 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 02:50:12,409 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 02:50:12,505 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:50:12,505 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:50:12,511 INFO L168 Benchmark]: Toolchain (without parser) took 7999.86 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 292.0 MB). Free memory was 952.3 MB in the beginning and 1.2 GB in the end (delta: -278.1 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:12,511 INFO L168 Benchmark]: CDTParser took 1.28 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:50:12,512 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.35 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:12,512 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -175.8 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:12,513 INFO L168 Benchmark]: Boogie Preprocessor took 16.61 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:50:12,513 INFO L168 Benchmark]: RCFGBuilder took 263.07 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: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:12,513 INFO L168 Benchmark]: TraceAbstraction took 7253.94 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 170.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -142.3 MB). Peak memory consumption was 374.9 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:12,514 INFO L168 Benchmark]: Witness Printer took 125.58 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:12,516 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.28 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 247.35 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 85.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -175.8 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.61 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. * RCFGBuilder took 263.07 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: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7253.94 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 170.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -142.3 MB). Peak memory consumption was 374.9 MB. Max. memory is 11.5 GB. * Witness Printer took 125.58 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 44 locations, 10 error locations. Result: SAFE, OverallTime: 6.6s, OverallIterations: 20, TraceHistogramMax: 12, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, HoareTripleCheckerStatistics: 761 SDtfs, 331 SDslu, 2113 SDs, 0 SdLazy, 1002 SolverSat, 117 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 658 GetRequests, 522 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 93 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 222 PreInvPairs, 238 NumberOfFragments, 99 HoareAnnotationTreeSize, 222 FomulaSimplifications, 713 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 455 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1095 NumberOfCodeBlocks, 1095 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1069 ConstructedInterpolants, 0 QuantifiedInterpolants, 115121 SizeOfPredicates, 8 NumberOfNonLiveVariables, 820 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 26 InterpolantComputations, 17 PerfectInterpolantSequences, 1315/1565 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 proved your program to be correct! Received shutdown request...