/usr/bin/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label50.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-86f66a4 [2020-07-07 13:40:36,570 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 13:40:36,573 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 13:40:36,584 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 13:40:36,585 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 13:40:36,586 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 13:40:36,587 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 13:40:36,589 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 13:40:36,590 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 13:40:36,591 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 13:40:36,592 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 13:40:36,593 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 13:40:36,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 13:40:36,594 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 13:40:36,595 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 13:40:36,596 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 13:40:36,597 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 13:40:36,598 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 13:40:36,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 13:40:36,601 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 13:40:36,603 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 13:40:36,605 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 13:40:36,606 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 13:40:36,607 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 13:40:36,610 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 13:40:36,611 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 13:40:36,611 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 13:40:36,612 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 13:40:36,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 13:40:36,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 13:40:36,614 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 13:40:36,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 13:40:36,617 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 13:40:36,617 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 13:40:36,620 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 13:40:36,620 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 13:40:36,620 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 13:40:36,621 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 13:40:36,621 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 13:40:36,623 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 13:40:36,625 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 13:40:36,626 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-07 13:40:36,636 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 13:40:36,637 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 13:40:36,638 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 13:40:36,638 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 13:40:36,639 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 13:40:36,639 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 13:40:36,639 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 13:40:36,639 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 13:40:36,639 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 13:40:36,639 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 13:40:36,640 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 13:40:36,641 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 13:40:36,641 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 13:40:36,641 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 13:40:36,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 13:40:36,642 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-07 13:40:36,642 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 13:40:36,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 13:40:36,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 13:40:36,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 13:40:36,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-07 13:40:36,643 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 13:40:36,643 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-07 13:40:36,932 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 13:40:36,945 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 13:40:36,948 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 13:40:36,950 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 13:40:36,950 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 13:40:36,951 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label50.c [2020-07-07 13:40:37,011 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9c8d31c2/3f68750f77a844e2a90140344567028f/FLAG9c3f6a5f6 [2020-07-07 13:40:37,549 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 13:40:37,550 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label50.c [2020-07-07 13:40:37,562 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9c8d31c2/3f68750f77a844e2a90140344567028f/FLAG9c3f6a5f6 [2020-07-07 13:40:37,811 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9c8d31c2/3f68750f77a844e2a90140344567028f [2020-07-07 13:40:37,820 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 13:40:37,822 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 13:40:37,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 13:40:37,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 13:40:37,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 13:40:37,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:40:37" (1/1) ... [2020-07-07 13:40:37,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@128c5c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:40:37, skipping insertion in model container [2020-07-07 13:40:37,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:40:37" (1/1) ... [2020-07-07 13:40:37,838 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 13:40:37,893 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 13:40:38,334 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:40:38,339 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 13:40:38,540 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:40:38,556 INFO L208 MainTranslator]: Completed translation [2020-07-07 13:40:38,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:40:38 WrapperNode [2020-07-07 13:40:38,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 13:40:38,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 13:40:38,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 13:40:38,558 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 13:40:38,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:40:38" (1/1) ... [2020-07-07 13:40:38,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:40:38" (1/1) ... [2020-07-07 13:40:38,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:40:38" (1/1) ... [2020-07-07 13:40:38,587 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:40:38" (1/1) ... [2020-07-07 13:40:38,629 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:40:38" (1/1) ... [2020-07-07 13:40:38,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:40:38" (1/1) ... [2020-07-07 13:40:38,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:40:38" (1/1) ... [2020-07-07 13:40:38,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 13:40:38,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 13:40:38,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 13:40:38,673 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 13:40:38,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:40:38" (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 [2020-07-07 13:40:38,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 13:40:38,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 13:40:38,726 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-07-07 13:40:38,726 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 13:40:38,727 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-07-07 13:40:38,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 13:40:38,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-07 13:40:38,727 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-07 13:40:38,727 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 13:40:38,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 13:40:38,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 13:40:39,963 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 13:40:39,963 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-07 13:40:39,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:40:39 BoogieIcfgContainer [2020-07-07 13:40:39,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 13:40:39,973 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 13:40:39,973 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 13:40:39,976 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 13:40:39,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 01:40:37" (1/3) ... [2020-07-07 13:40:39,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d06ca7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:40:39, skipping insertion in model container [2020-07-07 13:40:39,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:40:38" (2/3) ... [2020-07-07 13:40:39,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d06ca7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:40:39, skipping insertion in model container [2020-07-07 13:40:39,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:40:39" (3/3) ... [2020-07-07 13:40:39,980 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label50.c [2020-07-07 13:40:39,990 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-07 13:40:39,998 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-07 13:40:40,011 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-07 13:40:40,033 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 13:40:40,033 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 13:40:40,033 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-07 13:40:40,033 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 13:40:40,034 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 13:40:40,034 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 13:40:40,034 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 13:40:40,034 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 13:40:40,054 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states. [2020-07-07 13:40:40,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-07-07 13:40:40,075 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:40:40,076 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:40:40,076 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:40:40,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:40:40,083 INFO L82 PathProgramCache]: Analyzing trace with hash -593885342, now seen corresponding path program 1 times [2020-07-07 13:40:40,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:40:40,092 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [27962088] [2020-07-07 13:40:40,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:40:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:40:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:40:40,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:40:40,608 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:40:40,610 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [27962088] [2020-07-07 13:40:40,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:40:40,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 13:40:40,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478783710] [2020-07-07 13:40:40,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 13:40:40,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:40:40,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 13:40:40,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-07 13:40:40,636 INFO L87 Difference]: Start difference. First operand 527 states. Second operand 5 states. [2020-07-07 13:40:43,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:40:43,553 INFO L93 Difference]: Finished difference Result 1539 states and 2132 transitions. [2020-07-07 13:40:43,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-07 13:40:43,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2020-07-07 13:40:43,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:40:43,590 INFO L225 Difference]: With dead ends: 1539 [2020-07-07 13:40:43,591 INFO L226 Difference]: Without dead ends: 935 [2020-07-07 13:40:43,605 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-07 13:40:43,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2020-07-07 13:40:43,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 878. [2020-07-07 13:40:43,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2020-07-07 13:40:43,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1089 transitions. [2020-07-07 13:40:43,840 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1089 transitions. Word has length 107 [2020-07-07 13:40:43,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:40:43,841 INFO L479 AbstractCegarLoop]: Abstraction has 878 states and 1089 transitions. [2020-07-07 13:40:43,841 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 13:40:43,841 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1089 transitions. [2020-07-07 13:40:43,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-07-07 13:40:43,850 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:40:43,850 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2020-07-07 13:40:43,851 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 13:40:43,851 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:40:43,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:40:43,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1658093710, now seen corresponding path program 1 times [2020-07-07 13:40:43,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:40:43,852 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2111564985] [2020-07-07 13:40:43,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:40:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:40:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:40:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:40:44,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:40:44,103 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:40:44,103 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2111564985] [2020-07-07 13:40:44,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:40:44,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 13:40:44,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478877383] [2020-07-07 13:40:44,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 13:40:44,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:40:44,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 13:40:44,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-07 13:40:44,106 INFO L87 Difference]: Start difference. First operand 878 states and 1089 transitions. Second operand 5 states. [2020-07-07 13:40:45,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:40:45,856 INFO L93 Difference]: Finished difference Result 2199 states and 2857 transitions. [2020-07-07 13:40:45,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-07 13:40:45,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2020-07-07 13:40:45,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:40:45,872 INFO L225 Difference]: With dead ends: 2199 [2020-07-07 13:40:45,873 INFO L226 Difference]: Without dead ends: 1343 [2020-07-07 13:40:45,877 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-07 13:40:45,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2020-07-07 13:40:46,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1330. [2020-07-07 13:40:46,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2020-07-07 13:40:46,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1680 transitions. [2020-07-07 13:40:46,029 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1680 transitions. Word has length 125 [2020-07-07 13:40:46,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:40:46,030 INFO L479 AbstractCegarLoop]: Abstraction has 1330 states and 1680 transitions. [2020-07-07 13:40:46,030 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 13:40:46,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1680 transitions. [2020-07-07 13:40:46,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-07-07 13:40:46,036 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:40:46,037 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:40:46,037 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 13:40:46,037 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:40:46,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:40:46,038 INFO L82 PathProgramCache]: Analyzing trace with hash -125182521, now seen corresponding path program 1 times [2020-07-07 13:40:46,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:40:46,039 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1442604332] [2020-07-07 13:40:46,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:40:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:40:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:40:46,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:40:46,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:40:46,237 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:40:46,238 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1442604332] [2020-07-07 13:40:46,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:40:46,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 13:40:46,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278303841] [2020-07-07 13:40:46,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 13:40:46,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:40:46,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 13:40:46,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-07 13:40:46,240 INFO L87 Difference]: Start difference. First operand 1330 states and 1680 transitions. Second operand 9 states. [2020-07-07 13:40:49,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:40:49,494 INFO L93 Difference]: Finished difference Result 4875 states and 6618 transitions. [2020-07-07 13:40:49,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-07 13:40:49,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 141 [2020-07-07 13:40:49,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:40:49,531 INFO L225 Difference]: With dead ends: 4875 [2020-07-07 13:40:49,535 INFO L226 Difference]: Without dead ends: 3567 [2020-07-07 13:40:49,545 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2020-07-07 13:40:49,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3567 states. [2020-07-07 13:40:49,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3567 to 3238. [2020-07-07 13:40:49,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3238 states. [2020-07-07 13:40:49,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3238 states to 3238 states and 4258 transitions. [2020-07-07 13:40:49,972 INFO L78 Accepts]: Start accepts. Automaton has 3238 states and 4258 transitions. Word has length 141 [2020-07-07 13:40:49,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:40:49,972 INFO L479 AbstractCegarLoop]: Abstraction has 3238 states and 4258 transitions. [2020-07-07 13:40:49,972 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 13:40:49,973 INFO L276 IsEmpty]: Start isEmpty. Operand 3238 states and 4258 transitions. [2020-07-07 13:40:49,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-07-07 13:40:49,982 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:40:49,982 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:40:49,982 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-07 13:40:49,983 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:40:49,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:40:49,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1712229635, now seen corresponding path program 1 times [2020-07-07 13:40:49,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:40:49,984 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1571851900] [2020-07-07 13:40:49,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:40:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:40:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:40:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:40:50,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:40:50,213 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:40:50,213 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1571851900] [2020-07-07 13:40:50,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:40:50,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 13:40:50,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14063734] [2020-07-07 13:40:50,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 13:40:50,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:40:50,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 13:40:50,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-07 13:40:50,216 INFO L87 Difference]: Start difference. First operand 3238 states and 4258 transitions. Second operand 9 states. [2020-07-07 13:40:53,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:40:53,331 INFO L93 Difference]: Finished difference Result 9599 states and 13036 transitions. [2020-07-07 13:40:53,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-07 13:40:53,337 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 145 [2020-07-07 13:40:53,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:40:53,378 INFO L225 Difference]: With dead ends: 9599 [2020-07-07 13:40:53,379 INFO L226 Difference]: Without dead ends: 6383 [2020-07-07 13:40:53,396 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2020-07-07 13:40:53,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6383 states. [2020-07-07 13:40:54,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6383 to 6006. [2020-07-07 13:40:54,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6006 states. [2020-07-07 13:40:54,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6006 states to 6006 states and 7513 transitions. [2020-07-07 13:40:54,210 INFO L78 Accepts]: Start accepts. Automaton has 6006 states and 7513 transitions. Word has length 145 [2020-07-07 13:40:54,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:40:54,210 INFO L479 AbstractCegarLoop]: Abstraction has 6006 states and 7513 transitions. [2020-07-07 13:40:54,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 13:40:54,210 INFO L276 IsEmpty]: Start isEmpty. Operand 6006 states and 7513 transitions. [2020-07-07 13:40:54,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2020-07-07 13:40:54,226 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:40:54,226 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:40:54,226 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-07 13:40:54,227 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:40:54,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:40:54,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1198067493, now seen corresponding path program 1 times [2020-07-07 13:40:54,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:40:54,228 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1036626160] [2020-07-07 13:40:54,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:40:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:40:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:40:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:40:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:40:54,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:40:54,511 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:40:54,512 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1036626160] [2020-07-07 13:40:54,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:40:54,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-07 13:40:54,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99673678] [2020-07-07 13:40:54,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-07 13:40:54,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:40:54,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-07 13:40:54,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-07 13:40:54,515 INFO L87 Difference]: Start difference. First operand 6006 states and 7513 transitions. Second operand 7 states. [2020-07-07 13:40:54,761 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2020-07-07 13:40:57,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:40:57,787 INFO L93 Difference]: Finished difference Result 13111 states and 16463 transitions. [2020-07-07 13:40:57,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-07 13:40:57,787 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 163 [2020-07-07 13:40:57,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:40:57,825 INFO L225 Difference]: With dead ends: 13111 [2020-07-07 13:40:57,825 INFO L226 Difference]: Without dead ends: 5782 [2020-07-07 13:40:57,851 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-07-07 13:40:57,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5782 states. [2020-07-07 13:40:58,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5782 to 5429. [2020-07-07 13:40:58,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5429 states. [2020-07-07 13:40:58,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5429 states to 5429 states and 6056 transitions. [2020-07-07 13:40:58,456 INFO L78 Accepts]: Start accepts. Automaton has 5429 states and 6056 transitions. Word has length 163 [2020-07-07 13:40:58,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:40:58,457 INFO L479 AbstractCegarLoop]: Abstraction has 5429 states and 6056 transitions. [2020-07-07 13:40:58,457 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-07 13:40:58,457 INFO L276 IsEmpty]: Start isEmpty. Operand 5429 states and 6056 transitions. [2020-07-07 13:40:58,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2020-07-07 13:40:58,464 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:40:58,465 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:40:58,465 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-07 13:40:58,465 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:40:58,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:40:58,466 INFO L82 PathProgramCache]: Analyzing trace with hash -451289247, now seen corresponding path program 1 times [2020-07-07 13:40:58,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:40:58,466 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [386608137] [2020-07-07 13:40:58,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:40:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:40:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:40:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:40:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:40:58,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:40:58,653 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:40:58,653 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [386608137] [2020-07-07 13:40:58,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:40:58,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-07 13:40:58,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094113524] [2020-07-07 13:40:58,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-07 13:40:58,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:40:58,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-07 13:40:58,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-07 13:40:58,656 INFO L87 Difference]: Start difference. First operand 5429 states and 6056 transitions. Second operand 8 states. [2020-07-07 13:41:01,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:41:01,045 INFO L93 Difference]: Finished difference Result 10234 states and 11378 transitions. [2020-07-07 13:41:01,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-07 13:41:01,045 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 167 [2020-07-07 13:41:01,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:41:01,066 INFO L225 Difference]: With dead ends: 10234 [2020-07-07 13:41:01,066 INFO L226 Difference]: Without dead ends: 4475 [2020-07-07 13:41:01,084 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-07-07 13:41:01,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4475 states. [2020-07-07 13:41:01,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4475 to 4282. [2020-07-07 13:41:01,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4282 states. [2020-07-07 13:41:01,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4282 states to 4282 states and 4657 transitions. [2020-07-07 13:41:01,709 INFO L78 Accepts]: Start accepts. Automaton has 4282 states and 4657 transitions. Word has length 167 [2020-07-07 13:41:01,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:41:01,710 INFO L479 AbstractCegarLoop]: Abstraction has 4282 states and 4657 transitions. [2020-07-07 13:41:01,710 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-07 13:41:01,710 INFO L276 IsEmpty]: Start isEmpty. Operand 4282 states and 4657 transitions. [2020-07-07 13:41:01,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2020-07-07 13:41:01,720 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:41:01,720 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:41:01,720 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-07 13:41:01,721 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:41:01,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:41:01,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1538277878, now seen corresponding path program 1 times [2020-07-07 13:41:01,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:41:01,722 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1758797889] [2020-07-07 13:41:01,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:41:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:41:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:41:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:41:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:41:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:41:01,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:41:02,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:41:02,005 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:41:02,006 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1758797889] [2020-07-07 13:41:02,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:41:02,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 13:41:02,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759888366] [2020-07-07 13:41:02,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 13:41:02,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:41:02,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 13:41:02,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-07-07 13:41:02,008 INFO L87 Difference]: Start difference. First operand 4282 states and 4657 transitions. Second operand 10 states. [2020-07-07 13:41:03,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:41:03,932 INFO L93 Difference]: Finished difference Result 7865 states and 8694 transitions. [2020-07-07 13:41:03,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-07 13:41:03,932 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 241 [2020-07-07 13:41:03,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:41:03,951 INFO L225 Difference]: With dead ends: 7865 [2020-07-07 13:41:03,951 INFO L226 Difference]: Without dead ends: 3581 [2020-07-07 13:41:03,963 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2020-07-07 13:41:03,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3581 states. [2020-07-07 13:41:04,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3581 to 3175. [2020-07-07 13:41:04,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3175 states. [2020-07-07 13:41:04,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3175 states to 3175 states and 3376 transitions. [2020-07-07 13:41:04,467 INFO L78 Accepts]: Start accepts. Automaton has 3175 states and 3376 transitions. Word has length 241 [2020-07-07 13:41:04,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:41:04,467 INFO L479 AbstractCegarLoop]: Abstraction has 3175 states and 3376 transitions. [2020-07-07 13:41:04,467 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 13:41:04,467 INFO L276 IsEmpty]: Start isEmpty. Operand 3175 states and 3376 transitions. [2020-07-07 13:41:04,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2020-07-07 13:41:04,475 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:41:04,475 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:41:04,475 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-07 13:41:04,476 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:41:04,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:41:04,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1217921601, now seen corresponding path program 1 times [2020-07-07 13:41:04,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:41:04,477 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1845173835] [2020-07-07 13:41:04,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:41:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:41:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:41:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:41:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:41:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:41:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:41:04,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:41:04,806 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:41:04,806 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1845173835] [2020-07-07 13:41:04,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:41:04,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-07 13:41:04,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29171579] [2020-07-07 13:41:04,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-07 13:41:04,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:41:04,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-07 13:41:04,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-07 13:41:04,809 INFO L87 Difference]: Start difference. First operand 3175 states and 3376 transitions. Second operand 8 states. [2020-07-07 13:41:06,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:41:06,558 INFO L93 Difference]: Finished difference Result 4144 states and 4412 transitions. [2020-07-07 13:41:06,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-07 13:41:06,558 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 249 [2020-07-07 13:41:06,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:41:06,564 INFO L225 Difference]: With dead ends: 4144 [2020-07-07 13:41:06,564 INFO L226 Difference]: Without dead ends: 1624 [2020-07-07 13:41:06,569 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-07-07 13:41:06,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2020-07-07 13:41:06,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1622. [2020-07-07 13:41:06,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1622 states. [2020-07-07 13:41:06,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 1686 transitions. [2020-07-07 13:41:06,823 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 1686 transitions. Word has length 249 [2020-07-07 13:41:06,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:41:06,824 INFO L479 AbstractCegarLoop]: Abstraction has 1622 states and 1686 transitions. [2020-07-07 13:41:06,824 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-07 13:41:06,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 1686 transitions. [2020-07-07 13:41:06,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2020-07-07 13:41:06,833 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:41:06,833 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:41:06,833 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-07 13:41:06,834 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:41:06,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:41:06,834 INFO L82 PathProgramCache]: Analyzing trace with hash 407843693, now seen corresponding path program 1 times [2020-07-07 13:41:06,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:41:06,835 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1615146545] [2020-07-07 13:41:06,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:41:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 13:41:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 13:41:07,092 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:41:07,093 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-07 13:41:07,093 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-07 13:41:07,094 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-07 13:41:07,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.07 01:41:07 BoogieIcfgContainer [2020-07-07 13:41:07,135 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-07 13:41:07,137 INFO L168 Benchmark]: Toolchain (without parser) took 29315.04 ms. Allocated memory was 143.7 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 100.4 MB in the beginning and 522.1 MB in the end (delta: -421.7 MB). Peak memory consumption was 633.7 MB. Max. memory is 7.1 GB. [2020-07-07 13:41:07,137 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 143.7 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-07 13:41:07,138 INFO L168 Benchmark]: CACSL2BoogieTranslator took 734.18 ms. Allocated memory was 143.7 MB in the beginning and 203.9 MB in the end (delta: 60.3 MB). Free memory was 100.1 MB in the beginning and 171.0 MB in the end (delta: -70.9 MB). Peak memory consumption was 31.1 MB. Max. memory is 7.1 GB. [2020-07-07 13:41:07,139 INFO L168 Benchmark]: Boogie Preprocessor took 114.64 ms. Allocated memory is still 203.9 MB. Free memory was 171.0 MB in the beginning and 166.6 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 7.1 GB. [2020-07-07 13:41:07,140 INFO L168 Benchmark]: RCFGBuilder took 1299.72 ms. Allocated memory was 203.9 MB in the beginning and 233.8 MB in the end (delta: 29.9 MB). Free memory was 166.6 MB in the beginning and 161.7 MB in the end (delta: 4.9 MB). Peak memory consumption was 87.1 MB. Max. memory is 7.1 GB. [2020-07-07 13:41:07,141 INFO L168 Benchmark]: TraceAbstraction took 27161.83 ms. Allocated memory was 233.8 MB in the beginning and 1.2 GB in the end (delta: 965.2 MB). Free memory was 161.7 MB in the beginning and 522.1 MB in the end (delta: -360.4 MB). Peak memory consumption was 604.8 MB. Max. memory is 7.1 GB. [2020-07-07 13:41:07,144 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 143.7 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 734.18 ms. Allocated memory was 143.7 MB in the beginning and 203.9 MB in the end (delta: 60.3 MB). Free memory was 100.1 MB in the beginning and 171.0 MB in the end (delta: -70.9 MB). Peak memory consumption was 31.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 114.64 ms. Allocated memory is still 203.9 MB. Free memory was 171.0 MB in the beginning and 166.6 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1299.72 ms. Allocated memory was 203.9 MB in the beginning and 233.8 MB in the end (delta: 29.9 MB). Free memory was 166.6 MB in the beginning and 161.7 MB in the end (delta: 4.9 MB). Peak memory consumption was 87.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27161.83 ms. Allocated memory was 233.8 MB in the beginning and 1.2 GB in the end (delta: 965.2 MB). Free memory was 161.7 MB in the beginning and 522.1 MB in the end (delta: -360.4 MB). Peak memory consumption was 604.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 415]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) [L234] COND TRUE ((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))) [L235] a28 = 9 [L236] return 23; [L614] RET, EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) [L394] COND TRUE (((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)) [L395] a19 = 0 [L396] a28 = 7 [L397] return 25; [L614] RET, EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) [L54] COND TRUE ((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1)) [L55] a28 = 7 [L56] a11 = 1 [L57] a25 = 0 [L58] return -1; [L614] RET, EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L414] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8)) [L415] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 527 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 27.0s, OverallIterations: 9, TraceHistogramMax: 5, AutomataDifference: 20.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2337 SDtfs, 10603 SDslu, 2693 SDs, 0 SdLazy, 10869 SolverSat, 1125 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6006occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 1730 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...