./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_85121947-934a-44c5-a610-5640354827e9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_85121947-934a-44c5-a610-5640354827e9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_85121947-934a-44c5-a610-5640354827e9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_85121947-934a-44c5-a610-5640354827e9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c -s /tmp/vcloud-vcloud-master/worker/run_dir_85121947-934a-44c5-a610-5640354827e9/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_85121947-934a-44c5-a610-5640354827e9/bin/uautomizer --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-cad4683 [2019-11-15 23:32:48,371 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:32:48,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:32:48,386 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:32:48,386 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:32:48,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:32:48,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:32:48,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:32:48,394 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:32:48,395 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:32:48,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:32:48,397 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:32:48,398 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:32:48,399 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:32:48,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:32:48,401 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:32:48,402 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:32:48,403 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:32:48,405 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:32:48,408 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:32:48,411 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:32:48,412 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:32:48,414 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:32:48,414 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:32:48,419 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:32:48,419 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:32:48,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:32:48,421 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:32:48,421 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:32:48,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:32:48,423 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:32:48,424 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:32:48,425 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:32:48,426 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:32:48,427 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:32:48,427 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:32:48,428 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:32:48,429 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:32:48,429 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:32:48,430 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:32:48,431 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:32:48,432 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_85121947-934a-44c5-a610-5640354827e9/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-15 23:32:48,450 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:32:48,450 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:32:48,452 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:32:48,452 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:32:48,452 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:32:48,453 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:32:48,453 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:32:48,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:32:48,454 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:32:48,454 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:32:48,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:32:48,455 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:32:48,455 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-15 23:32:48,455 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:32:48,455 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:32:48,456 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:32:48,456 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:32:48,456 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:32:48,457 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:32:48,457 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:32:48,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:32:48,458 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:32:48,458 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:32:48,458 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:32:48,459 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:32:48,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:32:48,459 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:32:48,459 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_85121947-934a-44c5-a610-5640354827e9/bin/uautomizer 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 [2019-11-15 23:32:48,490 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:32:48,502 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:32:48,506 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:32:48,508 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:32:48,508 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:32:48,509 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_85121947-934a-44c5-a610-5640354827e9/bin/uautomizer/../../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c [2019-11-15 23:32:48,571 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_85121947-934a-44c5-a610-5640354827e9/bin/uautomizer/data/4d19bfd1d/2eecaae42041467ea2a3d9d3973d26c4/FLAG93fb77691 [2019-11-15 23:32:48,999 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:32:48,999 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_85121947-934a-44c5-a610-5640354827e9/sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c [2019-11-15 23:32:49,005 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_85121947-934a-44c5-a610-5640354827e9/bin/uautomizer/data/4d19bfd1d/2eecaae42041467ea2a3d9d3973d26c4/FLAG93fb77691 [2019-11-15 23:32:49,369 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_85121947-934a-44c5-a610-5640354827e9/bin/uautomizer/data/4d19bfd1d/2eecaae42041467ea2a3d9d3973d26c4 [2019-11-15 23:32:49,373 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:32:49,375 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:32:49,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:32:49,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:32:49,381 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:32:49,382 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:32:49" (1/1) ... [2019-11-15 23:32:49,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b0515df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:49, skipping insertion in model container [2019-11-15 23:32:49,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:32:49" (1/1) ... [2019-11-15 23:32:49,393 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:32:49,410 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:32:49,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:32:49,573 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:32:49,660 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:32:49,682 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:32:49,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:49 WrapperNode [2019-11-15 23:32:49,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:32:49,683 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:32:49,683 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:32:49,684 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:32:49,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:49" (1/1) ... [2019-11-15 23:32:49,699 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:49" (1/1) ... [2019-11-15 23:32:49,718 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:32:49,719 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:32:49,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:32:49,721 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:32:49,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:49" (1/1) ... [2019-11-15 23:32:49,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:49" (1/1) ... [2019-11-15 23:32:49,739 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:49" (1/1) ... [2019-11-15 23:32:49,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:49" (1/1) ... [2019-11-15 23:32:49,742 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:49" (1/1) ... [2019-11-15 23:32:49,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:49" (1/1) ... [2019-11-15 23:32:49,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:49" (1/1) ... [2019-11-15 23:32:49,746 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:32:49,747 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:32:49,747 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:32:49,747 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:32:49,748 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_85121947-934a-44c5-a610-5640354827e9/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:32:49,825 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2019-11-15 23:32:49,825 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2019-11-15 23:32:49,826 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2019-11-15 23:32:49,826 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2019-11-15 23:32:49,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:32:49,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:32:50,042 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:32:50,044 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 23:32:50,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:32:50 BoogieIcfgContainer [2019-11-15 23:32:50,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:32:50,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:32:50,048 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:32:50,051 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:32:50,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:32:49" (1/3) ... [2019-11-15 23:32:50,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6feb07ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:32:50, skipping insertion in model container [2019-11-15 23:32:50,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:49" (2/3) ... [2019-11-15 23:32:50,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6feb07ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:32:50, skipping insertion in model container [2019-11-15 23:32:50,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:32:50" (3/3) ... [2019-11-15 23:32:50,059 INFO L109 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1d.c [2019-11-15 23:32:50,071 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:32:50,091 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-11-15 23:32:50,111 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-11-15 23:32:50,146 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:32:50,146 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:32:50,147 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:32:50,147 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:32:50,147 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:32:50,147 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:32:50,147 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:32:50,149 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:32:50,170 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-11-15 23:32:50,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-15 23:32:50,175 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:50,176 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:32:50,178 INFO L410 AbstractCegarLoop]: === Iteration 1 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:32:50,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:50,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1656652383, now seen corresponding path program 1 times [2019-11-15 23:32:50,192 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:50,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088256123] [2019-11-15 23:32:50,193 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:50,193 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:50,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:50,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:50,399 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088256123] [2019-11-15 23:32:50,399 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:50,400 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:32:50,400 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714366032] [2019-11-15 23:32:50,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:32:50,405 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:50,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:32:50,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:32:50,419 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 7 states. [2019-11-15 23:32:50,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:50,681 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2019-11-15 23:32:50,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:32:50,683 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-11-15 23:32:50,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:50,697 INFO L225 Difference]: With dead ends: 86 [2019-11-15 23:32:50,697 INFO L226 Difference]: Without dead ends: 79 [2019-11-15 23:32:50,701 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:32:50,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-15 23:32:50,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 66. [2019-11-15 23:32:50,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-15 23:32:50,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2019-11-15 23:32:50,809 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 8 [2019-11-15 23:32:50,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:50,811 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2019-11-15 23:32:50,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:32:50,811 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2019-11-15 23:32:50,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-15 23:32:50,813 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:50,813 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:32:50,816 INFO L410 AbstractCegarLoop]: === Iteration 2 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:32:50,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:50,817 INFO L82 PathProgramCache]: Analyzing trace with hash -183383641, now seen corresponding path program 1 times [2019-11-15 23:32:50,818 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:50,818 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780679249] [2019-11-15 23:32:50,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:50,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:50,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:50,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:50,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780679249] [2019-11-15 23:32:50,876 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:50,876 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:32:50,876 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774155845] [2019-11-15 23:32:50,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:32:50,878 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:50,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:32:50,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:50,879 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand 3 states. [2019-11-15 23:32:50,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:50,906 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2019-11-15 23:32:50,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:32:50,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-15 23:32:50,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:50,911 INFO L225 Difference]: With dead ends: 70 [2019-11-15 23:32:50,912 INFO L226 Difference]: Without dead ends: 69 [2019-11-15 23:32:50,915 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:50,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-15 23:32:50,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2019-11-15 23:32:50,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-15 23:32:50,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2019-11-15 23:32:50,933 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 9 [2019-11-15 23:32:50,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:50,934 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2019-11-15 23:32:50,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:32:50,934 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2019-11-15 23:32:50,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 23:32:50,935 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:50,935 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:32:50,936 INFO L410 AbstractCegarLoop]: === Iteration 3 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:32:50,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:50,936 INFO L82 PathProgramCache]: Analyzing trace with hash -138388889, now seen corresponding path program 1 times [2019-11-15 23:32:50,936 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:50,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600413153] [2019-11-15 23:32:50,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:50,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:50,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:50,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:50,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600413153] [2019-11-15 23:32:50,962 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:50,962 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:32:50,962 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486788197] [2019-11-15 23:32:50,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:32:50,963 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:50,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:32:50,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:50,964 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand 3 states. [2019-11-15 23:32:50,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:50,984 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2019-11-15 23:32:50,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:32:50,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-15 23:32:50,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:50,986 INFO L225 Difference]: With dead ends: 65 [2019-11-15 23:32:50,987 INFO L226 Difference]: Without dead ends: 64 [2019-11-15 23:32:50,987 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:50,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-15 23:32:50,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-15 23:32:51,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-15 23:32:51,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2019-11-15 23:32:51,008 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 11 [2019-11-15 23:32:51,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:51,009 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2019-11-15 23:32:51,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:32:51,009 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2019-11-15 23:32:51,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 23:32:51,010 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:51,010 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:32:51,011 INFO L410 AbstractCegarLoop]: === Iteration 4 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:32:51,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:51,012 INFO L82 PathProgramCache]: Analyzing trace with hash 4911801, now seen corresponding path program 1 times [2019-11-15 23:32:51,012 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:51,013 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818485956] [2019-11-15 23:32:51,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:51,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:51,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:51,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:51,099 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818485956] [2019-11-15 23:32:51,099 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:51,099 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:32:51,099 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070086910] [2019-11-15 23:32:51,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:32:51,100 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:51,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:32:51,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:32:51,101 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand 4 states. [2019-11-15 23:32:51,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:51,128 INFO L93 Difference]: Finished difference Result 85 states and 111 transitions. [2019-11-15 23:32:51,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:32:51,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-15 23:32:51,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:51,130 INFO L225 Difference]: With dead ends: 85 [2019-11-15 23:32:51,130 INFO L226 Difference]: Without dead ends: 84 [2019-11-15 23:32:51,131 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:32:51,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-15 23:32:51,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2019-11-15 23:32:51,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-15 23:32:51,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 96 transitions. [2019-11-15 23:32:51,147 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 96 transitions. Word has length 12 [2019-11-15 23:32:51,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:51,147 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 96 transitions. [2019-11-15 23:32:51,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:32:51,148 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 96 transitions. [2019-11-15 23:32:51,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 23:32:51,148 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:51,149 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:32:51,149 INFO L410 AbstractCegarLoop]: === Iteration 5 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:32:51,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:51,150 INFO L82 PathProgramCache]: Analyzing trace with hash 2115393736, now seen corresponding path program 1 times [2019-11-15 23:32:51,150 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:51,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539173225] [2019-11-15 23:32:51,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:51,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:51,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:51,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 23:32:51,194 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539173225] [2019-11-15 23:32:51,195 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:51,195 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:32:51,195 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615998929] [2019-11-15 23:32:51,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:32:51,196 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:51,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:32:51,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:51,197 INFO L87 Difference]: Start difference. First operand 74 states and 96 transitions. Second operand 3 states. [2019-11-15 23:32:51,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:51,222 INFO L93 Difference]: Finished difference Result 74 states and 96 transitions. [2019-11-15 23:32:51,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:32:51,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-15 23:32:51,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:51,229 INFO L225 Difference]: With dead ends: 74 [2019-11-15 23:32:51,229 INFO L226 Difference]: Without dead ends: 73 [2019-11-15 23:32:51,230 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:51,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-15 23:32:51,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-11-15 23:32:51,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-15 23:32:51,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 94 transitions. [2019-11-15 23:32:51,241 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 94 transitions. Word has length 16 [2019-11-15 23:32:51,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:51,241 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 94 transitions. [2019-11-15 23:32:51,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:32:51,242 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2019-11-15 23:32:51,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 23:32:51,242 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:51,243 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:32:51,243 INFO L410 AbstractCegarLoop]: === Iteration 6 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:32:51,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:51,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1152696420, now seen corresponding path program 1 times [2019-11-15 23:32:51,244 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:51,244 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043214591] [2019-11-15 23:32:51,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:51,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:51,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:51,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:51,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 23:32:51,280 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043214591] [2019-11-15 23:32:51,280 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:51,280 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:32:51,281 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208761707] [2019-11-15 23:32:51,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:32:51,281 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:51,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:32:51,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:32:51,282 INFO L87 Difference]: Start difference. First operand 73 states and 94 transitions. Second operand 4 states. [2019-11-15 23:32:51,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:51,322 INFO L93 Difference]: Finished difference Result 94 states and 126 transitions. [2019-11-15 23:32:51,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:32:51,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-15 23:32:51,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:51,325 INFO L225 Difference]: With dead ends: 94 [2019-11-15 23:32:51,325 INFO L226 Difference]: Without dead ends: 93 [2019-11-15 23:32:51,326 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:32:51,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-15 23:32:51,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 79. [2019-11-15 23:32:51,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-15 23:32:51,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2019-11-15 23:32:51,339 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 17 [2019-11-15 23:32:51,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:51,340 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2019-11-15 23:32:51,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:32:51,340 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2019-11-15 23:32:51,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 23:32:51,342 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:51,342 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:32:51,342 INFO L410 AbstractCegarLoop]: === Iteration 7 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:32:51,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:51,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1079409517, now seen corresponding path program 1 times [2019-11-15 23:32:51,343 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:51,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929465795] [2019-11-15 23:32:51,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:51,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:51,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:51,489 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:51,489 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929465795] [2019-11-15 23:32:51,489 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671777818] [2019-11-15 23:32:51,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_85121947-934a-44c5-a610-5640354827e9/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:32:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:51,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:32:51,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:32:51,592 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:51,593 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:32:51,593 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2019-11-15 23:32:51,593 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138297270] [2019-11-15 23:32:51,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:32:51,594 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:51,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:32:51,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:32:51,595 INFO L87 Difference]: Start difference. First operand 79 states and 100 transitions. Second operand 5 states. [2019-11-15 23:32:51,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:51,704 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2019-11-15 23:32:51,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:32:51,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-15 23:32:51,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:51,706 INFO L225 Difference]: With dead ends: 125 [2019-11-15 23:32:51,706 INFO L226 Difference]: Without dead ends: 75 [2019-11-15 23:32:51,708 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:32:51,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-15 23:32:51,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-11-15 23:32:51,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-15 23:32:51,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2019-11-15 23:32:51,723 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 19 [2019-11-15 23:32:51,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:51,723 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2019-11-15 23:32:51,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:32:51,724 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2019-11-15 23:32:51,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 23:32:51,725 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:51,725 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:32:51,929 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:32:51,929 INFO L410 AbstractCegarLoop]: === Iteration 8 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:32:51,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:51,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1643853139, now seen corresponding path program 1 times [2019-11-15 23:32:51,930 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:51,930 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686184685] [2019-11-15 23:32:51,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:51,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:51,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:51,999 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 23:32:52,000 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686184685] [2019-11-15 23:32:52,000 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:52,000 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:32:52,001 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317688171] [2019-11-15 23:32:52,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:32:52,001 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:52,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:32:52,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:32:52,002 INFO L87 Difference]: Start difference. First operand 73 states and 92 transitions. Second operand 6 states. [2019-11-15 23:32:52,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:52,102 INFO L93 Difference]: Finished difference Result 149 states and 206 transitions. [2019-11-15 23:32:52,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:32:52,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-15 23:32:52,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:52,105 INFO L225 Difference]: With dead ends: 149 [2019-11-15 23:32:52,105 INFO L226 Difference]: Without dead ends: 91 [2019-11-15 23:32:52,108 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:32:52,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-15 23:32:52,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2019-11-15 23:32:52,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-15 23:32:52,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 99 transitions. [2019-11-15 23:32:52,126 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 99 transitions. Word has length 21 [2019-11-15 23:32:52,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:52,127 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 99 transitions. [2019-11-15 23:32:52,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:32:52,127 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 99 transitions. [2019-11-15 23:32:52,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 23:32:52,129 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:52,129 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:32:52,129 INFO L410 AbstractCegarLoop]: === Iteration 9 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:32:52,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:52,130 INFO L82 PathProgramCache]: Analyzing trace with hash 883505486, now seen corresponding path program 1 times [2019-11-15 23:32:52,130 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:52,130 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148975950] [2019-11-15 23:32:52,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:52,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:52,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:52,207 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 23:32:52,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148975950] [2019-11-15 23:32:52,208 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:52,208 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:32:52,208 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116348979] [2019-11-15 23:32:52,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:32:52,209 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:52,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:32:52,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:32:52,209 INFO L87 Difference]: Start difference. First operand 79 states and 99 transitions. Second operand 6 states. [2019-11-15 23:32:52,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:52,311 INFO L93 Difference]: Finished difference Result 158 states and 210 transitions. [2019-11-15 23:32:52,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:32:52,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-11-15 23:32:52,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:52,314 INFO L225 Difference]: With dead ends: 158 [2019-11-15 23:32:52,315 INFO L226 Difference]: Without dead ends: 95 [2019-11-15 23:32:52,317 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:32:52,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-15 23:32:52,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2019-11-15 23:32:52,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-15 23:32:52,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 108 transitions. [2019-11-15 23:32:52,343 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 108 transitions. Word has length 27 [2019-11-15 23:32:52,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:52,345 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 108 transitions. [2019-11-15 23:32:52,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:32:52,353 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2019-11-15 23:32:52,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 23:32:52,355 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:52,355 INFO L380 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:32:52,356 INFO L410 AbstractCegarLoop]: === Iteration 10 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:32:52,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:52,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1291302577, now seen corresponding path program 1 times [2019-11-15 23:32:52,356 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:52,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41720919] [2019-11-15 23:32:52,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:52,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:52,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:52,451 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-15 23:32:52,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41720919] [2019-11-15 23:32:52,452 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:52,452 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:32:52,452 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318781004] [2019-11-15 23:32:52,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:32:52,453 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:52,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:32:52,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:32:52,453 INFO L87 Difference]: Start difference. First operand 87 states and 108 transitions. Second operand 4 states. [2019-11-15 23:32:52,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:52,492 INFO L93 Difference]: Finished difference Result 94 states and 118 transitions. [2019-11-15 23:32:52,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:32:52,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-15 23:32:52,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:52,495 INFO L225 Difference]: With dead ends: 94 [2019-11-15 23:32:52,496 INFO L226 Difference]: Without dead ends: 93 [2019-11-15 23:32:52,496 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:32:52,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-15 23:32:52,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2019-11-15 23:32:52,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-15 23:32:52,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2019-11-15 23:32:52,519 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 35 [2019-11-15 23:32:52,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:52,520 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2019-11-15 23:32:52,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:32:52,520 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2019-11-15 23:32:52,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 23:32:52,526 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:52,526 INFO L380 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:32:52,527 INFO L410 AbstractCegarLoop]: === Iteration 11 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:32:52,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:52,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1375674171, now seen corresponding path program 1 times [2019-11-15 23:32:52,528 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:52,529 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425297250] [2019-11-15 23:32:52,529 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:52,529 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:52,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:52,606 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-15 23:32:52,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425297250] [2019-11-15 23:32:52,607 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:52,607 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:32:52,608 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095539402] [2019-11-15 23:32:52,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:32:52,609 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:52,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:32:52,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:52,609 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand 3 states. [2019-11-15 23:32:52,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:52,625 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2019-11-15 23:32:52,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:32:52,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-15 23:32:52,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:52,629 INFO L225 Difference]: With dead ends: 91 [2019-11-15 23:32:52,630 INFO L226 Difference]: Without dead ends: 90 [2019-11-15 23:32:52,630 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:52,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-15 23:32:52,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-11-15 23:32:52,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-15 23:32:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2019-11-15 23:32:52,641 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 36 [2019-11-15 23:32:52,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:52,642 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2019-11-15 23:32:52,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:32:52,642 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2019-11-15 23:32:52,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 23:32:52,648 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:52,649 INFO L380 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] [2019-11-15 23:32:52,649 INFO L410 AbstractCegarLoop]: === Iteration 12 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:32:52,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:52,650 INFO L82 PathProgramCache]: Analyzing trace with hash 930510463, now seen corresponding path program 1 times [2019-11-15 23:32:52,650 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:52,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464469732] [2019-11-15 23:32:52,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:52,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:52,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:52,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:52,748 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-15 23:32:52,749 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464469732] [2019-11-15 23:32:52,749 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:52,750 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:32:52,750 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310839585] [2019-11-15 23:32:52,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:32:52,751 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:52,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:32:52,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:32:52,752 INFO L87 Difference]: Start difference. First operand 90 states and 110 transitions. Second operand 6 states. [2019-11-15 23:32:52,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:52,789 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2019-11-15 23:32:52,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:32:52,790 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-11-15 23:32:52,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:52,792 INFO L225 Difference]: With dead ends: 90 [2019-11-15 23:32:52,792 INFO L226 Difference]: Without dead ends: 89 [2019-11-15 23:32:52,793 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:32:52,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-15 23:32:52,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-11-15 23:32:52,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-15 23:32:52,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2019-11-15 23:32:52,802 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 36 [2019-11-15 23:32:52,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:52,803 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2019-11-15 23:32:52,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:32:52,803 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2019-11-15 23:32:52,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 23:32:52,805 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:52,805 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:32:52,810 INFO L410 AbstractCegarLoop]: === Iteration 13 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:32:52,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:52,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1564104406, now seen corresponding path program 1 times [2019-11-15 23:32:52,811 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:52,811 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604869740] [2019-11-15 23:32:52,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:52,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:52,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:52,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:52,932 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-15 23:32:52,933 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604869740] [2019-11-15 23:32:52,934 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:52,934 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:32:52,935 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552980618] [2019-11-15 23:32:52,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:32:52,937 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:52,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:32:52,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:32:52,938 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand 6 states. [2019-11-15 23:32:53,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:53,003 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2019-11-15 23:32:53,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:32:53,004 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-11-15 23:32:53,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:53,006 INFO L225 Difference]: With dead ends: 99 [2019-11-15 23:32:53,006 INFO L226 Difference]: Without dead ends: 98 [2019-11-15 23:32:53,006 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:32:53,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-15 23:32:53,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2019-11-15 23:32:53,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-15 23:32:53,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2019-11-15 23:32:53,023 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 41 [2019-11-15 23:32:53,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:53,023 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2019-11-15 23:32:53,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:32:53,024 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2019-11-15 23:32:53,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 23:32:53,027 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:53,028 INFO L380 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:32:53,028 INFO L410 AbstractCegarLoop]: === Iteration 14 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:32:53,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:53,029 INFO L82 PathProgramCache]: Analyzing trace with hash 138300185, now seen corresponding path program 1 times [2019-11-15 23:32:53,029 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:53,029 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804605070] [2019-11-15 23:32:53,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:53,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:53,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:53,184 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-15 23:32:53,185 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804605070] [2019-11-15 23:32:53,185 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421758203] [2019-11-15 23:32:53,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_85121947-934a-44c5-a610-5640354827e9/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:32:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:53,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:32:53,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:32:53,320 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-15 23:32:53,320 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:32:53,320 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2019-11-15 23:32:53,320 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057057591] [2019-11-15 23:32:53,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:32:53,321 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:53,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:32:53,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:32:53,322 INFO L87 Difference]: Start difference. First operand 88 states and 106 transitions. Second operand 7 states. [2019-11-15 23:32:53,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:53,578 INFO L93 Difference]: Finished difference Result 116 states and 141 transitions. [2019-11-15 23:32:53,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:32:53,579 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-11-15 23:32:53,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:53,581 INFO L225 Difference]: With dead ends: 116 [2019-11-15 23:32:53,581 INFO L226 Difference]: Without dead ends: 115 [2019-11-15 23:32:53,582 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-11-15 23:32:53,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-15 23:32:53,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-11-15 23:32:53,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-15 23:32:53,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 140 transitions. [2019-11-15 23:32:53,597 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 140 transitions. Word has length 45 [2019-11-15 23:32:53,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:53,597 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 140 transitions. [2019-11-15 23:32:53,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:32:53,598 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2019-11-15 23:32:53,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 23:32:53,599 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:53,599 INFO L380 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] [2019-11-15 23:32:53,803 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:32:53,804 INFO L410 AbstractCegarLoop]: === Iteration 15 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:32:53,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:53,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1156205799, now seen corresponding path program 1 times [2019-11-15 23:32:53,804 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:53,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48820611] [2019-11-15 23:32:53,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:53,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:53,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:53,961 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-15 23:32:53,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48820611] [2019-11-15 23:32:53,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749216853] [2019-11-15 23:32:53,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_85121947-934a-44c5-a610-5640354827e9/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:32:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:54,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:32:54,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:32:54,061 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-15 23:32:54,061 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:32:54,062 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2019-11-15 23:32:54,062 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097284200] [2019-11-15 23:32:54,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:32:54,063 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:54,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:32:54,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:32:54,064 INFO L87 Difference]: Start difference. First operand 114 states and 140 transitions. Second operand 10 states. [2019-11-15 23:32:54,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:54,204 INFO L93 Difference]: Finished difference Result 224 states and 282 transitions. [2019-11-15 23:32:54,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:32:54,205 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2019-11-15 23:32:54,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:54,207 INFO L225 Difference]: With dead ends: 224 [2019-11-15 23:32:54,207 INFO L226 Difference]: Without dead ends: 145 [2019-11-15 23:32:54,208 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:32:54,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-15 23:32:54,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 132. [2019-11-15 23:32:54,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-15 23:32:54,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 164 transitions. [2019-11-15 23:32:54,220 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 164 transitions. Word has length 43 [2019-11-15 23:32:54,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:54,221 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 164 transitions. [2019-11-15 23:32:54,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:32:54,221 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2019-11-15 23:32:54,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 23:32:54,222 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:54,223 INFO L380 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] [2019-11-15 23:32:54,427 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:32:54,427 INFO L410 AbstractCegarLoop]: === Iteration 16 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:32:54,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:54,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1154921966, now seen corresponding path program 1 times [2019-11-15 23:32:54,428 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:54,428 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707024268] [2019-11-15 23:32:54,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:54,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:54,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:54,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:54,460 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-15 23:32:54,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707024268] [2019-11-15 23:32:54,460 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:54,461 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:32:54,461 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295275899] [2019-11-15 23:32:54,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:32:54,462 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:54,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:32:54,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:54,462 INFO L87 Difference]: Start difference. First operand 132 states and 164 transitions. Second operand 3 states. [2019-11-15 23:32:54,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:54,478 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2019-11-15 23:32:54,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:32:54,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-15 23:32:54,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:54,481 INFO L225 Difference]: With dead ends: 132 [2019-11-15 23:32:54,481 INFO L226 Difference]: Without dead ends: 131 [2019-11-15 23:32:54,481 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:32:54,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-15 23:32:54,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-11-15 23:32:54,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-15 23:32:54,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 162 transitions. [2019-11-15 23:32:54,493 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 162 transitions. Word has length 43 [2019-11-15 23:32:54,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:54,493 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 162 transitions. [2019-11-15 23:32:54,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:32:54,494 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2019-11-15 23:32:54,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 23:32:54,495 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:54,495 INFO L380 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] [2019-11-15 23:32:54,495 INFO L410 AbstractCegarLoop]: === Iteration 17 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:32:54,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:54,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1442842648, now seen corresponding path program 1 times [2019-11-15 23:32:54,496 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:54,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851105508] [2019-11-15 23:32:54,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:54,497 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:54,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:54,532 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-15 23:32:54,533 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851105508] [2019-11-15 23:32:54,533 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:54,533 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:32:54,533 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121547931] [2019-11-15 23:32:54,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:32:54,534 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:54,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:32:54,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:32:54,534 INFO L87 Difference]: Start difference. First operand 131 states and 162 transitions. Second operand 4 states. [2019-11-15 23:32:54,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:54,552 INFO L93 Difference]: Finished difference Result 140 states and 172 transitions. [2019-11-15 23:32:54,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:32:54,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-11-15 23:32:54,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:54,554 INFO L225 Difference]: With dead ends: 140 [2019-11-15 23:32:54,554 INFO L226 Difference]: Without dead ends: 132 [2019-11-15 23:32:54,554 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:32:54,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-15 23:32:54,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-11-15 23:32:54,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-15 23:32:54,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 161 transitions. [2019-11-15 23:32:54,565 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 161 transitions. Word has length 44 [2019-11-15 23:32:54,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:54,566 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 161 transitions. [2019-11-15 23:32:54,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:32:54,566 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 161 transitions. [2019-11-15 23:32:54,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 23:32:54,567 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:32:54,568 INFO L380 BasicCegarLoop]: trace histogram [10, 8, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 23:32:54,568 INFO L410 AbstractCegarLoop]: === Iteration 18 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:32:54,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:54,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1995865818, now seen corresponding path program 2 times [2019-11-15 23:32:54,569 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:54,569 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052710465] [2019-11-15 23:32:54,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:54,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:54,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:54,731 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 60 proven. 32 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-15 23:32:54,732 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052710465] [2019-11-15 23:32:54,732 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053436478] [2019-11-15 23:32:54,732 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_85121947-934a-44c5-a610-5640354827e9/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:32:54,796 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:32:54,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:32:54,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:32:54,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:32:54,835 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 64 proven. 28 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-15 23:32:54,836 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:32:54,837 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 13 [2019-11-15 23:32:54,837 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451642829] [2019-11-15 23:32:54,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 23:32:54,838 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:54,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 23:32:54,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:32:54,839 INFO L87 Difference]: Start difference. First operand 132 states and 161 transitions. Second operand 13 states. [2019-11-15 23:32:55,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:55,056 INFO L93 Difference]: Finished difference Result 155 states and 185 transitions. [2019-11-15 23:32:55,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:32:55,062 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 75 [2019-11-15 23:32:55,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:32:55,062 INFO L225 Difference]: With dead ends: 155 [2019-11-15 23:32:55,063 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:32:55,064 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2019-11-15 23:32:55,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:32:55,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:32:55,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:32:55,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:32:55,065 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2019-11-15 23:32:55,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:32:55,065 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:32:55,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 23:32:55,065 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:32:55,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:32:55,271 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:32:55,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:32:55,650 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 14 [2019-11-15 23:32:55,785 INFO L443 ceAbstractionStarter]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2019-11-15 23:32:55,785 INFO L443 ceAbstractionStarter]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2019-11-15 23:32:55,785 INFO L443 ceAbstractionStarter]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-15 23:32:55,786 INFO L443 ceAbstractionStarter]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-15 23:32:55,786 INFO L443 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2019-11-15 23:32:55,786 INFO L446 ceAbstractionStarter]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2019-11-15 23:32:55,786 INFO L443 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-11-15 23:32:55,786 INFO L443 ceAbstractionStarter]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-15 23:32:55,786 INFO L443 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2019-11-15 23:32:55,786 INFO L439 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: (or (not (<= |rec1_#in~i| 2147483647)) (and (= |rec1_#in~i| rec1_~i) (<= 1 rec1_~i))) [2019-11-15 23:32:55,787 INFO L443 ceAbstractionStarter]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-15 23:32:55,787 INFO L443 ceAbstractionStarter]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-15 23:32:55,787 INFO L443 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2019-11-15 23:32:55,787 INFO L443 ceAbstractionStarter]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-15 23:32:55,787 INFO L443 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. [2019-11-15 23:32:55,787 INFO L443 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2019-11-15 23:32:55,787 INFO L439 ceAbstractionStarter]: At program point L14-6(line 14) the Hoare annotation is: (let ((.cse0 (not (<= |rec1_#in~i| 2147483647)))) (and (or .cse0 (= |rec1_#in~i| rec1_~i)) (or (and (<= |rec1_#t~ret0| 1) (<= 1 rec1_~i)) .cse0))) [2019-11-15 23:32:55,787 INFO L443 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2019-11-15 23:32:55,788 INFO L439 ceAbstractionStarter]: At program point L14-8(line 14) the Hoare annotation is: (let ((.cse0 (not (<= |rec1_#in~i| 2147483647)))) (and (or .cse0 (and (<= |rec1_#t~ret1| 0) (<= 1 rec1_~i))) (or (and (= |rec1_#in~i| rec1_~i) (<= |rec1_#t~ret0| 1)) .cse0))) [2019-11-15 23:32:55,788 INFO L443 ceAbstractionStarter]: For program point L14-9(line 14) no Hoare annotation was computed. [2019-11-15 23:32:55,788 INFO L443 ceAbstractionStarter]: For program point L14-10(line 14) no Hoare annotation was computed. [2019-11-15 23:32:55,788 INFO L443 ceAbstractionStarter]: For program point L14-11(line 14) no Hoare annotation was computed. [2019-11-15 23:32:55,788 INFO L443 ceAbstractionStarter]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2019-11-15 23:32:55,788 INFO L443 ceAbstractionStarter]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2019-11-15 23:32:55,788 INFO L439 ceAbstractionStarter]: At program point L20(line 20) the Hoare annotation is: (and (or (and (<= rec2_~j 2147483647) (<= 1 rec2_~j)) (not (<= |rec2_#in~j| 2147483647))) (not (<= |rec2_#in~j| 0))) [2019-11-15 23:32:55,788 INFO L443 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-11-15 23:32:55,788 INFO L443 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2019-11-15 23:32:55,789 INFO L443 ceAbstractionStarter]: For program point L20-2(line 20) no Hoare annotation was computed. [2019-11-15 23:32:55,789 INFO L443 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-11-15 23:32:55,789 INFO L443 ceAbstractionStarter]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-15 23:32:55,789 INFO L439 ceAbstractionStarter]: At program point L20-4(line 20) the Hoare annotation is: (and (or (and (<= rec2_~j 2147483647) (<= |rec2_#t~ret3| 1) (<= 1 rec2_~j) (<= 1 |rec2_#t~ret3|)) (not (<= |rec2_#in~j| 2147483647))) (not (<= |rec2_#in~j| 0))) [2019-11-15 23:32:55,789 INFO L443 ceAbstractionStarter]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-15 23:32:55,790 INFO L443 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2019-11-15 23:32:55,791 INFO L443 ceAbstractionStarter]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-15 23:32:55,791 INFO L443 ceAbstractionStarter]: For program point L20-6(line 20) no Hoare annotation was computed. [2019-11-15 23:32:55,791 INFO L443 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2019-11-15 23:32:55,791 INFO L443 ceAbstractionStarter]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-15 23:32:55,791 INFO L446 ceAbstractionStarter]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2019-11-15 23:32:55,792 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:32:55,792 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:32:55,792 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:32:55,792 INFO L439 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-11-15 23:32:55,792 INFO L443 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2019-11-15 23:32:55,792 INFO L443 ceAbstractionStarter]: For program point L23(lines 23 26) no Hoare annotation was computed. [2019-11-15 23:32:55,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:32:55 BoogieIcfgContainer [2019-11-15 23:32:55,798 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:32:55,798 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:32:55,799 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:32:55,799 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:32:55,799 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:32:50" (3/4) ... [2019-11-15 23:32:55,811 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:32:55,831 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2019-11-15 23:32:55,832 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2019-11-15 23:32:55,838 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-15 23:32:55,840 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 23:32:55,916 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_85121947-934a-44c5-a610-5640354827e9/bin/uautomizer/witness.graphml [2019-11-15 23:32:55,917 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:32:55,918 INFO L168 Benchmark]: Toolchain (without parser) took 6544.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.3 MB). Free memory was 944.7 MB in the beginning and 992.8 MB in the end (delta: -48.0 MB). Peak memory consumption was 163.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:32:55,919 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:32:55,920 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -195.8 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:32:55,920 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:32:55,920 INFO L168 Benchmark]: Boogie Preprocessor took 27.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:32:55,921 INFO L168 Benchmark]: RCFGBuilder took 299.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:32:55,921 INFO L168 Benchmark]: TraceAbstraction took 5750.86 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 111.5 MB). Peak memory consumption was 177.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:32:55,922 INFO L168 Benchmark]: Witness Printer took 118.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:32:55,924 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 306.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -195.8 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 299.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5750.86 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 111.5 MB). Peak memory consumption was 177.0 MB. Max. memory is 11.5 GB. * Witness Printer took 118.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.6 MB). Peak memory consumption was 2.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 3 procedures, 44 locations, 10 error locations. Result: SAFE, OverallTime: 5.6s, OverallIterations: 18, TraceHistogramMax: 10, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, HoareTripleCheckerStatistics: 687 SDtfs, 232 SDslu, 1730 SDs, 0 SdLazy, 623 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 382 GetRequests, 285 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 89 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 225 PreInvPairs, 234 NumberOfFragments, 103 HoareAnnotationTreeSize, 225 FomulaSimplifications, 518 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 217 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 720 NumberOfCodeBlocks, 720 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 698 ConstructedInterpolants, 0 QuantifiedInterpolants, 48534 SizeOfPredicates, 6 NumberOfNonLiveVariables, 386 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 22 InterpolantComputations, 16 PerfectInterpolantSequences, 672/740 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...