./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted/NestedRecursion_1d_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_1d_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 0837a1e1d82be1b28ccf3514392f1b01c88a9160 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:22,543 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:06:22,545 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:06:22,562 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:06:22,563 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:06:22,565 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:06:22,567 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:06:22,570 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:06:22,572 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:06:22,575 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:06:22,577 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:06:22,578 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:06:22,579 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:06:22,582 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:06:22,589 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:06:22,591 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:06:22,594 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:06:22,597 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:06:22,601 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:06:22,605 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:06:22,606 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:06:22,607 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:06:22,609 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:06:22,609 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:06:22,610 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:06:22,610 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:06:22,611 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:06:22,612 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:06:22,612 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:06:22,613 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:06:22,617 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:06:22,618 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:06:22,619 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:06:22,619 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:06:22,620 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:06:22,621 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:06:22,622 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:22,646 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:06:22,646 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:06:22,647 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 23:06:22,647 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 23:06:22,648 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:06:22,648 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:06:22,648 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:06:22,648 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:06:22,648 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:06:22,649 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:06:22,650 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:06:22,650 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 23:06:22,650 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 23:06:22,650 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 23:06:22,650 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-28 23:06:22,651 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:06:22,651 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:06:22,652 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 23:06:22,652 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:06:22,652 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:06:22,652 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 23:06:22,652 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 23:06:22,652 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 23:06:22,653 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:06:22,653 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 23:06:22,653 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 23:06:22,653 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:06:22,653 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 23:06:22,653 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 23:06:22,655 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 -> 0837a1e1d82be1b28ccf3514392f1b01c88a9160 [2018-11-28 23:06:22,696 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:06:22,711 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:06:22,715 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:06:22,716 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:06:22,717 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:06:22,717 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-28 23:06:22,777 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/695556004/8609fd3117d54fd8b0af5eb40e7b2269/FLAG20588bd7d [2018-11-28 23:06:23,214 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:06:23,215 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-28 23:06:23,222 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/695556004/8609fd3117d54fd8b0af5eb40e7b2269/FLAG20588bd7d [2018-11-28 23:06:23,582 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/695556004/8609fd3117d54fd8b0af5eb40e7b2269 [2018-11-28 23:06:23,587 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:06:23,589 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:06:23,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:06:23,591 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:06:23,596 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:06:23,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:06:23" (1/1) ... [2018-11-28 23:06:23,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b8558fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:23, skipping insertion in model container [2018-11-28 23:06:23,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:06:23" (1/1) ... [2018-11-28 23:06:23,611 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:06:23,629 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:06:23,847 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:06:23,853 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:06:23,879 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:06:23,906 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:06:23,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:23 WrapperNode [2018-11-28 23:06:23,906 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:06:23,908 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:06:23,908 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:06:23,908 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:06:23,918 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:23" (1/1) ... [2018-11-28 23:06:23,924 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:23" (1/1) ... [2018-11-28 23:06:23,932 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:06:23,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:06:23,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:06:23,932 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:06:23,944 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:23" (1/1) ... [2018-11-28 23:06:23,944 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:23" (1/1) ... [2018-11-28 23:06:23,945 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:23" (1/1) ... [2018-11-28 23:06:23,946 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:23" (1/1) ... [2018-11-28 23:06:23,957 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:23" (1/1) ... [2018-11-28 23:06:23,960 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:23" (1/1) ... [2018-11-28 23:06:23,961 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:23" (1/1) ... [2018-11-28 23:06:23,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:06:23,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:06:23,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:06:23,969 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:06:23,970 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:23" (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:24,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 23:06:24,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 23:06:24,097 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2018-11-28 23:06:24,097 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2018-11-28 23:06:24,097 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2018-11-28 23:06:24,097 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2018-11-28 23:06:24,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:06:24,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:06:24,098 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 23:06:24,098 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 23:06:24,507 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:06:24,508 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-28 23:06:24,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:06:24 BoogieIcfgContainer [2018-11-28 23:06:24,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:06:24,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 23:06:24,510 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 23:06:24,514 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 23:06:24,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:06:23" (1/3) ... [2018-11-28 23:06:24,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17cc563f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:06:24, skipping insertion in model container [2018-11-28 23:06:24,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:06:23" (2/3) ... [2018-11-28 23:06:24,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17cc563f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:06:24, skipping insertion in model container [2018-11-28 23:06:24,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:06:24" (3/3) ... [2018-11-28 23:06:24,519 INFO L112 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-28 23:06:24,530 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 23:06:24,540 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-11-28 23:06:24,560 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2018-11-28 23:06:24,595 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:06:24,596 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 23:06:24,597 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 23:06:24,597 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 23:06:24,597 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:06:24,597 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:06:24,597 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 23:06:24,597 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:06:24,597 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 23:06:24,621 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-11-28 23:06:24,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-28 23:06:24,628 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:24,629 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:24,632 INFO L423 AbstractCegarLoop]: === Iteration 1 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:24,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:24,639 INFO L82 PathProgramCache]: Analyzing trace with hash -359085562, now seen corresponding path program 1 times [2018-11-28 23:06:24,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:24,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:24,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:24,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:24,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:24,893 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:24,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:24,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 23:06:24,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 23:06:24,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:06:24,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:06:24,916 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 7 states. [2018-11-28 23:06:25,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:25,519 INFO L93 Difference]: Finished difference Result 91 states and 107 transitions. [2018-11-28 23:06:25,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:06:25,521 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-11-28 23:06:25,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:25,533 INFO L225 Difference]: With dead ends: 91 [2018-11-28 23:06:25,533 INFO L226 Difference]: Without dead ends: 83 [2018-11-28 23:06:25,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:06:25,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-28 23:06:25,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 70. [2018-11-28 23:06:25,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-28 23:06:25,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2018-11-28 23:06:25,597 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 12 [2018-11-28 23:06:25,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:25,597 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2018-11-28 23:06:25,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 23:06:25,598 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2018-11-28 23:06:25,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 23:06:25,599 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:25,599 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:25,600 INFO L423 AbstractCegarLoop]: === Iteration 2 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:25,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:25,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1753249505, now seen corresponding path program 1 times [2018-11-28 23:06:25,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:25,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:25,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:25,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:25,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:25,626 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:25,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:25,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:06:25,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:06:25,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:06:25,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:06:25,631 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand 3 states. [2018-11-28 23:06:25,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:25,670 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2018-11-28 23:06:25,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:06:25,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-28 23:06:25,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:25,672 INFO L225 Difference]: With dead ends: 74 [2018-11-28 23:06:25,672 INFO L226 Difference]: Without dead ends: 73 [2018-11-28 23:06:25,673 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:25,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-28 23:06:25,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-11-28 23:06:25,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-28 23:06:25,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 86 transitions. [2018-11-28 23:06:25,691 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 86 transitions. Word has length 13 [2018-11-28 23:06:25,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:25,692 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 86 transitions. [2018-11-28 23:06:25,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:06:25,692 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 86 transitions. [2018-11-28 23:06:25,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 23:06:25,693 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:25,693 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:25,693 INFO L423 AbstractCegarLoop]: === Iteration 3 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:25,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:25,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1245225281, now seen corresponding path program 1 times [2018-11-28 23:06:25,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:25,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:25,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:25,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:25,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:25,724 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:25,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:25,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:06:25,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:06:25,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:06:25,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:06:25,726 INFO L87 Difference]: Start difference. First operand 69 states and 86 transitions. Second operand 3 states. [2018-11-28 23:06:25,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:25,761 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2018-11-28 23:06:25,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:06:25,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-28 23:06:25,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:25,767 INFO L225 Difference]: With dead ends: 69 [2018-11-28 23:06:25,767 INFO L226 Difference]: Without dead ends: 68 [2018-11-28 23:06:25,767 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:25,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-28 23:06:25,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-28 23:06:25,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-28 23:06:25,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2018-11-28 23:06:25,785 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 15 [2018-11-28 23:06:25,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:25,789 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2018-11-28 23:06:25,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:06:25,789 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2018-11-28 23:06:25,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 23:06:25,791 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:25,792 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:25,793 INFO L423 AbstractCegarLoop]: === Iteration 4 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:25,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:25,793 INFO L82 PathProgramCache]: Analyzing trace with hash -52721888, now seen corresponding path program 1 times [2018-11-28 23:06:25,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:25,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:25,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:25,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:25,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:25,864 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:25,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:25,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:06:25,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 23:06:25,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:06:25,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:06:25,866 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand 4 states. [2018-11-28 23:06:25,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:25,927 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2018-11-28 23:06:25,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:06:25,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-28 23:06:25,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:25,930 INFO L225 Difference]: With dead ends: 89 [2018-11-28 23:06:25,930 INFO L226 Difference]: Without dead ends: 88 [2018-11-28 23:06:25,931 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:25,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-28 23:06:25,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2018-11-28 23:06:25,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-28 23:06:25,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2018-11-28 23:06:25,946 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 16 [2018-11-28 23:06:25,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:25,946 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2018-11-28 23:06:25,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 23:06:25,946 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2018-11-28 23:06:25,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 23:06:25,947 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:25,948 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:25,948 INFO L423 AbstractCegarLoop]: === Iteration 5 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:25,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:25,949 INFO L82 PathProgramCache]: Analyzing trace with hash -571942417, now seen corresponding path program 1 times [2018-11-28 23:06:25,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:25,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:25,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:25,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:25,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:25,999 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:25,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:25,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:06:26,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:06:26,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:06:26,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:06:26,002 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand 3 states. [2018-11-28 23:06:26,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:26,062 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2018-11-28 23:06:26,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:06:26,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-28 23:06:26,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:26,068 INFO L225 Difference]: With dead ends: 78 [2018-11-28 23:06:26,068 INFO L226 Difference]: Without dead ends: 77 [2018-11-28 23:06:26,069 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:26,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-28 23:06:26,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-11-28 23:06:26,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-28 23:06:26,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2018-11-28 23:06:26,095 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 20 [2018-11-28 23:06:26,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:26,095 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2018-11-28 23:06:26,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:06:26,095 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2018-11-28 23:06:26,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 23:06:26,100 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:26,100 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] [2018-11-28 23:06:26,101 INFO L423 AbstractCegarLoop]: === Iteration 6 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:26,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:26,101 INFO L82 PathProgramCache]: Analyzing trace with hash -550345698, now seen corresponding path program 1 times [2018-11-28 23:06:26,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:26,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:26,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:26,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:26,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:26,178 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:26,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:26,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:06:26,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 23:06:26,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:06:26,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:06:26,179 INFO L87 Difference]: Start difference. First operand 77 states and 98 transitions. Second operand 4 states. [2018-11-28 23:06:26,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:26,241 INFO L93 Difference]: Finished difference Result 98 states and 130 transitions. [2018-11-28 23:06:26,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:06:26,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-28 23:06:26,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:26,245 INFO L225 Difference]: With dead ends: 98 [2018-11-28 23:06:26,245 INFO L226 Difference]: Without dead ends: 97 [2018-11-28 23:06:26,246 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:26,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-28 23:06:26,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 83. [2018-11-28 23:06:26,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-28 23:06:26,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 104 transitions. [2018-11-28 23:06:26,269 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 104 transitions. Word has length 21 [2018-11-28 23:06:26,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:26,270 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 104 transitions. [2018-11-28 23:06:26,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 23:06:26,270 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 104 transitions. [2018-11-28 23:06:26,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 23:06:26,272 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:26,272 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:26,273 INFO L423 AbstractCegarLoop]: === Iteration 7 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:26,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:26,273 INFO L82 PathProgramCache]: Analyzing trace with hash 838473927, now seen corresponding path program 1 times [2018-11-28 23:06:26,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:26,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:26,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:26,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:26,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:26,359 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:06:26,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:26,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 23:06:26,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 23:06:26,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:06:26,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:06:26,361 INFO L87 Difference]: Start difference. First operand 83 states and 104 transitions. Second operand 5 states. [2018-11-28 23:06:26,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:26,465 INFO L93 Difference]: Finished difference Result 129 states and 163 transitions. [2018-11-28 23:06:26,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:06:26,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-28 23:06:26,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:26,470 INFO L225 Difference]: With dead ends: 129 [2018-11-28 23:06:26,470 INFO L226 Difference]: Without dead ends: 79 [2018-11-28 23:06:26,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:26,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-28 23:06:26,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-11-28 23:06:26,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-28 23:06:26,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 96 transitions. [2018-11-28 23:06:26,484 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 96 transitions. Word has length 23 [2018-11-28 23:06:26,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:26,484 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 96 transitions. [2018-11-28 23:06:26,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 23:06:26,484 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2018-11-28 23:06:26,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 23:06:26,485 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:26,486 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] [2018-11-28 23:06:26,486 INFO L423 AbstractCegarLoop]: === Iteration 8 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:26,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:26,487 INFO L82 PathProgramCache]: Analyzing trace with hash 2032985165, now seen corresponding path program 1 times [2018-11-28 23:06:26,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:26,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:26,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:26,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:26,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:26,539 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:26,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:26,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:06:26,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 23:06:26,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:06:26,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:06:26,542 INFO L87 Difference]: Start difference. First operand 77 states and 96 transitions. Second operand 5 states. [2018-11-28 23:06:26,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:26,999 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2018-11-28 23:06:27,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:06:27,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-28 23:06:27,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:27,003 INFO L225 Difference]: With dead ends: 102 [2018-11-28 23:06:27,003 INFO L226 Difference]: Without dead ends: 101 [2018-11-28 23:06:27,003 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:27,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-28 23:06:27,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2018-11-28 23:06:27,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-28 23:06:27,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 125 transitions. [2018-11-28 23:06:27,030 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 125 transitions. Word has length 25 [2018-11-28 23:06:27,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:27,030 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 125 transitions. [2018-11-28 23:06:27,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 23:06:27,030 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 125 transitions. [2018-11-28 23:06:27,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 23:06:27,032 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:27,032 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:27,033 INFO L423 AbstractCegarLoop]: === Iteration 9 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:27,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:27,033 INFO L82 PathProgramCache]: Analyzing trace with hash 878188252, now seen corresponding path program 1 times [2018-11-28 23:06:27,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:27,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:27,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:27,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:27,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:27,130 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-28 23:06:27,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:27,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:06:27,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 23:06:27,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:06:27,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:06:27,132 INFO L87 Difference]: Start difference. First operand 98 states and 125 transitions. Second operand 5 states. [2018-11-28 23:06:27,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:27,267 INFO L93 Difference]: Finished difference Result 123 states and 155 transitions. [2018-11-28 23:06:27,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:06:27,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-11-28 23:06:27,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:27,271 INFO L225 Difference]: With dead ends: 123 [2018-11-28 23:06:27,272 INFO L226 Difference]: Without dead ends: 122 [2018-11-28 23:06:27,272 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:27,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-28 23:06:27,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2018-11-28 23:06:27,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-28 23:06:27,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 154 transitions. [2018-11-28 23:06:27,289 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 154 transitions. Word has length 36 [2018-11-28 23:06:27,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:27,289 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 154 transitions. [2018-11-28 23:06:27,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 23:06:27,290 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 154 transitions. [2018-11-28 23:06:27,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 23:06:27,291 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:27,291 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] [2018-11-28 23:06:27,292 INFO L423 AbstractCegarLoop]: === Iteration 10 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:27,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:27,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1444432349, now seen corresponding path program 1 times [2018-11-28 23:06:27,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:27,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:27,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:27,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:27,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:27,334 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:27,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:27,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:06:27,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 23:06:27,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:06:27,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:06:27,337 INFO L87 Difference]: Start difference. First operand 119 states and 154 transitions. Second operand 4 states. [2018-11-28 23:06:27,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:27,427 INFO L93 Difference]: Finished difference Result 132 states and 174 transitions. [2018-11-28 23:06:27,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:06:27,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-28 23:06:27,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:27,435 INFO L225 Difference]: With dead ends: 132 [2018-11-28 23:06:27,435 INFO L226 Difference]: Without dead ends: 131 [2018-11-28 23:06:27,436 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:27,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-28 23:06:27,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2018-11-28 23:06:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-28 23:06:27,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 162 transitions. [2018-11-28 23:06:27,462 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 162 transitions. Word has length 34 [2018-11-28 23:06:27,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:27,463 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 162 transitions. [2018-11-28 23:06:27,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 23:06:27,463 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 162 transitions. [2018-11-28 23:06:27,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 23:06:27,466 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:27,469 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] [2018-11-28 23:06:27,469 INFO L423 AbstractCegarLoop]: === Iteration 11 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:27,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:27,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1827729912, now seen corresponding path program 1 times [2018-11-28 23:06:27,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:27,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:27,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:27,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:27,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:27,553 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 23:06:27,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:27,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:06:27,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:06:27,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:06:27,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:06:27,554 INFO L87 Difference]: Start difference. First operand 127 states and 162 transitions. Second operand 3 states. [2018-11-28 23:06:27,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:27,589 INFO L93 Difference]: Finished difference Result 127 states and 162 transitions. [2018-11-28 23:06:27,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:06:27,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-28 23:06:27,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:27,593 INFO L225 Difference]: With dead ends: 127 [2018-11-28 23:06:27,593 INFO L226 Difference]: Without dead ends: 126 [2018-11-28 23:06:27,594 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:27,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-28 23:06:27,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-11-28 23:06:27,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-28 23:06:27,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 158 transitions. [2018-11-28 23:06:27,609 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 158 transitions. Word has length 35 [2018-11-28 23:06:27,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:27,610 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 158 transitions. [2018-11-28 23:06:27,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:06:27,610 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 158 transitions. [2018-11-28 23:06:27,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 23:06:27,612 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:27,612 INFO L402 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 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:27,618 INFO L423 AbstractCegarLoop]: === Iteration 12 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:27,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:27,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1886555928, now seen corresponding path program 1 times [2018-11-28 23:06:27,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:27,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:27,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:27,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:27,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:27,726 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-28 23:06:27,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:27,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:06:27,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 23:06:27,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:06:27,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:06:27,729 INFO L87 Difference]: Start difference. First operand 126 states and 158 transitions. Second operand 5 states. [2018-11-28 23:06:27,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:27,844 INFO L93 Difference]: Finished difference Result 126 states and 158 transitions. [2018-11-28 23:06:27,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:06:27,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-11-28 23:06:27,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:27,846 INFO L225 Difference]: With dead ends: 126 [2018-11-28 23:06:27,846 INFO L226 Difference]: Without dead ends: 125 [2018-11-28 23:06:27,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:27,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-28 23:06:27,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 111. [2018-11-28 23:06:27,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-28 23:06:27,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 136 transitions. [2018-11-28 23:06:27,857 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 136 transitions. Word has length 50 [2018-11-28 23:06:27,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:27,858 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 136 transitions. [2018-11-28 23:06:27,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 23:06:27,858 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 136 transitions. [2018-11-28 23:06:27,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 23:06:27,859 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:27,859 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1] [2018-11-28 23:06:27,860 INFO L423 AbstractCegarLoop]: === Iteration 13 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:27,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:27,860 INFO L82 PathProgramCache]: Analyzing trace with hash 324073318, now seen corresponding path program 1 times [2018-11-28 23:06:27,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:27,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:27,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:27,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:27,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:28,050 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 23:06:28,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:28,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:06:28,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 23:06:28,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:06:28,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:06:28,052 INFO L87 Difference]: Start difference. First operand 111 states and 136 transitions. Second operand 5 states. [2018-11-28 23:06:28,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:28,200 INFO L93 Difference]: Finished difference Result 111 states and 136 transitions. [2018-11-28 23:06:28,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:06:28,201 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-11-28 23:06:28,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:28,203 INFO L225 Difference]: With dead ends: 111 [2018-11-28 23:06:28,203 INFO L226 Difference]: Without dead ends: 110 [2018-11-28 23:06:28,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:06:28,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-28 23:06:28,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-11-28 23:06:28,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-28 23:06:28,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 134 transitions. [2018-11-28 23:06:28,214 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 134 transitions. Word has length 40 [2018-11-28 23:06:28,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:28,215 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 134 transitions. [2018-11-28 23:06:28,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 23:06:28,215 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2018-11-28 23:06:28,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 23:06:28,218 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:28,218 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 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, 1, 1, 1, 1] [2018-11-28 23:06:28,218 INFO L423 AbstractCegarLoop]: === Iteration 14 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:28,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:28,220 INFO L82 PathProgramCache]: Analyzing trace with hash -921113151, now seen corresponding path program 1 times [2018-11-28 23:06:28,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:28,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:28,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:28,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:28,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:28,640 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-28 23:06:28,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:28,640 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:28,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:28,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:28,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:28,746 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-28 23:06:28,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:28,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-28 23:06:28,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 23:06:28,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 23:06:28,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:06:28,768 INFO L87 Difference]: Start difference. First operand 110 states and 134 transitions. Second operand 8 states. [2018-11-28 23:06:29,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:29,080 INFO L93 Difference]: Finished difference Result 223 states and 286 transitions. [2018-11-28 23:06:29,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:06:29,082 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-11-28 23:06:29,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:29,084 INFO L225 Difference]: With dead ends: 223 [2018-11-28 23:06:29,084 INFO L226 Difference]: Without dead ends: 146 [2018-11-28 23:06:29,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:06:29,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-28 23:06:29,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 128. [2018-11-28 23:06:29,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-28 23:06:29,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 155 transitions. [2018-11-28 23:06:29,116 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 155 transitions. Word has length 47 [2018-11-28 23:06:29,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:29,116 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 155 transitions. [2018-11-28 23:06:29,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 23:06:29,116 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 155 transitions. [2018-11-28 23:06:29,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 23:06:29,121 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:29,121 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:29,122 INFO L423 AbstractCegarLoop]: === Iteration 15 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:29,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:29,122 INFO L82 PathProgramCache]: Analyzing trace with hash -922396984, now seen corresponding path program 1 times [2018-11-28 23:06:29,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:29,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:29,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:29,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:29,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:29,204 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-28 23:06:29,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:29,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:06:29,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:06:29,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:06:29,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:06:29,207 INFO L87 Difference]: Start difference. First operand 128 states and 155 transitions. Second operand 3 states. [2018-11-28 23:06:29,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:29,256 INFO L93 Difference]: Finished difference Result 128 states and 155 transitions. [2018-11-28 23:06:29,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:06:29,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-11-28 23:06:29,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:29,259 INFO L225 Difference]: With dead ends: 128 [2018-11-28 23:06:29,260 INFO L226 Difference]: Without dead ends: 127 [2018-11-28 23:06:29,260 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:29,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-28 23:06:29,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-11-28 23:06:29,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-28 23:06:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 153 transitions. [2018-11-28 23:06:29,277 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 153 transitions. Word has length 47 [2018-11-28 23:06:29,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:29,277 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 153 transitions. [2018-11-28 23:06:29,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:06:29,277 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 153 transitions. [2018-11-28 23:06:29,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 23:06:29,278 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:29,279 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:29,282 INFO L423 AbstractCegarLoop]: === Iteration 16 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:29,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:29,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1470464639, now seen corresponding path program 1 times [2018-11-28 23:06:29,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:29,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:29,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:29,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:29,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:29,441 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-28 23:06:29,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:06:29,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:06:29,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 23:06:29,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:06:29,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:06:29,443 INFO L87 Difference]: Start difference. First operand 127 states and 153 transitions. Second operand 4 states. [2018-11-28 23:06:29,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:29,474 INFO L93 Difference]: Finished difference Result 136 states and 163 transitions. [2018-11-28 23:06:29,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:06:29,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-11-28 23:06:29,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:29,477 INFO L225 Difference]: With dead ends: 136 [2018-11-28 23:06:29,477 INFO L226 Difference]: Without dead ends: 128 [2018-11-28 23:06:29,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:06:29,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-28 23:06:29,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-11-28 23:06:29,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-28 23:06:29,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 150 transitions. [2018-11-28 23:06:29,489 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 150 transitions. Word has length 48 [2018-11-28 23:06:29,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:29,489 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 150 transitions. [2018-11-28 23:06:29,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 23:06:29,489 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 150 transitions. [2018-11-28 23:06:29,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-28 23:06:29,490 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:29,491 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] [2018-11-28 23:06:29,491 INFO L423 AbstractCegarLoop]: === Iteration 17 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:29,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:29,491 INFO L82 PathProgramCache]: Analyzing trace with hash -524468521, now seen corresponding path program 1 times [2018-11-28 23:06:29,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:29,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:29,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:29,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:29,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:29,708 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:29,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:29,709 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:29,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:29,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:29,789 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:29,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:29,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 23:06:29,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 23:06:29,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:06:29,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:06:29,819 INFO L87 Difference]: Start difference. First operand 126 states and 150 transitions. Second operand 6 states. [2018-11-28 23:06:30,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:30,136 INFO L93 Difference]: Finished difference Result 262 states and 341 transitions. [2018-11-28 23:06:30,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:06:30,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-11-28 23:06:30,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:30,140 INFO L225 Difference]: With dead ends: 262 [2018-11-28 23:06:30,140 INFO L226 Difference]: Without dead ends: 150 [2018-11-28 23:06:30,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:06:30,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-28 23:06:30,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 136. [2018-11-28 23:06:30,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-28 23:06:30,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 168 transitions. [2018-11-28 23:06:30,165 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 168 transitions. Word has length 58 [2018-11-28 23:06:30,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:30,165 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 168 transitions. [2018-11-28 23:06:30,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 23:06:30,165 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 168 transitions. [2018-11-28 23:06:30,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-28 23:06:30,170 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:30,170 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] [2018-11-28 23:06:30,172 INFO L423 AbstractCegarLoop]: === Iteration 18 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:30,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:30,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1040597731, now seen corresponding path program 2 times [2018-11-28 23:06:30,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:30,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:30,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:30,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:06:30,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:30,416 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 23 proven. 86 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-11-28 23:06:30,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:30,417 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:30,450 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:06:30,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:06:30,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:06:30,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:30,542 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 231 proven. 15 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-11-28 23:06:30,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:30,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 23:06:30,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 23:06:30,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:06:30,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:06:30,568 INFO L87 Difference]: Start difference. First operand 136 states and 168 transitions. Second operand 6 states. [2018-11-28 23:06:30,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:30,781 INFO L93 Difference]: Finished difference Result 296 states and 391 transitions. [2018-11-28 23:06:30,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:06:30,784 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2018-11-28 23:06:30,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:30,786 INFO L225 Difference]: With dead ends: 296 [2018-11-28 23:06:30,786 INFO L226 Difference]: Without dead ends: 174 [2018-11-28 23:06:30,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 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:30,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-28 23:06:30,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 154. [2018-11-28 23:06:30,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-28 23:06:30,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 190 transitions. [2018-11-28 23:06:30,814 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 190 transitions. Word has length 111 [2018-11-28 23:06:30,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:30,815 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 190 transitions. [2018-11-28 23:06:30,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 23:06:30,815 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 190 transitions. [2018-11-28 23:06:30,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-28 23:06:30,820 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:06:30,820 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 11, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:06:30,820 INFO L423 AbstractCegarLoop]: === Iteration 19 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:06:30,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:06:30,823 INFO L82 PathProgramCache]: Analyzing trace with hash 679046033, now seen corresponding path program 3 times [2018-11-28 23:06:30,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:06:30,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:06:30,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:30,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:06:30,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:06:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:06:30,974 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 51 proven. 119 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2018-11-28 23:06:30,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:06:30,974 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:30,986 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:06:31,027 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-28 23:06:31,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:06:31,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:06:31,246 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 67 proven. 4 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-11-28 23:06:31,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:06:31,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 9 [2018-11-28 23:06:31,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 23:06:31,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 23:06:31,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:06:31,281 INFO L87 Difference]: Start difference. First operand 154 states and 190 transitions. Second operand 9 states. [2018-11-28 23:06:31,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:06:31,566 INFO L93 Difference]: Finished difference Result 209 states and 263 transitions. [2018-11-28 23:06:31,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 23:06:31,568 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 130 [2018-11-28 23:06:31,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:06:31,569 INFO L225 Difference]: With dead ends: 209 [2018-11-28 23:06:31,570 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 23:06:31,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-11-28 23:06:31,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 23:06:31,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 23:06:31,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 23:06:31,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 23:06:31,573 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 130 [2018-11-28 23:06:31,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:06:31,573 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:06:31,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 23:06:31,573 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:06:31,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 23:06:31,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 23:06:31,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 23:06:31,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 23:06:31,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 23:06:31,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 23:06:32,446 WARN L180 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2018-11-28 23:06:32,799 WARN L180 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 15 [2018-11-28 23:06:32,997 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 23:06:32,997 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 23:06:32,997 INFO L448 ceAbstractionStarter]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2018-11-28 23:06:32,997 INFO L448 ceAbstractionStarter]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2018-11-28 23:06:32,997 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-11-28 23:06:32,997 INFO L448 ceAbstractionStarter]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-28 23:06:32,998 INFO L448 ceAbstractionStarter]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-28 23:06:32,998 INFO L451 ceAbstractionStarter]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2018-11-28 23:06:32,998 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2018-11-28 23:06:32,998 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2018-11-28 23:06:32,998 INFO L444 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: (and (or (= rec1_~i |rec1_#in~i|) (< 2147483647 |rec1_#in~i|)) (or (<= 1 rec1_~i) (< 2147483646 |rec1_#in~i|))) [2018-11-28 23:06:32,998 INFO L448 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2018-11-28 23:06:32,998 INFO L448 ceAbstractionStarter]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-28 23:06:32,998 INFO L448 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. [2018-11-28 23:06:32,998 INFO L448 ceAbstractionStarter]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-28 23:06:32,999 INFO L448 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2018-11-28 23:06:32,999 INFO L444 ceAbstractionStarter]: At program point L14-6(line 14) the Hoare annotation is: (or (and (<= 0 (+ |rec1_#t~ret0| 2147483647)) (= rec1_~i |rec1_#in~i|) (<= |rec1_#t~ret0| 1) (<= 1 rec1_~i)) (< 2147483647 |rec1_#in~i|)) [2018-11-28 23:06:32,999 INFO L448 ceAbstractionStarter]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-28 23:06:32,999 INFO L448 ceAbstractionStarter]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-28 23:06:33,000 INFO L448 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2018-11-28 23:06:33,000 INFO L444 ceAbstractionStarter]: At program point L14-8(line 14) the Hoare annotation is: (or (and (<= 0 (+ |rec1_#t~ret0| 2147483647)) (<= |rec1_#t~ret1| 0) (= rec1_~i |rec1_#in~i|) (<= |rec1_#t~ret0| 1) (<= 1 rec1_~i)) (< 2147483647 |rec1_#in~i|)) [2018-11-28 23:06:33,000 INFO L448 ceAbstractionStarter]: For program point L14-9(line 14) no Hoare annotation was computed. [2018-11-28 23:06:33,000 INFO L448 ceAbstractionStarter]: For program point L14-10(line 14) no Hoare annotation was computed. [2018-11-28 23:06:33,000 INFO L448 ceAbstractionStarter]: For program point L14-11(line 14) no Hoare annotation was computed. [2018-11-28 23:06:33,000 INFO L448 ceAbstractionStarter]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2018-11-28 23:06:33,000 INFO L448 ceAbstractionStarter]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-28 23:06:33,000 INFO L448 ceAbstractionStarter]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2018-11-28 23:06:33,000 INFO L448 ceAbstractionStarter]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-28 23:06:33,001 INFO L444 ceAbstractionStarter]: At program point L20(line 20) the Hoare annotation is: (and (< 0 |rec2_#in~j|) (or (and (<= rec2_~j 2147483647) (<= 1 rec2_~j)) (< 2147483647 |rec2_#in~j|))) [2018-11-28 23:06:33,001 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-11-28 23:06:33,001 INFO L448 ceAbstractionStarter]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-28 23:06:33,001 INFO L448 ceAbstractionStarter]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-28 23:06:33,001 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2018-11-28 23:06:33,001 INFO L448 ceAbstractionStarter]: For program point L20-2(line 20) no Hoare annotation was computed. [2018-11-28 23:06:33,001 INFO L448 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-11-28 23:06:33,001 INFO L444 ceAbstractionStarter]: At program point L20-4(line 20) the Hoare annotation is: (and (or (and (<= rec2_~j 2147483647) (<= |rec2_#t~ret3| 1) (<= 0 (+ |rec2_#t~ret3| 2147483647)) (<= 1 rec2_~j)) (< 2147483647 |rec2_#in~j|)) (< 0 |rec2_#in~j|)) [2018-11-28 23:06:33,001 INFO L448 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2018-11-28 23:06:33,002 INFO L448 ceAbstractionStarter]: For program point L20-6(line 20) no Hoare annotation was computed. [2018-11-28 23:06:33,002 INFO L448 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2018-11-28 23:06:33,002 INFO L451 ceAbstractionStarter]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2018-11-28 23:06:33,002 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 23:06:33,002 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 23:06:33,003 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 23:06:33,003 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 23:06:33,003 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 23 26) the Hoare annotation is: true [2018-11-28 23:06:33,003 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 23 26) no Hoare annotation was computed. [2018-11-28 23:06:33,003 INFO L444 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (<= main_~x~0 2147483647) [2018-11-28 23:06:33,003 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 23 26) no Hoare annotation was computed. [2018-11-28 23:06:33,003 INFO L448 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2018-11-28 23:06:33,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:06:33 BoogieIcfgContainer [2018-11-28 23:06:33,015 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 23:06:33,015 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:06:33,015 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:06:33,015 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:06:33,016 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:24" (3/4) ... [2018-11-28 23:06:33,020 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 23:06:33,027 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 23:06:33,027 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2018-11-28 23:06:33,027 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2018-11-28 23:06:33,028 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 23:06:33,033 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-28 23:06:33,033 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 23:06:33,034 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 23:06:33,089 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 23:06:33,089 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:06:33,090 INFO L168 Benchmark]: Toolchain (without parser) took 9502.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.2 MB). Free memory was 952.7 MB in the beginning and 977.2 MB in the end (delta: -24.5 MB). Peak memory consumption was 174.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:06:33,091 INFO L168 Benchmark]: CDTParser took 0.15 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:33,092 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.87 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 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:33,092 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.01 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:06:33,093 INFO L168 Benchmark]: Boogie Preprocessor took 36.04 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:06:33,093 INFO L168 Benchmark]: RCFGBuilder took 540.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -167.2 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:06:33,094 INFO L168 Benchmark]: TraceAbstraction took 8504.43 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 984.8 MB in the end (delta: 124.3 MB). Peak memory consumption was 190.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:06:33,095 INFO L168 Benchmark]: Witness Printer took 74.30 ms. Allocated memory is still 1.2 GB. Free memory was 984.8 MB in the beginning and 977.2 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:06:33,099 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.15 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 316.87 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 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.01 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.04 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 540.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -167.2 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8504.43 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 984.8 MB in the end (delta: 124.3 MB). Peak memory consumption was 190.9 MB. Max. memory is 11.5 GB. * Witness Printer took 74.30 ms. Allocated memory is still 1.2 GB. Free memory was 984.8 MB in the beginning and 977.2 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 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, 8.4s OverallTime, 19 OverallIterations, 16 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 779 SDtfs, 293 SDslu, 1707 SDs, 0 SdLazy, 589 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 448 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=154occurred in iteration=18, 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.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 121 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 343 PreInvPairs, 383 NumberOfFragments, 111 HoareAnnotationTreeSize, 343 FomulaSimplifications, 1817 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 12 FomulaSimplificationsInter, 228 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1127 NumberOfCodeBlocks, 1023 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1104 ConstructedInterpolants, 0 QuantifiedInterpolants, 112354 SizeOfPredicates, 5 NumberOfNonLiveVariables, 510 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 23 InterpolantComputations, 15 PerfectInterpolantSequences, 2115/2369 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...