./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 91b1670e Calling Ultimate with: 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 /storage/repos/svcomp/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.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-91b1670 [2018-11-28 23:06:16,426 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:06:16,428 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:06:16,444 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:06:16,445 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:06:16,447 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:06:16,449 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:06:16,451 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:06:16,454 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:06:16,455 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:06:16,456 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:06:16,457 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:06:16,458 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:06:16,459 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:06:16,460 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:06:16,461 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:06:16,461 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:06:16,463 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:06:16,465 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:06:16,467 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:06:16,468 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:06:16,469 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:06:16,472 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:06:16,472 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:06:16,472 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:06:16,473 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:06:16,474 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:06:16,475 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:06:16,476 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:06:16,477 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:06:16,477 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:06:16,478 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:06:16,478 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:06:16,479 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:06:16,480 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:06:16,480 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:06:16,481 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2018-11-28 23:06:16,495 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:06:16,495 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:06:16,496 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 23:06:16,496 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 23:06:16,497 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:06:16,497 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:06:16,497 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:06:16,498 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:06:16,498 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:06:16,498 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:06:16,498 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:06:16,498 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 23:06:16,499 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 23:06:16,499 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 23:06:16,499 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-28 23:06:16,499 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:06:16,499 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:06:16,499 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 23:06:16,500 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:06:16,500 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:06:16,500 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 23:06:16,500 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 23:06:16,500 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 23:06:16,500 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:06:16,501 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 23:06:16,501 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 23:06:16,501 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:06:16,501 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 23:06:16,501 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 23:06:16,501 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 [2018-11-28 23:06:16,540 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:06:16,555 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:06:16,560 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:06:16,561 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:06:16,562 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:06:16,562 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-28 23:06:16,627 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d77286eb0/0a75e894f45d4280a017c8c775104321/FLAG97ef76e31 [2018-11-28 23:06:17,089 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:06:17,089 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-28 23:06:17,095 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d77286eb0/0a75e894f45d4280a017c8c775104321/FLAG97ef76e31 [2018-11-28 23:06:17,469 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d77286eb0/0a75e894f45d4280a017c8c775104321 [2018-11-28 23:06:17,475 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:06:17,477 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:06:17,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:06:17,483 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:06:17,487 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:06:17,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:06:17" (1/1) ... [2018-11-28 23:06:17,493 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@189f7ec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:17, skipping insertion in model container [2018-11-28 23:06:17,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:06:17" (1/1) ... [2018-11-28 23:06:17,502 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:06:17,523 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:06:17,762 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:06:17,768 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:06:17,795 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:06:17,822 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:06:17,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:17 WrapperNode [2018-11-28 23:06:17,823 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:06:17,824 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:06:17,824 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:06:17,824 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:06:17,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:17" (1/1) ... [2018-11-28 23:06:17,841 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:17" (1/1) ... [2018-11-28 23:06:17,849 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:06:17,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:06:17,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:06:17,850 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:06:17,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:17" (1/1) ... [2018-11-28 23:06:17,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:17" (1/1) ... [2018-11-28 23:06:17,862 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:17" (1/1) ... [2018-11-28 23:06:17,867 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:17" (1/1) ... [2018-11-28 23:06:17,873 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:17" (1/1) ... [2018-11-28 23:06:17,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:17" (1/1) ... [2018-11-28 23:06:17,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:17" (1/1) ... [2018-11-28 23:06:17,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:06:17,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:06:17,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:06:17,883 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:06:17,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:17" (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 [2018-11-28 23:06:18,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 23:06:18,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 23:06:18,013 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2018-11-28 23:06:18,014 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2018-11-28 23:06:18,015 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2018-11-28 23:06:18,015 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2018-11-28 23:06:18,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:06:18,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:06:18,015 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 23:06:18,015 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 23:06:18,447 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:06:18,447 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-28 23:06:18,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:06:18 BoogieIcfgContainer [2018-11-28 23:06:18,448 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:06:18,449 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 23:06:18,449 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 23:06:18,453 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 23:06:18,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:06:17" (1/3) ... [2018-11-28 23:06:18,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cbde7c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:06:18, skipping insertion in model container [2018-11-28 23:06:18,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:17" (2/3) ... [2018-11-28 23:06:18,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cbde7c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:06:18, skipping insertion in model container [2018-11-28 23:06:18,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:06:18" (3/3) ... [2018-11-28 23:06:18,458 INFO L112 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-28 23:06:18,468 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 23:06:18,475 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-11-28 23:06:18,490 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2018-11-28 23:06:18,525 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:06:18,526 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 23:06:18,526 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 23:06:18,526 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 23:06:18,527 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:06:18,527 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:06:18,527 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 23:06:18,527 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:06:18,527 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 23:06:18,552 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-11-28 23:06:18,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 23:06:18,561 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:18,562 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:18,567 INFO L423 AbstractCegarLoop]: === Iteration 1 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:18,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:18,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1147028286, now seen corresponding path program 1 times [2018-11-28 23:06:18,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:18,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:18,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:18,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:18,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:18,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:18,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:18,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:06:18,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 23:06:18,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:06:18,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:06:18,858 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 5 states. [2018-11-28 23:06:19,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:19,014 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2018-11-28 23:06:19,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:06:19,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-28 23:06:19,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:19,028 INFO L225 Difference]: With dead ends: 67 [2018-11-28 23:06:19,028 INFO L226 Difference]: Without dead ends: 59 [2018-11-28 23:06:19,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:06:19,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-28 23:06:19,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2018-11-28 23:06:19,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-28 23:06:19,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2018-11-28 23:06:19,086 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 9 [2018-11-28 23:06:19,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:19,087 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-11-28 23:06:19,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 23:06:19,087 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-11-28 23:06:19,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 23:06:19,088 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:19,088 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:19,089 INFO L423 AbstractCegarLoop]: === Iteration 2 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:19,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:19,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1198138435, now seen corresponding path program 1 times [2018-11-28 23:06:19,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:19,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:19,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:19,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:19,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:19,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:19,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:19,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:06:19,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:06:19,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:06:19,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:06:19,126 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 3 states. [2018-11-28 23:06:19,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:19,170 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-28 23:06:19,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:06:19,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 23:06:19,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:19,173 INFO L225 Difference]: With dead ends: 56 [2018-11-28 23:06:19,173 INFO L226 Difference]: Without dead ends: 55 [2018-11-28 23:06:19,175 INFO L631 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 [2018-11-28 23:06:19,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-28 23:06:19,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-11-28 23:06:19,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-28 23:06:19,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-11-28 23:06:19,187 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 10 [2018-11-28 23:06:19,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:19,188 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-11-28 23:06:19,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:06:19,188 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-11-28 23:06:19,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 23:06:19,190 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:19,190 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:19,190 INFO L423 AbstractCegarLoop]: === Iteration 3 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:19,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:19,191 INFO L82 PathProgramCache]: Analyzing trace with hash 2126464488, now seen corresponding path program 1 times [2018-11-28 23:06:19,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:19,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:19,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:19,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:19,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:19,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:19,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:19,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:06:19,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 23:06:19,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:06:19,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:06:19,266 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 5 states. [2018-11-28 23:06:19,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:19,678 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2018-11-28 23:06:19,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:06:19,679 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-28 23:06:19,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:19,681 INFO L225 Difference]: With dead ends: 77 [2018-11-28 23:06:19,681 INFO L226 Difference]: Without dead ends: 76 [2018-11-28 23:06:19,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:06:19,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-28 23:06:19,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2018-11-28 23:06:19,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-28 23:06:19,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2018-11-28 23:06:19,698 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 14 [2018-11-28 23:06:19,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:19,699 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2018-11-28 23:06:19,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 23:06:19,699 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2018-11-28 23:06:19,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 23:06:19,700 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:19,701 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:19,702 INFO L423 AbstractCegarLoop]: === Iteration 4 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:19,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:19,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1495889727, now seen corresponding path program 1 times [2018-11-28 23:06:19,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:19,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:19,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:19,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:19,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:19,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:19,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:19,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:06:19,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:06:19,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:06:19,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:06:19,774 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand 3 states. [2018-11-28 23:06:19,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:19,850 INFO L93 Difference]: Finished difference Result 73 states and 95 transitions. [2018-11-28 23:06:19,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:06:19,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-28 23:06:19,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:19,853 INFO L225 Difference]: With dead ends: 73 [2018-11-28 23:06:19,854 INFO L226 Difference]: Without dead ends: 72 [2018-11-28 23:06:19,854 INFO L631 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 [2018-11-28 23:06:19,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-28 23:06:19,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2018-11-28 23:06:19,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-28 23:06:19,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2018-11-28 23:06:19,873 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 15 [2018-11-28 23:06:19,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:19,873 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2018-11-28 23:06:19,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:06:19,873 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2018-11-28 23:06:19,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 23:06:19,875 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:19,875 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:19,876 INFO L423 AbstractCegarLoop]: === Iteration 5 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:19,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:19,877 INFO L82 PathProgramCache]: Analyzing trace with hash -440899931, now seen corresponding path program 1 times [2018-11-28 23:06:19,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:19,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:19,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:19,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:19,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:19,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:19,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:19,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:06:19,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 23:06:19,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:06:19,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:06:19,951 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand 5 states. [2018-11-28 23:06:20,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:20,157 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2018-11-28 23:06:20,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:06:20,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-28 23:06:20,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:20,160 INFO L225 Difference]: With dead ends: 70 [2018-11-28 23:06:20,161 INFO L226 Difference]: Without dead ends: 69 [2018-11-28 23:06:20,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:06:20,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-28 23:06:20,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-28 23:06:20,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-28 23:06:20,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2018-11-28 23:06:20,172 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 20 [2018-11-28 23:06:20,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:20,173 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2018-11-28 23:06:20,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 23:06:20,173 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2018-11-28 23:06:20,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 23:06:20,174 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:20,174 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:20,175 INFO L423 AbstractCegarLoop]: === Iteration 6 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:20,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:20,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1311878191, now seen corresponding path program 1 times [2018-11-28 23:06:20,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:20,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:20,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:20,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:20,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:20,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 23:06:20,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:20,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:06:20,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:06:20,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:06:20,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:06:20,211 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand 3 states. [2018-11-28 23:06:20,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:20,234 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2018-11-28 23:06:20,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:06:20,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-28 23:06:20,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:20,236 INFO L225 Difference]: With dead ends: 67 [2018-11-28 23:06:20,236 INFO L226 Difference]: Without dead ends: 66 [2018-11-28 23:06:20,238 INFO L631 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 [2018-11-28 23:06:20,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-28 23:06:20,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-28 23:06:20,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-28 23:06:20,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2018-11-28 23:06:20,252 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 22 [2018-11-28 23:06:20,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:20,252 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2018-11-28 23:06:20,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:06:20,252 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2018-11-28 23:06:20,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 23:06:20,253 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:20,254 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:20,254 INFO L423 AbstractCegarLoop]: === Iteration 7 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:20,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:20,255 INFO L82 PathProgramCache]: Analyzing trace with hash -840361398, now seen corresponding path program 1 times [2018-11-28 23:06:20,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:20,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:20,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:20,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:20,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:20,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 23:06:20,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:20,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:06:20,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:06:20,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:06:20,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:06:20,290 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand 3 states. [2018-11-28 23:06:20,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:20,343 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2018-11-28 23:06:20,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:06:20,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-28 23:06:20,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:20,345 INFO L225 Difference]: With dead ends: 66 [2018-11-28 23:06:20,345 INFO L226 Difference]: Without dead ends: 65 [2018-11-28 23:06:20,345 INFO L631 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 [2018-11-28 23:06:20,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-28 23:06:20,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-28 23:06:20,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-28 23:06:20,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2018-11-28 23:06:20,355 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 23 [2018-11-28 23:06:20,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:20,355 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2018-11-28 23:06:20,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:06:20,355 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2018-11-28 23:06:20,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 23:06:20,357 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:20,357 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:20,357 INFO L423 AbstractCegarLoop]: === Iteration 8 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:20,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:20,358 INFO L82 PathProgramCache]: Analyzing trace with hash -2013518212, now seen corresponding path program 1 times [2018-11-28 23:06:20,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:20,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:20,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:20,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:20,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:20,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 23:06:20,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:20,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:06:20,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 23:06:20,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:06:20,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:06:20,428 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 4 states. [2018-11-28 23:06:20,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:20,460 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2018-11-28 23:06:20,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:06:20,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-28 23:06:20,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:20,464 INFO L225 Difference]: With dead ends: 90 [2018-11-28 23:06:20,464 INFO L226 Difference]: Without dead ends: 89 [2018-11-28 23:06:20,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:06:20,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-28 23:06:20,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 75. [2018-11-28 23:06:20,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-28 23:06:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 94 transitions. [2018-11-28 23:06:20,479 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 94 transitions. Word has length 23 [2018-11-28 23:06:20,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:20,480 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 94 transitions. [2018-11-28 23:06:20,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 23:06:20,480 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2018-11-28 23:06:20,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 23:06:20,481 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:20,481 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:20,483 INFO L423 AbstractCegarLoop]: === Iteration 9 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:20,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:20,484 INFO L82 PathProgramCache]: Analyzing trace with hash -281399491, now seen corresponding path program 1 times [2018-11-28 23:06:20,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:20,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:20,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:20,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:20,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:20,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 23:06:20,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:20,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:06:20,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 23:06:20,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:06:20,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:06:20,549 INFO L87 Difference]: Start difference. First operand 75 states and 94 transitions. Second operand 4 states. [2018-11-28 23:06:20,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:20,587 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2018-11-28 23:06:20,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:06:20,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-28 23:06:20,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:20,590 INFO L225 Difference]: With dead ends: 84 [2018-11-28 23:06:20,591 INFO L226 Difference]: Without dead ends: 80 [2018-11-28 23:06:20,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:06:20,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-28 23:06:20,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-11-28 23:06:20,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-28 23:06:20,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2018-11-28 23:06:20,614 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 24 [2018-11-28 23:06:20,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:20,614 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2018-11-28 23:06:20,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 23:06:20,614 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2018-11-28 23:06:20,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 23:06:20,615 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:20,617 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:20,618 INFO L423 AbstractCegarLoop]: === Iteration 10 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:20,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:20,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1215449003, now seen corresponding path program 1 times [2018-11-28 23:06:20,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:20,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:20,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:20,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:20,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:20,682 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 23:06:20,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:20,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:06:20,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 23:06:20,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:06:20,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:06:20,684 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand 5 states. [2018-11-28 23:06:21,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:21,088 INFO L93 Difference]: Finished difference Result 105 states and 129 transitions. [2018-11-28 23:06:21,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:06:21,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-28 23:06:21,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:21,090 INFO L225 Difference]: With dead ends: 105 [2018-11-28 23:06:21,091 INFO L226 Difference]: Without dead ends: 104 [2018-11-28 23:06:21,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:06:21,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-28 23:06:21,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-11-28 23:06:21,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-28 23:06:21,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 128 transitions. [2018-11-28 23:06:21,105 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 128 transitions. Word has length 27 [2018-11-28 23:06:21,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:21,105 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 128 transitions. [2018-11-28 23:06:21,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 23:06:21,105 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2018-11-28 23:06:21,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 23:06:21,107 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:21,107 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 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] [2018-11-28 23:06:21,108 INFO L423 AbstractCegarLoop]: === Iteration 11 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:21,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:21,108 INFO L82 PathProgramCache]: Analyzing trace with hash -2030923258, now seen corresponding path program 1 times [2018-11-28 23:06:21,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:21,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:21,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:21,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:21,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:21,198 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 23:06:21,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:21,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:06:21,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 23:06:21,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:06:21,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:06:21,199 INFO L87 Difference]: Start difference. First operand 101 states and 128 transitions. Second operand 5 states. [2018-11-28 23:06:21,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:21,370 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2018-11-28 23:06:21,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:06:21,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-28 23:06:21,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:21,372 INFO L225 Difference]: With dead ends: 104 [2018-11-28 23:06:21,372 INFO L226 Difference]: Without dead ends: 103 [2018-11-28 23:06:21,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:06:21,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-28 23:06:21,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2018-11-28 23:06:21,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-28 23:06:21,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 127 transitions. [2018-11-28 23:06:21,384 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 127 transitions. Word has length 33 [2018-11-28 23:06:21,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:21,385 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 127 transitions. [2018-11-28 23:06:21,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 23:06:21,385 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 127 transitions. [2018-11-28 23:06:21,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 23:06:21,387 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:21,387 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:21,388 INFO L423 AbstractCegarLoop]: === Iteration 12 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:21,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:21,388 INFO L82 PathProgramCache]: Analyzing trace with hash -30814145, now seen corresponding path program 1 times [2018-11-28 23:06:21,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:21,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:21,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:21,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:21,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:21,458 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-28 23:06:21,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:21,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:06:21,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 23:06:21,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:06:21,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:06:21,462 INFO L87 Difference]: Start difference. First operand 100 states and 127 transitions. Second operand 4 states. [2018-11-28 23:06:21,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:21,548 INFO L93 Difference]: Finished difference Result 110 states and 142 transitions. [2018-11-28 23:06:21,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:06:21,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-28 23:06:21,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:21,552 INFO L225 Difference]: With dead ends: 110 [2018-11-28 23:06:21,553 INFO L226 Difference]: Without dead ends: 109 [2018-11-28 23:06:21,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:06:21,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-28 23:06:21,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2018-11-28 23:06:21,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-28 23:06:21,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 133 transitions. [2018-11-28 23:06:21,566 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 133 transitions. Word has length 36 [2018-11-28 23:06:21,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:21,566 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 133 transitions. [2018-11-28 23:06:21,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 23:06:21,566 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2018-11-28 23:06:21,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-28 23:06:21,570 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:21,571 INFO L402 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, 1, 1, 1, 1] [2018-11-28 23:06:21,571 INFO L423 AbstractCegarLoop]: === Iteration 13 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:21,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:21,572 INFO L82 PathProgramCache]: Analyzing trace with hash -464316786, now seen corresponding path program 1 times [2018-11-28 23:06:21,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:21,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:21,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:21,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:21,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:21,668 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-28 23:06:21,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:21,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:06:21,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:06:21,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:06:21,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:06:21,670 INFO L87 Difference]: Start difference. First operand 106 states and 133 transitions. Second operand 3 states. [2018-11-28 23:06:21,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:21,741 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2018-11-28 23:06:21,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:06:21,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-11-28 23:06:21,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:21,744 INFO L225 Difference]: With dead ends: 106 [2018-11-28 23:06:21,744 INFO L226 Difference]: Without dead ends: 105 [2018-11-28 23:06:21,745 INFO L631 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 [2018-11-28 23:06:21,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-28 23:06:21,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-11-28 23:06:21,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-28 23:06:21,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 130 transitions. [2018-11-28 23:06:21,767 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 130 transitions. Word has length 42 [2018-11-28 23:06:21,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:21,769 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 130 transitions. [2018-11-28 23:06:21,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:06:21,769 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 130 transitions. [2018-11-28 23:06:21,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 23:06:21,774 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:21,774 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:21,775 INFO L423 AbstractCegarLoop]: === Iteration 14 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:21,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:21,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1915961670, now seen corresponding path program 1 times [2018-11-28 23:06:21,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:21,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:21,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:21,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:21,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:21,980 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 23:06:21,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:21,981 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:06:21,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:22,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:22,097 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 23:06:22,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:22,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 23:06:22,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 23:06:22,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:06:22,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:06:22,121 INFO L87 Difference]: Start difference. First operand 105 states and 130 transitions. Second operand 6 states. [2018-11-28 23:06:22,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:22,290 INFO L93 Difference]: Finished difference Result 121 states and 152 transitions. [2018-11-28 23:06:22,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:06:22,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-28 23:06:22,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:22,293 INFO L225 Difference]: With dead ends: 121 [2018-11-28 23:06:22,293 INFO L226 Difference]: Without dead ends: 112 [2018-11-28 23:06:22,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:06:22,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-28 23:06:22,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2018-11-28 23:06:22,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-28 23:06:22,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 135 transitions. [2018-11-28 23:06:22,305 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 135 transitions. Word has length 40 [2018-11-28 23:06:22,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:22,306 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 135 transitions. [2018-11-28 23:06:22,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 23:06:22,306 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2018-11-28 23:06:22,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-28 23:06:22,311 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:22,312 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 4, 2, 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] [2018-11-28 23:06:22,312 INFO L423 AbstractCegarLoop]: === Iteration 15 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:22,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:22,315 INFO L82 PathProgramCache]: Analyzing trace with hash 541352037, now seen corresponding path program 1 times [2018-11-28 23:06:22,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:22,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:22,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:22,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:22,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:22,546 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-28 23:06:22,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:22,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:06:22,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 23:06:22,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:06:22,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:06:22,548 INFO L87 Difference]: Start difference. First operand 109 states and 135 transitions. Second operand 5 states. [2018-11-28 23:06:22,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:22,805 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions. [2018-11-28 23:06:22,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:06:22,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-11-28 23:06:22,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:22,807 INFO L225 Difference]: With dead ends: 109 [2018-11-28 23:06:22,807 INFO L226 Difference]: Without dead ends: 108 [2018-11-28 23:06:22,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:06:22,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-28 23:06:22,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2018-11-28 23:06:22,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-28 23:06:22,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2018-11-28 23:06:22,817 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 58 [2018-11-28 23:06:22,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:22,818 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2018-11-28 23:06:22,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 23:06:22,818 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2018-11-28 23:06:22,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 23:06:22,820 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:22,820 INFO L402 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, 1, 1, 1, 1] [2018-11-28 23:06:22,821 INFO L423 AbstractCegarLoop]: === Iteration 16 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:22,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:22,821 INFO L82 PathProgramCache]: Analyzing trace with hash 77369472, now seen corresponding path program 1 times [2018-11-28 23:06:22,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:22,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:22,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:22,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:22,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:23,183 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-28 23:06:23,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:23,184 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:06:23,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:23,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:23,267 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-28 23:06:23,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:23,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-28 23:06:23,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 23:06:23,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:06:23,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:06:23,297 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand 6 states. [2018-11-28 23:06:23,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:23,391 INFO L93 Difference]: Finished difference Result 106 states and 128 transitions. [2018-11-28 23:06:23,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:06:23,392 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-11-28 23:06:23,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:23,394 INFO L225 Difference]: With dead ends: 106 [2018-11-28 23:06:23,394 INFO L226 Difference]: Without dead ends: 102 [2018-11-28 23:06:23,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:06:23,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-28 23:06:23,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-11-28 23:06:23,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-28 23:06:23,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2018-11-28 23:06:23,404 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 64 [2018-11-28 23:06:23,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:23,405 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2018-11-28 23:06:23,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 23:06:23,405 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2018-11-28 23:06:23,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 23:06:23,406 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:23,407 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 5, 2, 2, 2, 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] [2018-11-28 23:06:23,407 INFO L423 AbstractCegarLoop]: === Iteration 17 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:23,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:23,407 INFO L82 PathProgramCache]: Analyzing trace with hash -2003157191, now seen corresponding path program 1 times [2018-11-28 23:06:23,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:23,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:23,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:23,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:23,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:23,517 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-28 23:06:23,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:23,518 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:06:23,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:23,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:23,600 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-28 23:06:23,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:23,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 23:06:23,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 23:06:23,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:06:23,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:06:23,633 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand 6 states. [2018-11-28 23:06:23,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:23,900 INFO L93 Difference]: Finished difference Result 208 states and 274 transitions. [2018-11-28 23:06:23,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:06:23,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-11-28 23:06:23,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:23,903 INFO L225 Difference]: With dead ends: 208 [2018-11-28 23:06:23,903 INFO L226 Difference]: Without dead ends: 119 [2018-11-28 23:06:23,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:06:23,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-28 23:06:23,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2018-11-28 23:06:23,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-28 23:06:23,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 137 transitions. [2018-11-28 23:06:23,928 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 137 transitions. Word has length 60 [2018-11-28 23:06:23,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:23,932 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 137 transitions. [2018-11-28 23:06:23,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 23:06:23,932 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 137 transitions. [2018-11-28 23:06:23,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-28 23:06:23,935 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:23,935 INFO L402 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, 1, 1, 1, 1] [2018-11-28 23:06:23,936 INFO L423 AbstractCegarLoop]: === Iteration 18 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:23,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:23,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1274240413, now seen corresponding path program 2 times [2018-11-28 23:06:23,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:23,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:23,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:23,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:23,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:24,182 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2018-11-28 23:06:24,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:24,182 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:06:24,194 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:06:24,251 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:06:24,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:06:24,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:24,617 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 48 proven. 78 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-11-28 23:06:24,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:24,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2018-11-28 23:06:24,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 23:06:24,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 23:06:24,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-11-28 23:06:24,640 INFO L87 Difference]: Start difference. First operand 110 states and 137 transitions. Second operand 16 states. [2018-11-28 23:06:25,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:25,415 INFO L93 Difference]: Finished difference Result 154 states and 201 transitions. [2018-11-28 23:06:25,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-28 23:06:25,416 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 128 [2018-11-28 23:06:25,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:25,418 INFO L225 Difference]: With dead ends: 154 [2018-11-28 23:06:25,418 INFO L226 Difference]: Without dead ends: 139 [2018-11-28 23:06:25,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=159, Invalid=897, Unknown=0, NotChecked=0, Total=1056 [2018-11-28 23:06:25,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-28 23:06:25,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 125. [2018-11-28 23:06:25,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-28 23:06:25,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 156 transitions. [2018-11-28 23:06:25,429 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 156 transitions. Word has length 128 [2018-11-28 23:06:25,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:25,430 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 156 transitions. [2018-11-28 23:06:25,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 23:06:25,430 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 156 transitions. [2018-11-28 23:06:25,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-28 23:06:25,432 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:25,433 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:25,433 INFO L423 AbstractCegarLoop]: === Iteration 19 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:25,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:25,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1614961482, now seen corresponding path program 1 times [2018-11-28 23:06:25,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:25,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:25,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:25,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:06:25,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:25,567 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 15 proven. 73 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-28 23:06:25,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:25,568 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:06:25,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:25,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:25,649 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2018-11-28 23:06:25,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 23:06:25,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2018-11-28 23:06:25,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 23:06:25,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:06:25,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:06:25,686 INFO L87 Difference]: Start difference. First operand 125 states and 156 transitions. Second operand 6 states. [2018-11-28 23:06:25,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:25,952 INFO L93 Difference]: Finished difference Result 238 states and 296 transitions. [2018-11-28 23:06:25,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:06:25,957 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-11-28 23:06:25,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:25,959 INFO L225 Difference]: With dead ends: 238 [2018-11-28 23:06:25,960 INFO L226 Difference]: Without dead ends: 129 [2018-11-28 23:06:25,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:06:25,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-28 23:06:25,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-11-28 23:06:25,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-28 23:06:25,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 158 transitions. [2018-11-28 23:06:25,978 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 158 transitions. Word has length 119 [2018-11-28 23:06:25,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:25,979 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 158 transitions. [2018-11-28 23:06:25,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 23:06:25,979 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 158 transitions. [2018-11-28 23:06:25,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-28 23:06:25,981 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:25,982 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 9, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:25,983 INFO L423 AbstractCegarLoop]: === Iteration 20 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:25,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:25,985 INFO L82 PathProgramCache]: Analyzing trace with hash -238659207, now seen corresponding path program 2 times [2018-11-28 23:06:25,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:25,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:25,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:25,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:25,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:26,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:26,089 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 19 proven. 86 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-11-28 23:06:26,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:26,090 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:06:26,100 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:06:26,153 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:06:26,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:06:26,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:26,202 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 207 proven. 15 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-11-28 23:06:26,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:26,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 23:06:26,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 23:06:26,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:06:26,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:06:26,234 INFO L87 Difference]: Start difference. First operand 129 states and 158 transitions. Second operand 6 states. [2018-11-28 23:06:26,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:26,461 INFO L93 Difference]: Finished difference Result 274 states and 360 transitions. [2018-11-28 23:06:26,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:06:26,462 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2018-11-28 23:06:26,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:26,464 INFO L225 Difference]: With dead ends: 274 [2018-11-28 23:06:26,464 INFO L226 Difference]: Without dead ends: 156 [2018-11-28 23:06:26,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:06:26,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-28 23:06:26,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 141. [2018-11-28 23:06:26,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-28 23:06:26,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 173 transitions. [2018-11-28 23:06:26,478 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 173 transitions. Word has length 108 [2018-11-28 23:06:26,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:26,479 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 173 transitions. [2018-11-28 23:06:26,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 23:06:26,479 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 173 transitions. [2018-11-28 23:06:26,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-28 23:06:26,481 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:26,481 INFO L402 BasicCegarLoop]: trace histogram [14, 12, 9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:26,482 INFO L423 AbstractCegarLoop]: === Iteration 21 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:26,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:26,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1377349259, now seen corresponding path program 3 times [2018-11-28 23:06:26,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:26,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:26,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:26,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:06:26,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:26,600 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 53 proven. 77 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2018-11-28 23:06:26,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:26,601 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:06:26,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:06:26,628 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-28 23:06:26,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:06:26,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:26,668 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 50 proven. 4 refuted. 0 times theorem prover too weak. 341 trivial. 0 not checked. [2018-11-28 23:06:26,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:26,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 9 [2018-11-28 23:06:26,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 23:06:26,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 23:06:26,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:06:26,689 INFO L87 Difference]: Start difference. First operand 141 states and 173 transitions. Second operand 9 states. [2018-11-28 23:06:26,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:26,941 INFO L93 Difference]: Finished difference Result 239 states and 297 transitions. [2018-11-28 23:06:26,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 23:06:26,942 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 113 [2018-11-28 23:06:26,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:26,942 INFO L225 Difference]: With dead ends: 239 [2018-11-28 23:06:26,943 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 23:06:26,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-11-28 23:06:26,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 23:06:26,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 23:06:26,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 23:06:26,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 23:06:26,945 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2018-11-28 23:06:26,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:26,946 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:06:26,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 23:06:26,946 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:06:26,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 23:06:26,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 23:06:27,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 23:06:27,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 23:06:27,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 23:06:27,947 WARN L180 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 17 [2018-11-28 23:06:28,200 WARN L180 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 21 [2018-11-28 23:06:28,374 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 23:06:28,374 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 23:06:28,375 INFO L448 ceAbstractionStarter]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2018-11-28 23:06:28,375 INFO L448 ceAbstractionStarter]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2018-11-28 23:06:28,375 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-11-28 23:06:28,375 INFO L451 ceAbstractionStarter]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2018-11-28 23:06:28,375 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2018-11-28 23:06:28,375 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2018-11-28 23:06:28,375 INFO L444 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: (or (< 2147483647 |rec1_#in~i|) (and (<= rec1_~i |rec1_#in~i|) (<= 1 rec1_~i))) [2018-11-28 23:06:28,375 INFO L448 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2018-11-28 23:06:28,375 INFO L448 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. [2018-11-28 23:06:28,376 INFO L448 ceAbstractionStarter]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-28 23:06:28,376 INFO L448 ceAbstractionStarter]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-28 23:06:28,376 INFO L448 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2018-11-28 23:06:28,376 INFO L448 ceAbstractionStarter]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-28 23:06:28,376 INFO L448 ceAbstractionStarter]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-28 23:06:28,376 INFO L448 ceAbstractionStarter]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-28 23:06:28,376 INFO L444 ceAbstractionStarter]: At program point L14-6(line 14) the Hoare annotation is: (and (or (<= rec1_~i |rec1_#in~i|) (< 2147483646 |rec1_#in~i|)) (or (and (<= 0 (+ |rec1_#t~ret0| 2147483647)) (<= rec1_~i 2147483647) (<= |rec1_#t~ret0| 1) (<= 1 rec1_~i)) (< 2147483647 |rec1_#in~i|))) [2018-11-28 23:06:28,376 INFO L448 ceAbstractionStarter]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-28 23:06:28,377 INFO L448 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2018-11-28 23:06:28,377 INFO L444 ceAbstractionStarter]: At program point L14-8(line 14) the Hoare annotation is: (or (< 2147483647 |rec1_#in~i|) (and (<= 0 (+ |rec1_#t~ret0| 2147483647)) (<= rec1_~i |rec1_#in~i|) (<= |rec1_#t~ret1| 0) (<= |rec1_#t~ret0| 1) (<= 1 rec1_~i))) [2018-11-28 23:06:28,377 INFO L448 ceAbstractionStarter]: For program point L14-9(line 14) no Hoare annotation was computed. [2018-11-28 23:06:28,377 INFO L448 ceAbstractionStarter]: For program point L14-10(line 14) no Hoare annotation was computed. [2018-11-28 23:06:28,377 INFO L448 ceAbstractionStarter]: For program point L14-11(line 14) no Hoare annotation was computed. [2018-11-28 23:06:28,377 INFO L448 ceAbstractionStarter]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-28 23:06:28,377 INFO L448 ceAbstractionStarter]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-28 23:06:28,377 INFO L448 ceAbstractionStarter]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2018-11-28 23:06:28,377 INFO L448 ceAbstractionStarter]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2018-11-28 23:06:28,378 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-11-28 23:06:28,378 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-11-28 23:06:28,378 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2018-11-28 23:06:28,378 INFO L444 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (or (and (<= rec2_~j |rec2_#in~j|) (<= 1 rec2_~j)) (< 2147483647 |rec2_#in~j|)) [2018-11-28 23:06:28,378 INFO L448 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-11-28 23:06:28,378 INFO L444 ceAbstractionStarter]: At program point L20-4(line 20) the Hoare annotation is: (let ((.cse0 (<= rec2_~j |rec2_#in~j|)) (.cse1 (<= 1 rec2_~j))) (or (and .cse0 .cse1 (<= |rec2_#t~ret3| 0)) (and (<= 2 |rec2_#in~j|) .cse0 (<= |rec2_#t~ret3| 1) .cse1) (< 2147483647 |rec2_#in~j|))) [2018-11-28 23:06:28,378 INFO L448 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2018-11-28 23:06:28,378 INFO L448 ceAbstractionStarter]: For program point L20-6(line 20) no Hoare annotation was computed. [2018-11-28 23:06:28,378 INFO L448 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2018-11-28 23:06:28,378 INFO L451 ceAbstractionStarter]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2018-11-28 23:06:28,379 INFO L448 ceAbstractionStarter]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-28 23:06:28,379 INFO L448 ceAbstractionStarter]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-28 23:06:28,379 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 23:06:28,379 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 23:06:28,379 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 23:06:28,379 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 23:06:28,379 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 23 26) the Hoare annotation is: true [2018-11-28 23:06:28,379 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 23 26) no Hoare annotation was computed. [2018-11-28 23:06:28,379 INFO L444 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (<= main_~x~0 2147483647) [2018-11-28 23:06:28,380 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 23 26) no Hoare annotation was computed. [2018-11-28 23:06:28,380 INFO L448 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2018-11-28 23:06:28,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:06:28 BoogieIcfgContainer [2018-11-28 23:06:28,383 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 23:06:28,383 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:06:28,384 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:06:28,384 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:06:28,384 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:06:18" (3/4) ... [2018-11-28 23:06:28,388 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 23:06:28,396 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 23:06:28,396 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2018-11-28 23:06:28,396 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2018-11-28 23:06:28,397 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 23:06:28,402 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-28 23:06:28,403 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 23:06:28,403 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 23:06:28,461 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 23:06:28,461 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:06:28,462 INFO L168 Benchmark]: Toolchain (without parser) took 10986.46 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 283.1 MB). Free memory was 951.3 MB in the beginning and 1.2 GB in the end (delta: -281.1 MB). Peak memory consumption was 2.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:06:28,463 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:06:28,465 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.64 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:06:28,465 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.99 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:06:28,466 INFO L168 Benchmark]: Boogie Preprocessor took 33.53 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:06:28,466 INFO L168 Benchmark]: RCFGBuilder took 565.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:06:28,468 INFO L168 Benchmark]: TraceAbstraction took 9933.96 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 142.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -117.6 MB). Peak memory consumption was 373.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:06:28,469 INFO L168 Benchmark]: Witness Printer took 78.00 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.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:06:28,474 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 343.64 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.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 24.99 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.53 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 565.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9933.96 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 142.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -117.6 MB). Peak memory consumption was 373.6 MB. Max. memory is 11.5 GB. * Witness Printer took 78.00 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.0 MB). Peak memory consumption was 3.0 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 5 procedures, 49 locations, 10 error locations. SAFE Result, 9.8s OverallTime, 21 OverallIterations, 14 TraceHistogramMax, 4.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 854 SDtfs, 342 SDslu, 2052 SDs, 0 SdLazy, 979 SolverSat, 116 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 762 GetRequests, 652 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 95 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 332 PreInvPairs, 384 NumberOfFragments, 113 HoareAnnotationTreeSize, 332 FomulaSimplifications, 1939 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 12 FomulaSimplificationsInter, 256 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1620 NumberOfCodeBlocks, 1535 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1592 ConstructedInterpolants, 0 QuantifiedInterpolants, 185948 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1130 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 28 InterpolantComputations, 15 PerfectInterpolantSequences, 3077/3471 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...