/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/Problem01_label56.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-86f66a4 [2020-07-07 13:32:54,651 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 13:32:54,653 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 13:32:54,665 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 13:32:54,665 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 13:32:54,666 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 13:32:54,667 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 13:32:54,669 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 13:32:54,671 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 13:32:54,672 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 13:32:54,673 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 13:32:54,674 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 13:32:54,674 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 13:32:54,675 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 13:32:54,676 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 13:32:54,677 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 13:32:54,678 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 13:32:54,678 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 13:32:54,680 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 13:32:54,682 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 13:32:54,683 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 13:32:54,684 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 13:32:54,685 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 13:32:54,686 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 13:32:54,692 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 13:32:54,692 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 13:32:54,693 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 13:32:54,694 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 13:32:54,694 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 13:32:54,695 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 13:32:54,695 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 13:32:54,697 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 13:32:54,698 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 13:32:54,700 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 13:32:54,700 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 13:32:54,701 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 13:32:54,704 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 13:32:54,705 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 13:32:54,705 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 13:32:54,706 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 13:32:54,706 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 13:32:54,707 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:32:54,723 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 13:32:54,723 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 13:32:54,725 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 13:32:54,725 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 13:32:54,725 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 13:32:54,725 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 13:32:54,725 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 13:32:54,725 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 13:32:54,726 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 13:32:54,726 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 13:32:54,727 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 13:32:54,727 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 13:32:54,727 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 13:32:54,727 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 13:32:54,728 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 13:32:54,728 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-07 13:32:54,728 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 13:32:54,728 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 13:32:54,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 13:32:54,729 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 13:32:54,729 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-07 13:32:54,729 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 13:32:54,730 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-07 13:32:55,009 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 13:32:55,021 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 13:32:55,025 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 13:32:55,026 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 13:32:55,026 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 13:32:55,027 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label56.c [2020-07-07 13:32:55,085 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c86bdc9d6/a6377769f9df48379b0462b15dbc1f2a/FLAGa6c133f14 [2020-07-07 13:32:55,610 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 13:32:55,610 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label56.c [2020-07-07 13:32:55,631 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c86bdc9d6/a6377769f9df48379b0462b15dbc1f2a/FLAGa6c133f14 [2020-07-07 13:32:55,926 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c86bdc9d6/a6377769f9df48379b0462b15dbc1f2a [2020-07-07 13:32:55,936 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 13:32:55,939 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 13:32:55,941 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 13:32:55,941 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 13:32:55,945 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 13:32:55,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:32:55" (1/1) ... [2020-07-07 13:32:55,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@430027b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:32:55, skipping insertion in model container [2020-07-07 13:32:55,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:32:55" (1/1) ... [2020-07-07 13:32:55,957 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 13:32:56,016 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 13:32:56,613 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:32:56,617 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 13:32:56,730 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:32:56,762 INFO L208 MainTranslator]: Completed translation [2020-07-07 13:32:56,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:32:56 WrapperNode [2020-07-07 13:32:56,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 13:32:56,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 13:32:56,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 13:32:56,764 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 13:32:56,795 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:32:56" (1/1) ... [2020-07-07 13:32:56,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:32:56" (1/1) ... [2020-07-07 13:32:56,839 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:32:56" (1/1) ... [2020-07-07 13:32:56,840 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:32:56" (1/1) ... [2020-07-07 13:32:56,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:32:56" (1/1) ... [2020-07-07 13:32:56,934 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:32:56" (1/1) ... [2020-07-07 13:32:56,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:32:56" (1/1) ... [2020-07-07 13:32:56,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 13:32:56,960 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 13:32:56,963 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 13:32:56,963 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 13:32:56,964 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:32:56" (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:32:57,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 13:32:57,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 13:32:57,024 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-07-07 13:32:57,024 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 13:32:57,025 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-07-07 13:32:57,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 13:32:57,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-07 13:32:57,025 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-07 13:32:57,025 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 13:32:57,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 13:32:57,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 13:32:58,275 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 13:32:58,275 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-07 13:32:58,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:32:58 BoogieIcfgContainer [2020-07-07 13:32:58,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 13:32:58,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 13:32:58,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 13:32:58,288 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 13:32:58,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 01:32:55" (1/3) ... [2020-07-07 13:32:58,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d8efc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:32:58, skipping insertion in model container [2020-07-07 13:32:58,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:32:56" (2/3) ... [2020-07-07 13:32:58,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d8efc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:32:58, skipping insertion in model container [2020-07-07 13:32:58,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:32:58" (3/3) ... [2020-07-07 13:32:58,291 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label56.c [2020-07-07 13:32:58,302 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-07 13:32:58,310 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-07 13:32:58,324 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-07 13:32:58,345 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 13:32:58,345 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 13:32:58,345 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-07 13:32:58,345 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 13:32:58,346 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 13:32:58,346 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 13:32:58,346 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 13:32:58,346 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 13:32:58,369 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states. [2020-07-07 13:32:58,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-07-07 13:32:58,402 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:32:58,404 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] [2020-07-07 13:32:58,404 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:32:58,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:32:58,412 INFO L82 PathProgramCache]: Analyzing trace with hash 602782831, now seen corresponding path program 1 times [2020-07-07 13:32:58,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:32:58,421 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [843004001] [2020-07-07 13:32:58,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:32:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:32:59,024 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:32:59,024 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:32:59,026 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [843004001] [2020-07-07 13:32:59,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:32:59,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 13:32:59,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714289626] [2020-07-07 13:32:59,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 13:32:59,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:32:59,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 13:32:59,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-07 13:32:59,058 INFO L87 Difference]: Start difference. First operand 525 states. Second operand 5 states. [2020-07-07 13:33:01,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:33:01,182 INFO L93 Difference]: Finished difference Result 1259 states and 1658 transitions. [2020-07-07 13:33:01,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 13:33:01,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2020-07-07 13:33:01,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:33:01,205 INFO L225 Difference]: With dead ends: 1259 [2020-07-07 13:33:01,205 INFO L226 Difference]: Without dead ends: 685 [2020-07-07 13:33:01,215 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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:33:01,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2020-07-07 13:33:01,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 603. [2020-07-07 13:33:01,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2020-07-07 13:33:01,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 725 transitions. [2020-07-07 13:33:01,382 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 725 transitions. Word has length 104 [2020-07-07 13:33:01,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:33:01,384 INFO L479 AbstractCegarLoop]: Abstraction has 603 states and 725 transitions. [2020-07-07 13:33:01,384 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 13:33:01,384 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 725 transitions. [2020-07-07 13:33:01,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-07-07 13:33:01,394 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:33:01,395 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:33:01,395 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 13:33:01,396 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:33:01,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:33:01,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1195739072, now seen corresponding path program 1 times [2020-07-07 13:33:01,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:33:01,398 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1331129952] [2020-07-07 13:33:01,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:33:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:01,727 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:33:01,727 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:33:01,728 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1331129952] [2020-07-07 13:33:01,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:33:01,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 13:33:01,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911177129] [2020-07-07 13:33:01,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 13:33:01,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:33:01,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 13:33:01,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-07 13:33:01,731 INFO L87 Difference]: Start difference. First operand 603 states and 725 transitions. Second operand 9 states. [2020-07-07 13:33:03,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:33:03,989 INFO L93 Difference]: Finished difference Result 1436 states and 1760 transitions. [2020-07-07 13:33:03,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-07 13:33:03,990 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 125 [2020-07-07 13:33:03,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:33:03,997 INFO L225 Difference]: With dead ends: 1436 [2020-07-07 13:33:03,998 INFO L226 Difference]: Without dead ends: 857 [2020-07-07 13:33:04,002 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-07-07 13:33:04,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2020-07-07 13:33:04,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 748. [2020-07-07 13:33:04,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2020-07-07 13:33:04,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 916 transitions. [2020-07-07 13:33:04,136 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 916 transitions. Word has length 125 [2020-07-07 13:33:04,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:33:04,137 INFO L479 AbstractCegarLoop]: Abstraction has 748 states and 916 transitions. [2020-07-07 13:33:04,137 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 13:33:04,137 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 916 transitions. [2020-07-07 13:33:04,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-07-07 13:33:04,141 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:33:04,141 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:33:04,141 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 13:33:04,142 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:33:04,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:33:04,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1473965250, now seen corresponding path program 1 times [2020-07-07 13:33:04,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:33:04,143 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [599872574] [2020-07-07 13:33:04,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:33:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:04,346 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:33:04,347 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:33:04,347 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [599872574] [2020-07-07 13:33:04,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:33:04,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 13:33:04,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360185507] [2020-07-07 13:33:04,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 13:33:04,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:33:04,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 13:33:04,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-07 13:33:04,351 INFO L87 Difference]: Start difference. First operand 748 states and 916 transitions. Second operand 5 states. [2020-07-07 13:33:06,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:33:06,108 INFO L93 Difference]: Finished difference Result 1996 states and 2545 transitions. [2020-07-07 13:33:06,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-07 13:33:06,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2020-07-07 13:33:06,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:33:06,125 INFO L225 Difference]: With dead ends: 1996 [2020-07-07 13:33:06,128 INFO L226 Difference]: Without dead ends: 1272 [2020-07-07 13:33:06,132 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:33:06,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2020-07-07 13:33:06,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1181. [2020-07-07 13:33:06,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1181 states. [2020-07-07 13:33:06,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1509 transitions. [2020-07-07 13:33:06,332 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1509 transitions. Word has length 125 [2020-07-07 13:33:06,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:33:06,332 INFO L479 AbstractCegarLoop]: Abstraction has 1181 states and 1509 transitions. [2020-07-07 13:33:06,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 13:33:06,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1509 transitions. [2020-07-07 13:33:06,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-07-07 13:33:06,338 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:33:06,338 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:33:06,339 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-07 13:33:06,339 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:33:06,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:33:06,339 INFO L82 PathProgramCache]: Analyzing trace with hash 305762680, now seen corresponding path program 1 times [2020-07-07 13:33:06,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:33:06,340 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1111590912] [2020-07-07 13:33:06,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:33:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:06,512 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:33:06,513 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:33:06,513 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1111590912] [2020-07-07 13:33:06,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:33:06,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 13:33:06,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760333526] [2020-07-07 13:33:06,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 13:33:06,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:33:06,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 13:33:06,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-07 13:33:06,515 INFO L87 Difference]: Start difference. First operand 1181 states and 1509 transitions. Second operand 5 states. [2020-07-07 13:33:08,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:33:08,383 INFO L93 Difference]: Finished difference Result 3254 states and 4359 transitions. [2020-07-07 13:33:08,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-07 13:33:08,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2020-07-07 13:33:08,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:33:08,398 INFO L225 Difference]: With dead ends: 3254 [2020-07-07 13:33:08,399 INFO L226 Difference]: Without dead ends: 2097 [2020-07-07 13:33:08,404 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-07 13:33:08,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2097 states. [2020-07-07 13:33:08,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2097 to 1469. [2020-07-07 13:33:08,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2020-07-07 13:33:08,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 1907 transitions. [2020-07-07 13:33:08,574 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 1907 transitions. Word has length 134 [2020-07-07 13:33:08,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:33:08,574 INFO L479 AbstractCegarLoop]: Abstraction has 1469 states and 1907 transitions. [2020-07-07 13:33:08,575 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 13:33:08,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 1907 transitions. [2020-07-07 13:33:08,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-07-07 13:33:08,581 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:33:08,581 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:08,581 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-07 13:33:08,582 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:33:08,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:33:08,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1060590272, now seen corresponding path program 1 times [2020-07-07 13:33:08,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:33:08,583 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [439488263] [2020-07-07 13:33:08,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:33:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:08,803 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:33:08,803 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:33:08,804 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [439488263] [2020-07-07 13:33:08,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:33:08,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 13:33:08,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797105364] [2020-07-07 13:33:08,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 13:33:08,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:33:08,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 13:33:08,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-07 13:33:08,807 INFO L87 Difference]: Start difference. First operand 1469 states and 1907 transitions. Second operand 9 states. [2020-07-07 13:33:11,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:33:11,337 INFO L93 Difference]: Finished difference Result 4185 states and 5853 transitions. [2020-07-07 13:33:11,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-07 13:33:11,338 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 141 [2020-07-07 13:33:11,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:33:11,360 INFO L225 Difference]: With dead ends: 4185 [2020-07-07 13:33:11,360 INFO L226 Difference]: Without dead ends: 2740 [2020-07-07 13:33:11,370 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2020-07-07 13:33:11,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2740 states. [2020-07-07 13:33:11,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2740 to 2341. [2020-07-07 13:33:11,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2341 states. [2020-07-07 13:33:11,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2341 states to 2341 states and 2994 transitions. [2020-07-07 13:33:11,718 INFO L78 Accepts]: Start accepts. Automaton has 2341 states and 2994 transitions. Word has length 141 [2020-07-07 13:33:11,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:33:11,719 INFO L479 AbstractCegarLoop]: Abstraction has 2341 states and 2994 transitions. [2020-07-07 13:33:11,719 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 13:33:11,719 INFO L276 IsEmpty]: Start isEmpty. Operand 2341 states and 2994 transitions. [2020-07-07 13:33:11,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2020-07-07 13:33:11,728 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:33:11,729 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:11,729 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-07 13:33:11,729 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:33:11,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:33:11,729 INFO L82 PathProgramCache]: Analyzing trace with hash -588171755, now seen corresponding path program 1 times [2020-07-07 13:33:11,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:33:11,730 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2079956111] [2020-07-07 13:33:11,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:33:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:11,947 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:33:11,947 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:33:11,947 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2079956111] [2020-07-07 13:33:11,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:33:11,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-07 13:33:11,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704766676] [2020-07-07 13:33:11,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-07 13:33:11,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:33:11,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-07 13:33:11,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-07-07 13:33:11,949 INFO L87 Difference]: Start difference. First operand 2341 states and 2994 transitions. Second operand 8 states. [2020-07-07 13:33:15,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:33:15,062 INFO L93 Difference]: Finished difference Result 5903 states and 7923 transitions. [2020-07-07 13:33:15,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-07 13:33:15,062 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 181 [2020-07-07 13:33:15,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:33:15,089 INFO L225 Difference]: With dead ends: 5903 [2020-07-07 13:33:15,089 INFO L226 Difference]: Without dead ends: 3586 [2020-07-07 13:33:15,100 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2020-07-07 13:33:15,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3586 states. [2020-07-07 13:33:15,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3586 to 3225. [2020-07-07 13:33:15,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3225 states. [2020-07-07 13:33:15,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3225 states to 3225 states and 4116 transitions. [2020-07-07 13:33:15,488 INFO L78 Accepts]: Start accepts. Automaton has 3225 states and 4116 transitions. Word has length 181 [2020-07-07 13:33:15,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:33:15,489 INFO L479 AbstractCegarLoop]: Abstraction has 3225 states and 4116 transitions. [2020-07-07 13:33:15,490 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-07 13:33:15,490 INFO L276 IsEmpty]: Start isEmpty. Operand 3225 states and 4116 transitions. [2020-07-07 13:33:15,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-07-07 13:33:15,509 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:33:15,509 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:33:15,509 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-07 13:33:15,510 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:33:15,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:33:15,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1738067261, now seen corresponding path program 1 times [2020-07-07 13:33:15,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:33:15,511 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1834370010] [2020-07-07 13:33:15,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:33:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:15,802 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:33:15,802 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:33:15,803 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1834370010] [2020-07-07 13:33:15,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:33:15,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-07 13:33:15,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74283678] [2020-07-07 13:33:15,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-07 13:33:15,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:33:15,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-07 13:33:15,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-07 13:33:15,805 INFO L87 Difference]: Start difference. First operand 3225 states and 4116 transitions. Second operand 8 states. [2020-07-07 13:33:18,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:33:18,080 INFO L93 Difference]: Finished difference Result 7224 states and 9589 transitions. [2020-07-07 13:33:18,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-07 13:33:18,080 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 182 [2020-07-07 13:33:18,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:33:18,116 INFO L225 Difference]: With dead ends: 7224 [2020-07-07 13:33:18,116 INFO L226 Difference]: Without dead ends: 4023 [2020-07-07 13:33:18,135 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-07-07 13:33:18,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4023 states. [2020-07-07 13:33:18,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4023 to 3132. [2020-07-07 13:33:18,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-07-07 13:33:18,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 3915 transitions. [2020-07-07 13:33:18,615 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 3915 transitions. Word has length 182 [2020-07-07 13:33:18,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:33:18,615 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 3915 transitions. [2020-07-07 13:33:18,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-07 13:33:18,616 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 3915 transitions. [2020-07-07 13:33:18,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2020-07-07 13:33:18,630 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:33:18,630 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:18,630 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-07 13:33:18,631 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:33:18,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:33:18,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1707194346, now seen corresponding path program 1 times [2020-07-07 13:33:18,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:33:18,632 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [67306362] [2020-07-07 13:33:18,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:33:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:18,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:18,931 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:33:18,932 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:33:18,932 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [67306362] [2020-07-07 13:33:18,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:33:18,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-07 13:33:18,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144583836] [2020-07-07 13:33:18,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-07 13:33:18,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:33:18,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-07 13:33:18,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-07-07 13:33:18,934 INFO L87 Difference]: Start difference. First operand 3132 states and 3915 transitions. Second operand 11 states. [2020-07-07 13:33:22,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:33:22,820 INFO L93 Difference]: Finished difference Result 7680 states and 9704 transitions. [2020-07-07 13:33:22,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-07 13:33:22,820 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 188 [2020-07-07 13:33:22,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:33:22,854 INFO L225 Difference]: With dead ends: 7680 [2020-07-07 13:33:22,854 INFO L226 Difference]: Without dead ends: 4572 [2020-07-07 13:33:22,868 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2020-07-07 13:33:22,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4572 states. [2020-07-07 13:33:23,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4572 to 3901. [2020-07-07 13:33:23,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3901 states. [2020-07-07 13:33:23,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3901 states to 3901 states and 4912 transitions. [2020-07-07 13:33:23,687 INFO L78 Accepts]: Start accepts. Automaton has 3901 states and 4912 transitions. Word has length 188 [2020-07-07 13:33:23,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:33:23,687 INFO L479 AbstractCegarLoop]: Abstraction has 3901 states and 4912 transitions. [2020-07-07 13:33:23,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-07 13:33:23,688 INFO L276 IsEmpty]: Start isEmpty. Operand 3901 states and 4912 transitions. [2020-07-07 13:33:23,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2020-07-07 13:33:23,702 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:33:23,703 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:23,703 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-07 13:33:23,703 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:33:23,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:33:23,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1102012595, now seen corresponding path program 1 times [2020-07-07 13:33:23,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:33:23,704 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2006774700] [2020-07-07 13:33:23,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:33:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:23,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:23,988 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:33:23,988 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:33:23,988 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2006774700] [2020-07-07 13:33:23,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:33:23,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-07 13:33:23,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269986701] [2020-07-07 13:33:23,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-07 13:33:23,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:33:23,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-07 13:33:23,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-07 13:33:23,990 INFO L87 Difference]: Start difference. First operand 3901 states and 4912 transitions. Second operand 8 states. [2020-07-07 13:33:26,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:33:26,617 INFO L93 Difference]: Finished difference Result 9017 states and 12077 transitions. [2020-07-07 13:33:26,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-07 13:33:26,618 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 205 [2020-07-07 13:33:26,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:33:26,662 INFO L225 Difference]: With dead ends: 9017 [2020-07-07 13:33:26,662 INFO L226 Difference]: Without dead ends: 5140 [2020-07-07 13:33:26,680 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2020-07-07 13:33:26,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5140 states. [2020-07-07 13:33:27,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5140 to 4557. [2020-07-07 13:33:27,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4557 states. [2020-07-07 13:33:27,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4557 states to 4557 states and 5687 transitions. [2020-07-07 13:33:27,372 INFO L78 Accepts]: Start accepts. Automaton has 4557 states and 5687 transitions. Word has length 205 [2020-07-07 13:33:27,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:33:27,373 INFO L479 AbstractCegarLoop]: Abstraction has 4557 states and 5687 transitions. [2020-07-07 13:33:27,375 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-07 13:33:27,375 INFO L276 IsEmpty]: Start isEmpty. Operand 4557 states and 5687 transitions. [2020-07-07 13:33:27,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2020-07-07 13:33:27,390 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:33:27,390 INFO L422 BasicCegarLoop]: trace histogram [4, 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, 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] [2020-07-07 13:33:27,391 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-07 13:33:27,391 INFO L427 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:33:27,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:33:27,391 INFO L82 PathProgramCache]: Analyzing trace with hash 665908200, now seen corresponding path program 1 times [2020-07-07 13:33:27,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:33:27,392 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [372070344] [2020-07-07 13:33:27,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:33:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:27,795 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:33:27,795 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:33:27,795 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [372070344] [2020-07-07 13:33:27,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:33:27,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 13:33:27,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102313302] [2020-07-07 13:33:27,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 13:33:27,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:33:27,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 13:33:27,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-07 13:33:27,797 INFO L87 Difference]: Start difference. First operand 4557 states and 5687 transitions. Second operand 9 states. [2020-07-07 13:33:30,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:33:30,835 INFO L93 Difference]: Finished difference Result 10214 states and 13804 transitions. [2020-07-07 13:33:30,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-07 13:33:30,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 231 [2020-07-07 13:33:30,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:33:30,889 INFO L225 Difference]: With dead ends: 10214 [2020-07-07 13:33:30,889 INFO L226 Difference]: Without dead ends: 5681 [2020-07-07 13:33:30,910 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2020-07-07 13:33:30,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5681 states. [2020-07-07 13:33:31,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5681 to 4563. [2020-07-07 13:33:31,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4563 states. [2020-07-07 13:33:31,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4563 states to 4563 states and 5647 transitions. [2020-07-07 13:33:31,715 INFO L78 Accepts]: Start accepts. Automaton has 4563 states and 5647 transitions. Word has length 231 [2020-07-07 13:33:31,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:33:31,716 INFO L479 AbstractCegarLoop]: Abstraction has 4563 states and 5647 transitions. [2020-07-07 13:33:31,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 13:33:31,716 INFO L276 IsEmpty]: Start isEmpty. Operand 4563 states and 5647 transitions. [2020-07-07 13:33:31,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-07-07 13:33:31,725 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:33:31,725 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:31,726 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-07 13:33:31,726 INFO L427 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:33:31,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:33:31,726 INFO L82 PathProgramCache]: Analyzing trace with hash -364180700, now seen corresponding path program 1 times [2020-07-07 13:33:31,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:33:31,727 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [848619966] [2020-07-07 13:33:31,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:33:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:32,033 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:33:32,033 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:33:32,033 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [848619966] [2020-07-07 13:33:32,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:33:32,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 13:33:32,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169913736] [2020-07-07 13:33:32,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 13:33:32,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:33:32,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 13:33:32,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-07 13:33:32,035 INFO L87 Difference]: Start difference. First operand 4563 states and 5647 transitions. Second operand 9 states. [2020-07-07 13:33:35,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:33:35,039 INFO L93 Difference]: Finished difference Result 9675 states and 11957 transitions. [2020-07-07 13:33:35,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-07 13:33:35,040 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 234 [2020-07-07 13:33:35,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:33:35,061 INFO L225 Difference]: With dead ends: 9675 [2020-07-07 13:33:35,062 INFO L226 Difference]: Without dead ends: 5136 [2020-07-07 13:33:35,075 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2020-07-07 13:33:35,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5136 states. [2020-07-07 13:33:35,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5136 to 4923. [2020-07-07 13:33:35,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4923 states. [2020-07-07 13:33:35,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4923 states to 4923 states and 6029 transitions. [2020-07-07 13:33:35,740 INFO L78 Accepts]: Start accepts. Automaton has 4923 states and 6029 transitions. Word has length 234 [2020-07-07 13:33:35,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:33:35,740 INFO L479 AbstractCegarLoop]: Abstraction has 4923 states and 6029 transitions. [2020-07-07 13:33:35,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 13:33:35,740 INFO L276 IsEmpty]: Start isEmpty. Operand 4923 states and 6029 transitions. [2020-07-07 13:33:35,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2020-07-07 13:33:35,753 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:33:35,754 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 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] [2020-07-07 13:33:35,754 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-07 13:33:35,754 INFO L427 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:33:35,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:33:35,754 INFO L82 PathProgramCache]: Analyzing trace with hash -242986148, now seen corresponding path program 1 times [2020-07-07 13:33:35,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:33:35,755 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [879057106] [2020-07-07 13:33:35,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:33:35,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:36,141 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:33:36,142 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:33:36,142 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [879057106] [2020-07-07 13:33:36,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:33:36,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-07 13:33:36,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793049860] [2020-07-07 13:33:36,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-07 13:33:36,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:33:36,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-07 13:33:36,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-07 13:33:36,144 INFO L87 Difference]: Start difference. First operand 4923 states and 6029 transitions. Second operand 6 states. [2020-07-07 13:33:38,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:33:38,588 INFO L93 Difference]: Finished difference Result 10582 states and 12956 transitions. [2020-07-07 13:33:38,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-07 13:33:38,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 246 [2020-07-07 13:33:38,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:33:38,622 INFO L225 Difference]: With dead ends: 10582 [2020-07-07 13:33:38,622 INFO L226 Difference]: Without dead ends: 4734 [2020-07-07 13:33:38,643 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-07 13:33:38,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4734 states. [2020-07-07 13:33:39,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4734 to 4123. [2020-07-07 13:33:39,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4123 states. [2020-07-07 13:33:39,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4123 states to 4123 states and 4748 transitions. [2020-07-07 13:33:39,941 INFO L78 Accepts]: Start accepts. Automaton has 4123 states and 4748 transitions. Word has length 246 [2020-07-07 13:33:39,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:33:39,944 INFO L479 AbstractCegarLoop]: Abstraction has 4123 states and 4748 transitions. [2020-07-07 13:33:39,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-07 13:33:39,944 INFO L276 IsEmpty]: Start isEmpty. Operand 4123 states and 4748 transitions. [2020-07-07 13:33:39,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2020-07-07 13:33:39,950 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:33:39,950 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-07 13:33:39,950 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-07 13:33:39,951 INFO L427 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:33:39,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:33:39,951 INFO L82 PathProgramCache]: Analyzing trace with hash 282276413, now seen corresponding path program 1 times [2020-07-07 13:33:39,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:33:39,951 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1609384454] [2020-07-07 13:33:39,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:33:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:40,240 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:33:40,241 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:33:40,241 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1609384454] [2020-07-07 13:33:40,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:33:40,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 13:33:40,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067993026] [2020-07-07 13:33:40,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 13:33:40,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:33:40,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 13:33:40,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-07 13:33:40,243 INFO L87 Difference]: Start difference. First operand 4123 states and 4748 transitions. Second operand 9 states. [2020-07-07 13:33:43,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:33:43,192 INFO L93 Difference]: Finished difference Result 9250 states and 11214 transitions. [2020-07-07 13:33:43,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-07 13:33:43,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 256 [2020-07-07 13:33:43,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:33:43,220 INFO L225 Difference]: With dead ends: 9250 [2020-07-07 13:33:43,220 INFO L226 Difference]: Without dead ends: 5292 [2020-07-07 13:33:43,233 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2020-07-07 13:33:43,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5292 states. [2020-07-07 13:33:43,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5292 to 4588. [2020-07-07 13:33:43,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4588 states. [2020-07-07 13:33:43,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4588 states to 4588 states and 5176 transitions. [2020-07-07 13:33:43,950 INFO L78 Accepts]: Start accepts. Automaton has 4588 states and 5176 transitions. Word has length 256 [2020-07-07 13:33:43,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:33:43,950 INFO L479 AbstractCegarLoop]: Abstraction has 4588 states and 5176 transitions. [2020-07-07 13:33:43,951 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 13:33:43,951 INFO L276 IsEmpty]: Start isEmpty. Operand 4588 states and 5176 transitions. [2020-07-07 13:33:43,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2020-07-07 13:33:43,957 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:33:43,958 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:43,958 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-07 13:33:43,958 INFO L427 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:33:43,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:33:43,958 INFO L82 PathProgramCache]: Analyzing trace with hash -378942512, now seen corresponding path program 1 times [2020-07-07 13:33:43,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:33:43,959 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1914585525] [2020-07-07 13:33:43,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:33:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:44,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:33:44,329 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:33:44,330 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:33:44,330 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1914585525] [2020-07-07 13:33:44,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:33:44,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 13:33:44,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873402631] [2020-07-07 13:33:44,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 13:33:44,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:33:44,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 13:33:44,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-07 13:33:44,333 INFO L87 Difference]: Start difference. First operand 4588 states and 5176 transitions. Second operand 9 states. [2020-07-07 13:33:47,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:33:47,481 INFO L93 Difference]: Finished difference Result 9499 states and 10815 transitions. [2020-07-07 13:33:47,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-07 13:33:47,482 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 263 [2020-07-07 13:33:47,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:33:47,499 INFO L225 Difference]: With dead ends: 9499 [2020-07-07 13:33:47,500 INFO L226 Difference]: Without dead ends: 5076 [2020-07-07 13:33:47,511 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2020-07-07 13:33:47,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5076 states. [2020-07-07 13:33:48,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5076 to 3628. [2020-07-07 13:33:48,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3628 states. [2020-07-07 13:33:48,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3628 states to 3628 states and 3923 transitions. [2020-07-07 13:33:48,194 INFO L78 Accepts]: Start accepts. Automaton has 3628 states and 3923 transitions. Word has length 263 [2020-07-07 13:33:48,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:33:48,195 INFO L479 AbstractCegarLoop]: Abstraction has 3628 states and 3923 transitions. [2020-07-07 13:33:48,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 13:33:48,195 INFO L276 IsEmpty]: Start isEmpty. Operand 3628 states and 3923 transitions. [2020-07-07 13:33:48,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2020-07-07 13:33:48,199 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:33:48,199 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:48,199 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-07 13:33:48,199 INFO L427 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:33:48,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:33:48,200 INFO L82 PathProgramCache]: Analyzing trace with hash -880486501, now seen corresponding path program 1 times [2020-07-07 13:33:48,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:33:48,200 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [514343934] [2020-07-07 13:33:48,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:33:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 13:33:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 13:33:48,485 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:33:48,486 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-07 13:33:48,486 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-07 13:33:48,488 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-07 13:33:48,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.07 01:33:48 BoogieIcfgContainer [2020-07-07 13:33:48,570 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-07 13:33:48,573 INFO L168 Benchmark]: Toolchain (without parser) took 52633.46 ms. Allocated memory was 144.7 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 100.7 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 496.1 MB. Max. memory is 7.1 GB. [2020-07-07 13:33:48,574 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-07 13:33:48,575 INFO L168 Benchmark]: CACSL2BoogieTranslator took 822.32 ms. Allocated memory was 144.7 MB in the beginning and 204.5 MB in the end (delta: 59.8 MB). Free memory was 100.5 MB in the beginning and 168.5 MB in the end (delta: -68.1 MB). Peak memory consumption was 30.7 MB. Max. memory is 7.1 GB. [2020-07-07 13:33:48,584 INFO L168 Benchmark]: Boogie Preprocessor took 196.03 ms. Allocated memory is still 204.5 MB. Free memory was 168.5 MB in the beginning and 163.6 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. [2020-07-07 13:33:48,588 INFO L168 Benchmark]: RCFGBuilder took 1323.26 ms. Allocated memory was 204.5 MB in the beginning and 237.0 MB in the end (delta: 32.5 MB). Free memory was 162.9 MB in the beginning and 156.0 MB in the end (delta: 6.9 MB). Peak memory consumption was 80.5 MB. Max. memory is 7.1 GB. [2020-07-07 13:33:48,592 INFO L168 Benchmark]: TraceAbstraction took 50285.40 ms. Allocated memory was 237.0 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 156.0 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 459.1 MB. Max. memory is 7.1 GB. [2020-07-07 13:33:48,596 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.26 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 822.32 ms. Allocated memory was 144.7 MB in the beginning and 204.5 MB in the end (delta: 59.8 MB). Free memory was 100.5 MB in the beginning and 168.5 MB in the end (delta: -68.1 MB). Peak memory consumption was 30.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 196.03 ms. Allocated memory is still 204.5 MB. Free memory was 168.5 MB in the beginning and 163.6 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1323.26 ms. Allocated memory was 204.5 MB in the beginning and 237.0 MB in the end (delta: 32.5 MB). Free memory was 162.9 MB in the beginning and 156.0 MB in the end (delta: 6.9 MB). Peak memory consumption was 80.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 50285.40 ms. Allocated memory was 237.0 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 156.0 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 459.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 404]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] return 21; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] return 21; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] return 26; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L73] a7 = 1 [L74] a17 = 1 [L75] a21 = 0 [L76] a20 = 1 [L77] a8 = 13 [L78] a16 = 5 [L79] return 26; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND TRUE ((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1))) [L224] a21 = 1 [L225] a8 = 14 [L226] a16 = 4 [L227] a20 = 0 [L228] a7 = 0 [L229] a17 = 0 [L230] return -1; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L403] COND TRUE ((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) [L404] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 525 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 50.1s, OverallIterations: 15, TraceHistogramMax: 6, AutomataDifference: 37.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5080 SDtfs, 19547 SDslu, 6673 SDs, 0 SdLazy, 19673 SolverSat, 2237 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 353 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4923occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 7909 StatesRemovedByMinimization, 14 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...