java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label52.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 17:58:58,443 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 17:58:58,445 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 17:58:58,464 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 17:58:58,464 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 17:58:58,466 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 17:58:58,468 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 17:58:58,477 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 17:58:58,479 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 17:58:58,481 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 17:58:58,484 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 17:58:58,485 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 17:58:58,486 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 17:58:58,489 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 17:58:58,491 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 17:58:58,492 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 17:58:58,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 17:58:58,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 17:58:58,498 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 17:58:58,503 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 17:58:58,508 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 17:58:58,508 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 17:58:58,510 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 17:58:58,511 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 17:58:58,513 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 17:58:58,514 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 17:58:58,514 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 17:58:58,516 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 17:58:58,517 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 17:58:58,519 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 17:58:58,519 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 17:58:58,520 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 17:58:58,520 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 17:58:58,521 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 17:58:58,523 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 17:58:58,523 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 17:58:58,524 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 17:58:58,524 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 17:58:58,524 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 17:58:58,526 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 17:58:58,530 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 17:58:58,530 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 17:58:58,563 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 17:58:58,563 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 17:58:58,567 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 17:58:58,567 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 17:58:58,568 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 17:58:58,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 17:58:58,568 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 17:58:58,568 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 17:58:58,569 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 17:58:58,569 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 17:58:58,569 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 17:58:58,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 17:58:58,573 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 17:58:58,573 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 17:58:58,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 17:58:58,573 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 17:58:58,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 17:58:58,574 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 17:58:58,574 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 17:58:58,574 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 17:58:58,574 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 17:58:58,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 17:58:58,575 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 17:58:58,575 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 17:58:58,579 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 17:58:58,579 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 17:58:58,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 17:58:58,580 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 17:58:58,580 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 17:58:58,856 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 17:58:58,869 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 17:58:58,872 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 17:58:58,874 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 17:58:58,874 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 17:58:58,875 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label52.c [2019-10-13 17:58:58,934 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89c31f55e/05ed04b95b3842abbbfc5659a7e74da2/FLAGd1998988d [2019-10-13 17:58:59,429 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 17:58:59,430 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label52.c [2019-10-13 17:58:59,442 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89c31f55e/05ed04b95b3842abbbfc5659a7e74da2/FLAGd1998988d [2019-10-13 17:58:59,716 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89c31f55e/05ed04b95b3842abbbfc5659a7e74da2 [2019-10-13 17:58:59,725 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 17:58:59,726 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 17:58:59,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 17:58:59,727 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 17:58:59,730 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 17:58:59,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:58:59" (1/1) ... [2019-10-13 17:58:59,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3614d8fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:59, skipping insertion in model container [2019-10-13 17:58:59,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:58:59" (1/1) ... [2019-10-13 17:58:59,742 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 17:58:59,794 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 17:59:00,343 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 17:59:00,348 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 17:59:00,531 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 17:59:00,562 INFO L192 MainTranslator]: Completed translation [2019-10-13 17:59:00,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:59:00 WrapperNode [2019-10-13 17:59:00,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 17:59:00,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 17:59:00,563 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 17:59:00,564 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 17:59:00,582 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:59:00" (1/1) ... [2019-10-13 17:59:00,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:59:00" (1/1) ... [2019-10-13 17:59:00,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:59:00" (1/1) ... [2019-10-13 17:59:00,616 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:59:00" (1/1) ... [2019-10-13 17:59:00,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:59:00" (1/1) ... [2019-10-13 17:59:00,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:59:00" (1/1) ... [2019-10-13 17:59:00,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:59:00" (1/1) ... [2019-10-13 17:59:00,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 17:59:00,699 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 17:59:00,699 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 17:59:00,699 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 17:59:00,700 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:59:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 17:59:00,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 17:59:00,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 17:59:00,767 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-13 17:59:00,767 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 17:59:00,767 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-13 17:59:00,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 17:59:00,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 17:59:00,768 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 17:59:00,768 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 17:59:00,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 17:59:00,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 17:59:02,038 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 17:59:02,039 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 17:59:02,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:59:02 BoogieIcfgContainer [2019-10-13 17:59:02,041 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 17:59:02,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 17:59:02,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 17:59:02,045 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 17:59:02,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:58:59" (1/3) ... [2019-10-13 17:59:02,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e31546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:59:02, skipping insertion in model container [2019-10-13 17:59:02,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:59:00" (2/3) ... [2019-10-13 17:59:02,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e31546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:59:02, skipping insertion in model container [2019-10-13 17:59:02,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:59:02" (3/3) ... [2019-10-13 17:59:02,049 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label52.c [2019-10-13 17:59:02,059 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 17:59:02,067 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 17:59:02,078 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 17:59:02,106 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 17:59:02,106 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 17:59:02,106 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 17:59:02,106 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 17:59:02,107 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 17:59:02,107 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 17:59:02,107 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 17:59:02,107 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 17:59:02,133 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2019-10-13 17:59:02,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-13 17:59:02,141 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:59:02,142 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:59:02,144 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:59:02,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:59:02,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1515832586, now seen corresponding path program 1 times [2019-10-13 17:59:02,158 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:59:02,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556280115] [2019-10-13 17:59:02,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:02,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:02,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:59:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:02,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:59:02,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556280115] [2019-10-13 17:59:02,559 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 17:59:02,560 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 17:59:02,560 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400527763] [2019-10-13 17:59:02,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 17:59:02,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:59:02,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 17:59:02,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 17:59:02,586 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 5 states. [2019-10-13 17:59:04,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:59:04,660 INFO L93 Difference]: Finished difference Result 730 states and 1301 transitions. [2019-10-13 17:59:04,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 17:59:04,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-13 17:59:04,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:59:04,681 INFO L225 Difference]: With dead ends: 730 [2019-10-13 17:59:04,681 INFO L226 Difference]: Without dead ends: 447 [2019-10-13 17:59:04,689 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-13 17:59:04,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-10-13 17:59:04,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 441. [2019-10-13 17:59:04,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-10-13 17:59:04,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 672 transitions. [2019-10-13 17:59:04,779 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 672 transitions. Word has length 47 [2019-10-13 17:59:04,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:59:04,779 INFO L462 AbstractCegarLoop]: Abstraction has 441 states and 672 transitions. [2019-10-13 17:59:04,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 17:59:04,780 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 672 transitions. [2019-10-13 17:59:04,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-13 17:59:04,786 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:59:04,786 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 17:59:04,787 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:59:04,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:59:04,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1601579245, now seen corresponding path program 1 times [2019-10-13 17:59:04,788 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:59:04,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624502614] [2019-10-13 17:59:04,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:04,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:04,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:59:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:05,103 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:59:05,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624502614] [2019-10-13 17:59:05,104 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 17:59:05,105 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 17:59:05,105 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313786104] [2019-10-13 17:59:05,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 17:59:05,109 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:59:05,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 17:59:05,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-13 17:59:05,110 INFO L87 Difference]: Start difference. First operand 441 states and 672 transitions. Second operand 9 states. [2019-10-13 17:59:06,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:59:06,868 INFO L93 Difference]: Finished difference Result 1041 states and 1612 transitions. [2019-10-13 17:59:06,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 17:59:06,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-10-13 17:59:06,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:59:06,874 INFO L225 Difference]: With dead ends: 1041 [2019-10-13 17:59:06,874 INFO L226 Difference]: Without dead ends: 606 [2019-10-13 17:59:06,876 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-10-13 17:59:06,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-10-13 17:59:06,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 592. [2019-10-13 17:59:06,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-13 17:59:06,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 829 transitions. [2019-10-13 17:59:06,917 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 829 transitions. Word has length 120 [2019-10-13 17:59:06,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:59:06,918 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 829 transitions. [2019-10-13 17:59:06,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 17:59:06,918 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 829 transitions. [2019-10-13 17:59:06,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-13 17:59:06,921 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:59:06,922 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:59:06,922 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:59:06,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:59:06,923 INFO L82 PathProgramCache]: Analyzing trace with hash -446355495, now seen corresponding path program 1 times [2019-10-13 17:59:06,923 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:59:06,923 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450449287] [2019-10-13 17:59:06,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:06,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:06,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:59:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:07,073 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 39 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:59:07,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450449287] [2019-10-13 17:59:07,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654529194] [2019-10-13 17:59:07,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:07,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 17:59:07,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:59:07,260 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:59:07,260 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 17:59:07,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-13 17:59:07,263 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6902268] [2019-10-13 17:59:07,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 17:59:07,267 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:59:07,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 17:59:07,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 17:59:07,274 INFO L87 Difference]: Start difference. First operand 592 states and 829 transitions. Second operand 3 states. [2019-10-13 17:59:07,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:59:07,996 INFO L93 Difference]: Finished difference Result 1615 states and 2274 transitions. [2019-10-13 17:59:07,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 17:59:07,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-10-13 17:59:07,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:59:08,004 INFO L225 Difference]: With dead ends: 1615 [2019-10-13 17:59:08,004 INFO L226 Difference]: Without dead ends: 1029 [2019-10-13 17:59:08,006 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 17:59:08,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2019-10-13 17:59:08,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 886. [2019-10-13 17:59:08,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2019-10-13 17:59:08,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1150 transitions. [2019-10-13 17:59:08,046 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1150 transitions. Word has length 126 [2019-10-13 17:59:08,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:59:08,047 INFO L462 AbstractCegarLoop]: Abstraction has 886 states and 1150 transitions. [2019-10-13 17:59:08,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 17:59:08,047 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1150 transitions. [2019-10-13 17:59:08,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-13 17:59:08,053 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:59:08,053 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:59:08,258 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:08,259 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:59:08,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:59:08,260 INFO L82 PathProgramCache]: Analyzing trace with hash -757427466, now seen corresponding path program 1 times [2019-10-13 17:59:08,261 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:59:08,261 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843531141] [2019-10-13 17:59:08,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:08,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:08,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:59:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:08,639 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:59:08,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843531141] [2019-10-13 17:59:08,639 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 17:59:08,639 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 17:59:08,639 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997658236] [2019-10-13 17:59:08,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 17:59:08,640 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:59:08,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 17:59:08,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-13 17:59:08,641 INFO L87 Difference]: Start difference. First operand 886 states and 1150 transitions. Second operand 9 states. [2019-10-13 17:59:11,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:59:11,338 INFO L93 Difference]: Finished difference Result 2245 states and 2959 transitions. [2019-10-13 17:59:11,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 17:59:11,339 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 183 [2019-10-13 17:59:11,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:59:11,347 INFO L225 Difference]: With dead ends: 2245 [2019-10-13 17:59:11,347 INFO L226 Difference]: Without dead ends: 1365 [2019-10-13 17:59:11,351 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-10-13 17:59:11,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2019-10-13 17:59:11,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1057. [2019-10-13 17:59:11,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1057 states. [2019-10-13 17:59:11,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1317 transitions. [2019-10-13 17:59:11,437 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1317 transitions. Word has length 183 [2019-10-13 17:59:11,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:59:11,438 INFO L462 AbstractCegarLoop]: Abstraction has 1057 states and 1317 transitions. [2019-10-13 17:59:11,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 17:59:11,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1317 transitions. [2019-10-13 17:59:11,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-13 17:59:11,444 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:59:11,444 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:59:11,444 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:59:11,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:59:11,445 INFO L82 PathProgramCache]: Analyzing trace with hash 271418902, now seen corresponding path program 1 times [2019-10-13 17:59:11,445 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:59:11,445 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400279873] [2019-10-13 17:59:11,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:11,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:11,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:59:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:11,716 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 147 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 17:59:11,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400279873] [2019-10-13 17:59:11,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950787842] [2019-10-13 17:59:11,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:11,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 17:59:11,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:59:11,916 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 148 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:59:11,916 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:59:11,916 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-13 17:59:11,916 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496223622] [2019-10-13 17:59:11,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 17:59:11,917 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:59:11,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 17:59:11,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-10-13 17:59:11,918 INFO L87 Difference]: Start difference. First operand 1057 states and 1317 transitions. Second operand 11 states. [2019-10-13 17:59:15,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:59:15,051 INFO L93 Difference]: Finished difference Result 2933 states and 4043 transitions. [2019-10-13 17:59:15,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-13 17:59:15,052 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 207 [2019-10-13 17:59:15,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:59:15,067 INFO L225 Difference]: With dead ends: 2933 [2019-10-13 17:59:15,067 INFO L226 Difference]: Without dead ends: 1882 [2019-10-13 17:59:15,071 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=359, Unknown=0, NotChecked=0, Total=506 [2019-10-13 17:59:15,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2019-10-13 17:59:15,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1397. [2019-10-13 17:59:15,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1397 states. [2019-10-13 17:59:15,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 1791 transitions. [2019-10-13 17:59:15,146 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 1791 transitions. Word has length 207 [2019-10-13 17:59:15,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:59:15,147 INFO L462 AbstractCegarLoop]: Abstraction has 1397 states and 1791 transitions. [2019-10-13 17:59:15,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 17:59:15,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 1791 transitions. [2019-10-13 17:59:15,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-13 17:59:15,153 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:59:15,154 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:59:15,357 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:15,358 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:59:15,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:59:15,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1540243501, now seen corresponding path program 1 times [2019-10-13 17:59:15,359 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:59:15,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345559338] [2019-10-13 17:59:15,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:15,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:15,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:59:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:15,565 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 78 proven. 2 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-10-13 17:59:15,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345559338] [2019-10-13 17:59:15,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318201969] [2019-10-13 17:59:15,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:15,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 17:59:15,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:59:15,762 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-13 17:59:15,762 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 17:59:15,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-13 17:59:15,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365772443] [2019-10-13 17:59:15,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 17:59:15,763 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:59:15,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 17:59:15,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 17:59:15,764 INFO L87 Difference]: Start difference. First operand 1397 states and 1791 transitions. Second operand 3 states. [2019-10-13 17:59:16,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:59:16,425 INFO L93 Difference]: Finished difference Result 3825 states and 5026 transitions. [2019-10-13 17:59:16,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 17:59:16,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-10-13 17:59:16,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:59:16,441 INFO L225 Difference]: With dead ends: 3825 [2019-10-13 17:59:16,441 INFO L226 Difference]: Without dead ends: 2434 [2019-10-13 17:59:16,447 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 17:59:16,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2019-10-13 17:59:16,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2434. [2019-10-13 17:59:16,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2434 states. [2019-10-13 17:59:16,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 3049 transitions. [2019-10-13 17:59:16,528 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 3049 transitions. Word has length 224 [2019-10-13 17:59:16,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:59:16,529 INFO L462 AbstractCegarLoop]: Abstraction has 2434 states and 3049 transitions. [2019-10-13 17:59:16,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 17:59:16,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 3049 transitions. [2019-10-13 17:59:16,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-10-13 17:59:16,538 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:59:16,538 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:59:16,742 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:16,742 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:59:16,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:59:16,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1642135730, now seen corresponding path program 1 times [2019-10-13 17:59:16,743 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:59:16,743 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497697150] [2019-10-13 17:59:16,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:16,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:16,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:59:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:16,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:17,125 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 153 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 17:59:17,126 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497697150] [2019-10-13 17:59:17,126 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271491326] [2019-10-13 17:59:17,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:17,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 17:59:17,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:59:17,308 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 157 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:59:17,309 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:59:17,309 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 13 [2019-10-13 17:59:17,309 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456758621] [2019-10-13 17:59:17,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 17:59:17,311 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:59:17,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 17:59:17,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-10-13 17:59:17,311 INFO L87 Difference]: Start difference. First operand 2434 states and 3049 transitions. Second operand 13 states. [2019-10-13 17:59:21,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:59:21,267 INFO L93 Difference]: Finished difference Result 6936 states and 8618 transitions. [2019-10-13 17:59:21,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 17:59:21,268 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 267 [2019-10-13 17:59:21,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:59:21,280 INFO L225 Difference]: With dead ends: 6936 [2019-10-13 17:59:21,280 INFO L226 Difference]: Without dead ends: 2716 [2019-10-13 17:59:21,294 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=524, Unknown=0, NotChecked=0, Total=702 [2019-10-13 17:59:21,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2019-10-13 17:59:21,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 2271. [2019-10-13 17:59:21,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2271 states. [2019-10-13 17:59:21,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 2271 states and 2597 transitions. [2019-10-13 17:59:21,366 INFO L78 Accepts]: Start accepts. Automaton has 2271 states and 2597 transitions. Word has length 267 [2019-10-13 17:59:21,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:59:21,367 INFO L462 AbstractCegarLoop]: Abstraction has 2271 states and 2597 transitions. [2019-10-13 17:59:21,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-13 17:59:21,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2271 states and 2597 transitions. [2019-10-13 17:59:21,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-10-13 17:59:21,377 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:59:21,377 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:59:21,580 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:21,581 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:59:21,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:59:21,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1698020394, now seen corresponding path program 1 times [2019-10-13 17:59:21,582 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:59:21,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105301877] [2019-10-13 17:59:21,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:21,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:21,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:59:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:21,819 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 81 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-13 17:59:21,820 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105301877] [2019-10-13 17:59:21,820 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111152450] [2019-10-13 17:59:21,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:21,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 17:59:21,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:59:22,083 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-13 17:59:22,083 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 17:59:22,084 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-13 17:59:22,084 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507667666] [2019-10-13 17:59:22,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 17:59:22,085 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:59:22,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 17:59:22,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 17:59:22,086 INFO L87 Difference]: Start difference. First operand 2271 states and 2597 transitions. Second operand 3 states. [2019-10-13 17:59:22,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:59:22,610 INFO L93 Difference]: Finished difference Result 4685 states and 5436 transitions. [2019-10-13 17:59:22,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 17:59:22,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2019-10-13 17:59:22,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:59:22,612 INFO L225 Difference]: With dead ends: 4685 [2019-10-13 17:59:22,612 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 17:59:22,625 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 17:59:22,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 17:59:22,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 17:59:22,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 17:59:22,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 17:59:22,626 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 303 [2019-10-13 17:59:22,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:59:22,627 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 17:59:22,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 17:59:22,627 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 17:59:22,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 17:59:22,839 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:22,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 17:59:23,326 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 108 [2019-10-13 17:59:23,539 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 108 [2019-10-13 17:59:24,274 WARN L191 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 44 [2019-10-13 17:59:24,629 WARN L191 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 33 [2019-10-13 17:59:24,945 WARN L191 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 33 [2019-10-13 17:59:24,948 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-13 17:59:24,949 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a12~0 |old(~a12~0)|) (= ~a10~0 |old(~a10~0)|) (= ~inputE~0 |old(~inputE~0)|) (= ~inputB~0 |old(~inputB~0)|) (= ~inputF~0 |old(~inputF~0)|) (= ~inputC~0 |old(~inputC~0)|) (= ~a19~0 |old(~a19~0)|) (= ~inputD~0 |old(~inputD~0)|) (= ~a4~0 |old(~a4~0)|) (= ~a1~0 |old(~a1~0)|)) [2019-10-13 17:59:24,949 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 17:59:24,949 INFO L443 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2019-10-13 17:59:24,949 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,949 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,949 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,949 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,949 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,950 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,950 INFO L443 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2019-10-13 17:59:24,950 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2019-10-13 17:59:24,950 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-10-13 17:59:24,950 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-10-13 17:59:24,950 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-10-13 17:59:24,950 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-10-13 17:59:24,950 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-10-13 17:59:24,950 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-10-13 17:59:24,950 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2019-10-13 17:59:24,950 INFO L443 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2019-10-13 17:59:24,950 INFO L443 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2019-10-13 17:59:24,950 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,951 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,951 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,951 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,951 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,951 INFO L443 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2019-10-13 17:59:24,951 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2019-10-13 17:59:24,951 INFO L443 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2019-10-13 17:59:24,951 INFO L443 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2019-10-13 17:59:24,951 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-13 17:59:24,951 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-10-13 17:59:24,952 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-10-13 17:59:24,952 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-10-13 17:59:24,952 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-10-13 17:59:24,952 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2019-10-13 17:59:24,952 INFO L443 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2019-10-13 17:59:24,952 INFO L443 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2019-10-13 17:59:24,952 INFO L443 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2019-10-13 17:59:24,952 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2019-10-13 17:59:24,952 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,952 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,953 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,953 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,953 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,953 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2019-10-13 17:59:24,953 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-10-13 17:59:24,953 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-10-13 17:59:24,953 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-10-13 17:59:24,953 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-10-13 17:59:24,953 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-10-13 17:59:24,954 INFO L443 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2019-10-13 17:59:24,954 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2019-10-13 17:59:24,954 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2019-10-13 17:59:24,954 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2019-10-13 17:59:24,954 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,954 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,958 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,958 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,958 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,958 INFO L443 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2019-10-13 17:59:24,958 INFO L443 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2019-10-13 17:59:24,958 INFO L443 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2019-10-13 17:59:24,958 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-10-13 17:59:24,958 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-10-13 17:59:24,959 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-10-13 17:59:24,959 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-10-13 17:59:24,959 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-10-13 17:59:24,959 INFO L443 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2019-10-13 17:59:24,959 INFO L443 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2019-10-13 17:59:24,959 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2019-10-13 17:59:24,959 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2019-10-13 17:59:24,959 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2019-10-13 17:59:24,959 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,959 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,959 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,960 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,960 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,960 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-10-13 17:59:24,960 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-10-13 17:59:24,960 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-10-13 17:59:24,960 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-10-13 17:59:24,960 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-10-13 17:59:24,960 INFO L443 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2019-10-13 17:59:24,960 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2019-10-13 17:59:24,960 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2019-10-13 17:59:24,960 INFO L443 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2019-10-13 17:59:24,961 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,961 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,961 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,961 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,961 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,961 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,961 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,961 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2019-10-13 17:59:24,961 INFO L443 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2019-10-13 17:59:24,961 INFO L443 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2019-10-13 17:59:24,961 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2019-10-13 17:59:24,961 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-10-13 17:59:24,961 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-10-13 17:59:24,962 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-10-13 17:59:24,962 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-10-13 17:59:24,962 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-10-13 17:59:24,962 INFO L443 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2019-10-13 17:59:24,962 INFO L443 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2019-10-13 17:59:24,962 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2019-10-13 17:59:24,962 INFO L443 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2019-10-13 17:59:24,962 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,962 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,962 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,962 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,962 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-10-13 17:59:24,963 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,963 INFO L443 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,963 INFO L443 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2019-10-13 17:59:24,963 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2019-10-13 17:59:24,963 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2019-10-13 17:59:24,963 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-10-13 17:59:24,963 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-10-13 17:59:24,963 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-10-13 17:59:24,963 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-10-13 17:59:24,963 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-10-13 17:59:24,963 INFO L443 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-10-13 17:59:24,963 INFO L443 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2019-10-13 17:59:24,964 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2019-10-13 17:59:24,964 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2019-10-13 17:59:24,964 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2019-10-13 17:59:24,964 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,964 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,964 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,964 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,964 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,964 INFO L443 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,964 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2019-10-13 17:59:24,964 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2019-10-13 17:59:24,964 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2019-10-13 17:59:24,964 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-10-13 17:59:24,964 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-10-13 17:59:24,965 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-10-13 17:59:24,965 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-10-13 17:59:24,965 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-10-13 17:59:24,965 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-10-13 17:59:24,965 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 127) no Hoare annotation was computed. [2019-10-13 17:59:24,965 INFO L443 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2019-10-13 17:59:24,965 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2019-10-13 17:59:24,966 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 574) the Hoare annotation is: (let ((.cse2 (= ~a1~0 |old(~a1~0)|)) (.cse3 (= ~a19~0 |old(~a19~0)|))) (let ((.cse0 (not (<= |old(~a19~0)| 8))) (.cse1 (and .cse2 (= ~a10~0 |old(~a10~0)|) .cse3))) (and (or (= 8 |old(~a19~0)|) .cse0 .cse1) (or .cse1 (not (= 9 |old(~a19~0)|))) (or .cse0 .cse1 (not (<= 4 |old(~a10~0)|))) (or (not (= 2 |old(~a10~0)|)) .cse0 (and .cse2 (= ~a10~0 2) .cse3)) (or .cse0 .cse1 (not (< 218 |old(~a1~0)|))) (or (not (<= |old(~a10~0)| 0)) .cse1) (or (not (<= |old(~a10~0)| 1)) (not (<= 9 |old(~a19~0)|)) .cse1)))) [2019-10-13 17:59:24,966 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2019-10-13 17:59:24,966 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2019-10-13 17:59:24,966 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2019-10-13 17:59:24,966 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,966 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,966 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,966 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,967 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,967 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,967 INFO L443 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2019-10-13 17:59:24,967 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-10-13 17:59:24,967 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-10-13 17:59:24,967 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-10-13 17:59:24,967 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-10-13 17:59:24,967 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-10-13 17:59:24,967 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-10-13 17:59:24,967 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2019-10-13 17:59:24,968 INFO L443 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2019-10-13 17:59:24,968 INFO L443 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2019-10-13 17:59:24,968 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2019-10-13 17:59:24,968 INFO L443 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2019-10-13 17:59:24,968 INFO L443 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2019-10-13 17:59:24,968 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,968 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,968 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,968 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,969 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,969 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,969 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2019-10-13 17:59:24,969 INFO L443 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2019-10-13 17:59:24,969 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2019-10-13 17:59:24,969 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-10-13 17:59:24,969 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-10-13 17:59:24,969 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-10-13 17:59:24,969 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-10-13 17:59:24,969 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-10-13 17:59:24,970 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-10-13 17:59:24,970 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2019-10-13 17:59:24,970 INFO L443 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2019-10-13 17:59:24,970 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2019-10-13 17:59:24,970 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,970 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,970 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,970 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,970 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,970 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2019-10-13 17:59:24,970 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2019-10-13 17:59:24,971 INFO L443 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2019-10-13 17:59:24,971 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2019-10-13 17:59:24,971 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-10-13 17:59:24,971 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-10-13 17:59:24,971 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-10-13 17:59:24,971 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-13 17:59:24,971 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-10-13 17:59:24,971 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-10-13 17:59:24,971 INFO L443 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2019-10-13 17:59:24,971 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2019-10-13 17:59:24,971 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2019-10-13 17:59:24,971 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 17:59:24,971 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= ~a19~0 9) (<= ~a10~0 0) (<= 9 ~a19~0)) [2019-10-13 17:59:24,971 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 17:59:24,972 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 17:59:24,972 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 576 592) the Hoare annotation is: (or (not (<= |old(~a19~0)| 9)) (and (= ~a1~0 |old(~a1~0)|) (= ~a10~0 |old(~a10~0)|) (= ~a19~0 |old(~a19~0)|)) (not (<= |old(~a10~0)| 0)) (not (<= 9 |old(~a19~0)|))) [2019-10-13 17:59:24,972 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2019-10-13 17:59:24,972 INFO L439 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (let ((.cse0 (not (= ~a19~0 8))) (.cse1 (<= ~a19~0 8))) (or (and .cse0 (<= ~a10~0 1)) (and (<= ~a19~0 9) .cse0) (and .cse1 (<= 4 ~a10~0)) (and (= ~a10~0 2) .cse1) (not (<= |old(~a19~0)| 9)) (not (<= |old(~a10~0)| 0)) (and (< 218 ~a1~0) .cse1) (<= ~a10~0 0) (not (<= 9 |old(~a19~0)|)))) [2019-10-13 17:59:24,972 INFO L443 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2019-10-13 17:59:24,972 INFO L443 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2019-10-13 17:59:24,972 INFO L439 ceAbstractionStarter]: At program point L582-2(lines 582 591) the Hoare annotation is: (let ((.cse0 (not (= ~a19~0 8))) (.cse1 (<= ~a19~0 8))) (or (and .cse0 (<= ~a10~0 1)) (and (<= ~a19~0 9) .cse0) (and .cse1 (<= 4 ~a10~0)) (and (= ~a10~0 2) .cse1) (not (<= |old(~a19~0)| 9)) (not (<= |old(~a10~0)| 0)) (and (< 218 ~a1~0) .cse1) (<= ~a10~0 0) (not (<= 9 |old(~a19~0)|)))) [2019-10-13 17:59:24,972 INFO L443 ceAbstractionStarter]: For program point L582-3(lines 576 592) no Hoare annotation was computed. [2019-10-13 17:59:24,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 05:59:24 BoogieIcfgContainer [2019-10-13 17:59:24,993 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 17:59:24,997 INFO L168 Benchmark]: Toolchain (without parser) took 25268.61 ms. Allocated memory was 137.9 MB in the beginning and 581.4 MB in the end (delta: 443.5 MB). Free memory was 101.6 MB in the beginning and 389.2 MB in the end (delta: -287.6 MB). Peak memory consumption was 418.7 MB. Max. memory is 7.1 GB. [2019-10-13 17:59:24,998 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 17:59:24,999 INFO L168 Benchmark]: CACSL2BoogieTranslator took 835.74 ms. Allocated memory was 137.9 MB in the beginning and 204.5 MB in the end (delta: 66.6 MB). Free memory was 101.4 MB in the beginning and 170.8 MB in the end (delta: -69.5 MB). Peak memory consumption was 35.7 MB. Max. memory is 7.1 GB. [2019-10-13 17:59:25,002 INFO L168 Benchmark]: Boogie Preprocessor took 135.29 ms. Allocated memory is still 204.5 MB. Free memory was 170.8 MB in the beginning and 166.4 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 7.1 GB. [2019-10-13 17:59:25,003 INFO L168 Benchmark]: RCFGBuilder took 1342.03 ms. Allocated memory was 204.5 MB in the beginning and 235.4 MB in the end (delta: 30.9 MB). Free memory was 166.4 MB in the beginning and 182.6 MB in the end (delta: -16.1 MB). Peak memory consumption was 85.4 MB. Max. memory is 7.1 GB. [2019-10-13 17:59:25,004 INFO L168 Benchmark]: TraceAbstraction took 22950.83 ms. Allocated memory was 235.4 MB in the beginning and 581.4 MB in the end (delta: 346.0 MB). Free memory was 182.6 MB in the beginning and 389.2 MB in the end (delta: -206.7 MB). Peak memory consumption was 402.1 MB. Max. memory is 7.1 GB. [2019-10-13 17:59:25,014 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 835.74 ms. Allocated memory was 137.9 MB in the beginning and 204.5 MB in the end (delta: 66.6 MB). Free memory was 101.4 MB in the beginning and 170.8 MB in the end (delta: -69.5 MB). Peak memory consumption was 35.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.29 ms. Allocated memory is still 204.5 MB. Free memory was 170.8 MB in the beginning and 166.4 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1342.03 ms. Allocated memory was 204.5 MB in the beginning and 235.4 MB in the end (delta: 30.9 MB). Free memory was 166.4 MB in the beginning and 182.6 MB in the end (delta: -16.1 MB). Peak memory consumption was 85.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22950.83 ms. Allocated memory was 235.4 MB in the beginning and 581.4 MB in the end (delta: 346.0 MB). Free memory was 182.6 MB in the beginning and 389.2 MB in the end (delta: -206.7 MB). Peak memory consumption was 402.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 127]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 582]: Loop Invariant Derived loop invariant: ((((((((!(a19 == 8) && a10 <= 1) || (a19 <= 9 && !(a19 == 8))) || (a19 <= 8 && 4 <= a10)) || (a10 == 2 && a19 <= 8)) || !(\old(a19) <= 9)) || !(\old(a10) <= 0)) || (218 < a1 && a19 <= 8)) || a10 <= 0) || !(9 <= \old(a19)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 215 locations, 1 error locations. Result: SAFE, OverallTime: 22.8s, OverallIterations: 8, TraceHistogramMax: 3, AutomataDifference: 15.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.1s, HoareTripleCheckerStatistics: 663 SDtfs, 4404 SDslu, 350 SDs, 0 SdLazy, 9290 SolverSat, 1798 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1267 GetRequests, 1170 SyntacticMatches, 4 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2434occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 1401 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 153 PreInvPairs, 261 NumberOfFragments, 296 HoareAnnotationTreeSize, 153 FomulaSimplifications, 58079 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 7 FomulaSimplificationsInter, 5205 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 2604 NumberOfCodeBlocks, 2604 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2591 ConstructedInterpolants, 0 QuantifiedInterpolants, 1391696 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1962 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 13 InterpolantComputations, 6 PerfectInterpolantSequences, 1486/1502 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...