/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 --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration false -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label50.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-177f698 [2020-08-21 13:21:20,538 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-21 13:21:20,541 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-21 13:21:20,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-21 13:21:20,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-21 13:21:20,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-21 13:21:20,591 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-21 13:21:20,597 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-21 13:21:20,603 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-21 13:21:20,604 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-21 13:21:20,606 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-21 13:21:20,609 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-21 13:21:20,609 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-21 13:21:20,612 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-21 13:21:20,613 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-21 13:21:20,617 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-21 13:21:20,618 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-21 13:21:20,620 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-21 13:21:20,622 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-21 13:21:20,628 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-21 13:21:20,631 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-21 13:21:20,632 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-21 13:21:20,634 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-21 13:21:20,635 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-21 13:21:20,637 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-21 13:21:20,637 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-21 13:21:20,637 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-21 13:21:20,638 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-21 13:21:20,639 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-21 13:21:20,639 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-21 13:21:20,640 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-21 13:21:20,640 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-21 13:21:20,641 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-21 13:21:20,642 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-21 13:21:20,643 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-21 13:21:20,643 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-21 13:21:20,644 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-21 13:21:20,644 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-21 13:21:20,644 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-21 13:21:20,645 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-21 13:21:20,646 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-21 13:21:20,647 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-21 13:21:20,669 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-21 13:21:20,670 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-21 13:21:20,671 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-21 13:21:20,671 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-21 13:21:20,672 INFO L138 SettingsManager]: * Use SBE=true [2020-08-21 13:21:20,672 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-21 13:21:20,672 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-21 13:21:20,672 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-21 13:21:20,672 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-21 13:21:20,673 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-21 13:21:20,673 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-21 13:21:20,673 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-21 13:21:20,673 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-21 13:21:20,673 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-21 13:21:20,674 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-21 13:21:20,674 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-21 13:21:20,674 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-21 13:21:20,674 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-21 13:21:20,674 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-21 13:21:20,675 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-21 13:21:20,675 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-21 13:21:20,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-21 13:21:20,675 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-21 13:21:20,676 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-21 13:21:20,676 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-21 13:21:20,676 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-21 13:21:20,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-21 13:21:20,676 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-21 13:21:20,676 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-21 13:21:20,677 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> false [2020-08-21 13:21:20,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-21 13:21:21,003 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-21 13:21:21,008 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-21 13:21:21,009 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-21 13:21:21,010 INFO L275 PluginConnector]: CDTParser initialized [2020-08-21 13:21:21,010 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label50.c [2020-08-21 13:21:21,073 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8a288f830/cf82cdcfa9ec4f01ab12aad26c8f60f5/FLAGba69420a7 [2020-08-21 13:21:21,651 INFO L306 CDTParser]: Found 1 translation units. [2020-08-21 13:21:21,652 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem01_label50.c [2020-08-21 13:21:21,663 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8a288f830/cf82cdcfa9ec4f01ab12aad26c8f60f5/FLAGba69420a7 [2020-08-21 13:21:21,868 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8a288f830/cf82cdcfa9ec4f01ab12aad26c8f60f5 [2020-08-21 13:21:21,877 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-21 13:21:21,878 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-21 13:21:21,879 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-21 13:21:21,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-21 13:21:21,883 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-21 13:21:21,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 01:21:21" (1/1) ... [2020-08-21 13:21:21,887 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56344ce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:21:21, skipping insertion in model container [2020-08-21 13:21:21,887 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 01:21:21" (1/1) ... [2020-08-21 13:21:21,894 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-21 13:21:21,939 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-21 13:21:22,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 13:21:22,346 INFO L203 MainTranslator]: Completed pre-run [2020-08-21 13:21:22,552 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 13:21:22,576 INFO L208 MainTranslator]: Completed translation [2020-08-21 13:21:22,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:21:22 WrapperNode [2020-08-21 13:21:22,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-21 13:21:22,577 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-21 13:21:22,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-21 13:21:22,578 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-21 13:21:22,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:21:22" (1/1) ... [2020-08-21 13:21:22,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:21:22" (1/1) ... [2020-08-21 13:21:22,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:21:22" (1/1) ... [2020-08-21 13:21:22,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:21:22" (1/1) ... [2020-08-21 13:21:22,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:21:22" (1/1) ... [2020-08-21 13:21:22,675 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:21:22" (1/1) ... [2020-08-21 13:21:22,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:21:22" (1/1) ... [2020-08-21 13:21:22,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-21 13:21:22,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-21 13:21:22,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-21 13:21:22,688 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-21 13:21:22,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:21:22" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-08-21 13:21:22,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-21 13:21:22,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-21 13:21:22,750 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-08-21 13:21:22,750 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-21 13:21:22,751 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-08-21 13:21:22,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-21 13:21:22,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-21 13:21:22,752 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-08-21 13:21:22,752 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-21 13:21:22,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-21 13:21:22,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-21 13:21:24,033 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-21 13:21:24,034 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-08-21 13:21:24,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 01:21:24 BoogieIcfgContainer [2020-08-21 13:21:24,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-21 13:21:24,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-21 13:21:24,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-21 13:21:24,052 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-21 13:21:24,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.08 01:21:21" (1/3) ... [2020-08-21 13:21:24,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b60bdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 01:21:24, skipping insertion in model container [2020-08-21 13:21:24,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:21:22" (2/3) ... [2020-08-21 13:21:24,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b60bdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 01:21:24, skipping insertion in model container [2020-08-21 13:21:24,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 01:21:24" (3/3) ... [2020-08-21 13:21:24,056 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label50.c [2020-08-21 13:21:24,067 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-21 13:21:24,080 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-21 13:21:24,095 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-21 13:21:24,131 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-21 13:21:24,132 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-21 13:21:24,133 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-21 13:21:24,133 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-21 13:21:24,134 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-21 13:21:24,134 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-21 13:21:24,134 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-21 13:21:24,134 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-21 13:21:24,167 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2020-08-21 13:21:24,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-08-21 13:21:24,186 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:21:24,188 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] [2020-08-21 13:21:24,188 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:21:24,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:21:24,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1653547897, now seen corresponding path program 1 times [2020-08-21 13:21:24,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:21:24,210 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1570697593] [2020-08-21 13:21:24,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:21:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:24,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:21:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:24,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 13:21:24,807 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1570697593] [2020-08-21 13:21:24,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 13:21:24,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-08-21 13:21:24,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987415159] [2020-08-21 13:21:24,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-21 13:21:24,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:21:24,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-21 13:21:24,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-21 13:21:24,837 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 5 states. [2020-08-21 13:21:26,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:21:26,405 INFO L93 Difference]: Finished difference Result 557 states and 956 transitions. [2020-08-21 13:21:26,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 13:21:26,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2020-08-21 13:21:26,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:21:26,443 INFO L225 Difference]: With dead ends: 557 [2020-08-21 13:21:26,443 INFO L226 Difference]: Without dead ends: 286 [2020-08-21 13:21:26,454 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-08-21 13:21:26,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2020-08-21 13:21:26,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 280. [2020-08-21 13:21:26,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-08-21 13:21:26,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 402 transitions. [2020-08-21 13:21:26,572 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 402 transitions. Word has length 85 [2020-08-21 13:21:26,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:21:26,574 INFO L479 AbstractCegarLoop]: Abstraction has 280 states and 402 transitions. [2020-08-21 13:21:26,574 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-21 13:21:26,575 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 402 transitions. [2020-08-21 13:21:26,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-08-21 13:21:26,596 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:21:26,597 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-08-21 13:21:26,597 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-21 13:21:26,598 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:21:26,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:21:26,598 INFO L82 PathProgramCache]: Analyzing trace with hash 2076475216, now seen corresponding path program 1 times [2020-08-21 13:21:26,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:21:26,599 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2138546952] [2020-08-21 13:21:26,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:21:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:26,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:21:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:26,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 13:21:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:26,772 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 13:21:26,773 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2138546952] [2020-08-21 13:21:26,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 13:21:26,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-21 13:21:26,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937081548] [2020-08-21 13:21:26,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-21 13:21:26,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:21:26,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-21 13:21:26,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-08-21 13:21:26,777 INFO L87 Difference]: Start difference. First operand 280 states and 402 transitions. Second operand 8 states. [2020-08-21 13:21:28,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:21:28,173 INFO L93 Difference]: Finished difference Result 713 states and 1049 transitions. [2020-08-21 13:21:28,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-21 13:21:28,174 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2020-08-21 13:21:28,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:21:28,180 INFO L225 Difference]: With dead ends: 713 [2020-08-21 13:21:28,180 INFO L226 Difference]: Without dead ends: 439 [2020-08-21 13:21:28,182 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-08-21 13:21:28,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2020-08-21 13:21:28,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 421. [2020-08-21 13:21:28,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2020-08-21 13:21:28,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 590 transitions. [2020-08-21 13:21:28,216 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 590 transitions. Word has length 95 [2020-08-21 13:21:28,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:21:28,217 INFO L479 AbstractCegarLoop]: Abstraction has 421 states and 590 transitions. [2020-08-21 13:21:28,217 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-21 13:21:28,217 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 590 transitions. [2020-08-21 13:21:28,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-08-21 13:21:28,223 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:21:28,223 INFO L422 BasicCegarLoop]: trace histogram [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-08-21 13:21:28,223 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-21 13:21:28,224 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:21:28,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:21:28,224 INFO L82 PathProgramCache]: Analyzing trace with hash -970621106, now seen corresponding path program 1 times [2020-08-21 13:21:28,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:21:28,225 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [590069176] [2020-08-21 13:21:28,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:21:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:28,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:21:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:28,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 13:21:28,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:28,493 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 13:21:28,493 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [590069176] [2020-08-21 13:21:28,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 13:21:28,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-08-21 13:21:28,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392482014] [2020-08-21 13:21:28,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-21 13:21:28,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:21:28,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-21 13:21:28,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-21 13:21:28,496 INFO L87 Difference]: Start difference. First operand 421 states and 590 transitions. Second operand 5 states. [2020-08-21 13:21:29,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:21:29,728 INFO L93 Difference]: Finished difference Result 1257 states and 1810 transitions. [2020-08-21 13:21:29,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 13:21:29,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2020-08-21 13:21:29,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:21:29,741 INFO L225 Difference]: With dead ends: 1257 [2020-08-21 13:21:29,742 INFO L226 Difference]: Without dead ends: 842 [2020-08-21 13:21:29,743 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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-08-21 13:21:29,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2020-08-21 13:21:29,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 699. [2020-08-21 13:21:29,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2020-08-21 13:21:29,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 935 transitions. [2020-08-21 13:21:29,784 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 935 transitions. Word has length 96 [2020-08-21 13:21:29,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:21:29,785 INFO L479 AbstractCegarLoop]: Abstraction has 699 states and 935 transitions. [2020-08-21 13:21:29,785 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-21 13:21:29,786 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 935 transitions. [2020-08-21 13:21:29,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-08-21 13:21:29,792 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:21:29,793 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 13:21:29,793 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-21 13:21:29,793 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:21:29,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:21:29,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1409491302, now seen corresponding path program 1 times [2020-08-21 13:21:29,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:21:29,794 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [853128121] [2020-08-21 13:21:29,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:21:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:29,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:21:29,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:29,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 13:21:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:30,049 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 13:21:30,050 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [853128121] [2020-08-21 13:21:30,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 13:21:30,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-21 13:21:30,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317397429] [2020-08-21 13:21:30,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-21 13:21:30,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:21:30,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-21 13:21:30,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-08-21 13:21:30,053 INFO L87 Difference]: Start difference. First operand 699 states and 935 transitions. Second operand 8 states. [2020-08-21 13:21:31,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:21:31,965 INFO L93 Difference]: Finished difference Result 1688 states and 2336 transitions. [2020-08-21 13:21:31,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-21 13:21:31,969 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2020-08-21 13:21:31,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:21:31,979 INFO L225 Difference]: With dead ends: 1688 [2020-08-21 13:21:31,980 INFO L226 Difference]: Without dead ends: 995 [2020-08-21 13:21:31,983 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2020-08-21 13:21:31,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2020-08-21 13:21:32,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 979. [2020-08-21 13:21:32,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 979 states. [2020-08-21 13:21:32,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1232 transitions. [2020-08-21 13:21:32,051 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1232 transitions. Word has length 102 [2020-08-21 13:21:32,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:21:32,055 INFO L479 AbstractCegarLoop]: Abstraction has 979 states and 1232 transitions. [2020-08-21 13:21:32,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-21 13:21:32,055 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1232 transitions. [2020-08-21 13:21:32,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-08-21 13:21:32,069 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:21:32,070 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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-08-21 13:21:32,070 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-21 13:21:32,070 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:21:32,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:21:32,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1605942605, now seen corresponding path program 1 times [2020-08-21 13:21:32,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:21:32,072 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1752039795] [2020-08-21 13:21:32,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:21:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:32,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:21:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:32,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 13:21:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:32,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-21 13:21:32,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:32,353 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-21 13:21:32,353 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1752039795] [2020-08-21 13:21:32,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 13:21:32,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 13:21:32,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138588061] [2020-08-21 13:21:32,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 13:21:32,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:21:32,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 13:21:32,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-21 13:21:32,356 INFO L87 Difference]: Start difference. First operand 979 states and 1232 transitions. Second operand 7 states. [2020-08-21 13:21:33,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:21:33,643 INFO L93 Difference]: Finished difference Result 2818 states and 3681 transitions. [2020-08-21 13:21:33,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-21 13:21:33,644 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2020-08-21 13:21:33,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:21:33,657 INFO L225 Difference]: With dead ends: 2818 [2020-08-21 13:21:33,658 INFO L226 Difference]: Without dead ends: 1555 [2020-08-21 13:21:33,663 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-08-21 13:21:33,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2020-08-21 13:21:33,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1263. [2020-08-21 13:21:33,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1263 states. [2020-08-21 13:21:33,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1495 transitions. [2020-08-21 13:21:33,743 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1495 transitions. Word has length 113 [2020-08-21 13:21:33,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:21:33,767 INFO L479 AbstractCegarLoop]: Abstraction has 1263 states and 1495 transitions. [2020-08-21 13:21:33,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 13:21:33,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1495 transitions. [2020-08-21 13:21:33,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-08-21 13:21:33,772 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:21:33,772 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-08-21 13:21:33,773 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-21 13:21:33,773 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:21:33,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:21:33,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1610941859, now seen corresponding path program 1 times [2020-08-21 13:21:33,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:21:33,774 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [312794772] [2020-08-21 13:21:33,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:21:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:33,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:21:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:33,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 13:21:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:33,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-21 13:21:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:33,957 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-21 13:21:33,958 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [312794772] [2020-08-21 13:21:33,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 13:21:33,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 13:21:33,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015898606] [2020-08-21 13:21:33,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 13:21:33,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:21:33,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 13:21:33,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-21 13:21:33,965 INFO L87 Difference]: Start difference. First operand 1263 states and 1495 transitions. Second operand 7 states. [2020-08-21 13:21:35,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:21:35,157 INFO L93 Difference]: Finished difference Result 3503 states and 4276 transitions. [2020-08-21 13:21:35,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-21 13:21:35,158 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 121 [2020-08-21 13:21:35,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:21:35,170 INFO L225 Difference]: With dead ends: 3503 [2020-08-21 13:21:35,170 INFO L226 Difference]: Without dead ends: 2107 [2020-08-21 13:21:35,174 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-08-21 13:21:35,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2107 states. [2020-08-21 13:21:35,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2107 to 1682. [2020-08-21 13:21:35,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2020-08-21 13:21:35,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 1967 transitions. [2020-08-21 13:21:35,271 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 1967 transitions. Word has length 121 [2020-08-21 13:21:35,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:21:35,271 INFO L479 AbstractCegarLoop]: Abstraction has 1682 states and 1967 transitions. [2020-08-21 13:21:35,271 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 13:21:35,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 1967 transitions. [2020-08-21 13:21:35,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-08-21 13:21:35,277 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:21:35,278 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-08-21 13:21:35,278 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-21 13:21:35,278 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:21:35,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:21:35,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1106544002, now seen corresponding path program 1 times [2020-08-21 13:21:35,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:21:35,279 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1022408889] [2020-08-21 13:21:35,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:21:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:35,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:21:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:35,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 13:21:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:35,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-21 13:21:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:35,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-08-21 13:21:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:35,564 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 133 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-08-21 13:21:35,565 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1022408889] [2020-08-21 13:21:35,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 13:21:35,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 13:21:35,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721391423] [2020-08-21 13:21:35,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 13:21:35,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:21:35,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 13:21:35,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-21 13:21:35,568 INFO L87 Difference]: Start difference. First operand 1682 states and 1967 transitions. Second operand 7 states. [2020-08-21 13:21:36,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:21:36,861 INFO L93 Difference]: Finished difference Result 3793 states and 4432 transitions. [2020-08-21 13:21:36,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-21 13:21:36,870 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 193 [2020-08-21 13:21:36,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:21:36,881 INFO L225 Difference]: With dead ends: 3793 [2020-08-21 13:21:36,881 INFO L226 Difference]: Without dead ends: 2117 [2020-08-21 13:21:36,885 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-08-21 13:21:36,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2117 states. [2020-08-21 13:21:36,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2117 to 2115. [2020-08-21 13:21:36,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2115 states. [2020-08-21 13:21:36,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 2391 transitions. [2020-08-21 13:21:36,946 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 2391 transitions. Word has length 193 [2020-08-21 13:21:36,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:21:36,946 INFO L479 AbstractCegarLoop]: Abstraction has 2115 states and 2391 transitions. [2020-08-21 13:21:36,946 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 13:21:36,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 2391 transitions. [2020-08-21 13:21:36,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2020-08-21 13:21:36,953 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:21:36,953 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-21 13:21:36,954 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-21 13:21:36,954 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:21:36,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:21:36,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1639971981, now seen corresponding path program 1 times [2020-08-21 13:21:36,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:21:36,955 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1709644494] [2020-08-21 13:21:36,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:21:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:37,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:21:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:37,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 13:21:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:37,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-21 13:21:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:37,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-08-21 13:21:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:37,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 13:21:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:37,215 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 137 proven. 29 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2020-08-21 13:21:37,216 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1709644494] [2020-08-21 13:21:37,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 13:21:37,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-21 13:21:37,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233637065] [2020-08-21 13:21:37,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-21 13:21:37,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:21:37,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-21 13:21:37,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-08-21 13:21:37,218 INFO L87 Difference]: Start difference. First operand 2115 states and 2391 transitions. Second operand 9 states. [2020-08-21 13:21:41,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:21:41,271 INFO L93 Difference]: Finished difference Result 6836 states and 8073 transitions. [2020-08-21 13:21:41,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-08-21 13:21:41,272 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 199 [2020-08-21 13:21:41,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:21:41,298 INFO L225 Difference]: With dead ends: 6836 [2020-08-21 13:21:41,298 INFO L226 Difference]: Without dead ends: 4862 [2020-08-21 13:21:41,305 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2020-08-21 13:21:41,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4862 states. [2020-08-21 13:21:41,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4862 to 4437. [2020-08-21 13:21:41,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4437 states. [2020-08-21 13:21:41,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4437 states to 4437 states and 5195 transitions. [2020-08-21 13:21:41,454 INFO L78 Accepts]: Start accepts. Automaton has 4437 states and 5195 transitions. Word has length 199 [2020-08-21 13:21:41,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:21:41,454 INFO L479 AbstractCegarLoop]: Abstraction has 4437 states and 5195 transitions. [2020-08-21 13:21:41,454 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-21 13:21:41,454 INFO L276 IsEmpty]: Start isEmpty. Operand 4437 states and 5195 transitions. [2020-08-21 13:21:41,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2020-08-21 13:21:41,467 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:21:41,467 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-08-21 13:21:41,467 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-21 13:21:41,467 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:21:41,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:21:41,468 INFO L82 PathProgramCache]: Analyzing trace with hash 512536307, now seen corresponding path program 1 times [2020-08-21 13:21:41,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:21:41,468 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [682772941] [2020-08-21 13:21:41,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:21:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:41,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:21:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:41,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 13:21:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:41,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-08-21 13:21:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:41,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-08-21 13:21:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:41,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2020-08-21 13:21:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:41,916 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 165 proven. 13 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2020-08-21 13:21:41,917 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [682772941] [2020-08-21 13:21:41,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 13:21:41,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-21 13:21:41,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845979958] [2020-08-21 13:21:41,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-21 13:21:41,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:21:41,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-21 13:21:41,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-08-21 13:21:41,927 INFO L87 Difference]: Start difference. First operand 4437 states and 5195 transitions. Second operand 11 states. [2020-08-21 13:21:43,240 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2020-08-21 13:21:46,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:21:46,302 INFO L93 Difference]: Finished difference Result 9293 states and 10891 transitions. [2020-08-21 13:21:46,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-21 13:21:46,303 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 218 [2020-08-21 13:21:46,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:21:46,326 INFO L225 Difference]: With dead ends: 9293 [2020-08-21 13:21:46,326 INFO L226 Difference]: Without dead ends: 4699 [2020-08-21 13:21:46,342 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=184, Invalid=628, Unknown=0, NotChecked=0, Total=812 [2020-08-21 13:21:46,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4699 states. [2020-08-21 13:21:46,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4699 to 4423. [2020-08-21 13:21:46,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4423 states. [2020-08-21 13:21:46,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4423 states to 4423 states and 5079 transitions. [2020-08-21 13:21:46,530 INFO L78 Accepts]: Start accepts. Automaton has 4423 states and 5079 transitions. Word has length 218 [2020-08-21 13:21:46,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:21:46,530 INFO L479 AbstractCegarLoop]: Abstraction has 4423 states and 5079 transitions. [2020-08-21 13:21:46,530 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-21 13:21:46,530 INFO L276 IsEmpty]: Start isEmpty. Operand 4423 states and 5079 transitions. [2020-08-21 13:21:46,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2020-08-21 13:21:46,542 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:21:46,543 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2020-08-21 13:21:46,543 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-21 13:21:46,543 INFO L427 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:21:46,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:21:46,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1816850039, now seen corresponding path program 1 times [2020-08-21 13:21:46,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:21:46,544 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [311552524] [2020-08-21 13:21:46,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:21:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-21 13:21:46,595 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-21 13:21:46,595 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-21 13:21:46,600 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-21 13:21:46,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 01:21:46 BoogieIcfgContainer [2020-08-21 13:21:46,656 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-21 13:21:46,659 INFO L168 Benchmark]: Toolchain (without parser) took 24779.50 ms. Allocated memory was 138.9 MB in the beginning and 539.0 MB in the end (delta: 400.0 MB). Free memory was 100.8 MB in the beginning and 452.0 MB in the end (delta: -351.2 MB). Peak memory consumption was 48.9 MB. Max. memory is 7.1 GB. [2020-08-21 13:21:46,660 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.2 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-08-21 13:21:46,662 INFO L168 Benchmark]: CACSL2BoogieTranslator took 697.53 ms. Allocated memory was 138.9 MB in the beginning and 205.0 MB in the end (delta: 66.1 MB). Free memory was 100.6 MB in the beginning and 171.0 MB in the end (delta: -70.4 MB). Peak memory consumption was 34.1 MB. Max. memory is 7.1 GB. [2020-08-21 13:21:46,663 INFO L168 Benchmark]: Boogie Preprocessor took 109.90 ms. Allocated memory is still 205.0 MB. Free memory was 171.0 MB in the beginning and 165.9 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. [2020-08-21 13:21:46,670 INFO L168 Benchmark]: RCFGBuilder took 1358.36 ms. Allocated memory was 205.0 MB in the beginning and 237.0 MB in the end (delta: 32.0 MB). Free memory was 165.9 MB in the beginning and 180.4 MB in the end (delta: -14.5 MB). Peak memory consumption was 83.8 MB. Max. memory is 7.1 GB. [2020-08-21 13:21:46,673 INFO L168 Benchmark]: TraceAbstraction took 22607.27 ms. Allocated memory was 237.0 MB in the beginning and 539.0 MB in the end (delta: 302.0 MB). Free memory was 180.4 MB in the beginning and 452.0 MB in the end (delta: -271.6 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. [2020-08-21 13:21:46,679 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.13 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.2 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 697.53 ms. Allocated memory was 138.9 MB in the beginning and 205.0 MB in the end (delta: 66.1 MB). Free memory was 100.6 MB in the beginning and 171.0 MB in the end (delta: -70.4 MB). Peak memory consumption was 34.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 109.90 ms. Allocated memory is still 205.0 MB. Free memory was 171.0 MB in the beginning and 165.9 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1358.36 ms. Allocated memory was 205.0 MB in the beginning and 237.0 MB in the end (delta: 32.0 MB). Free memory was 165.9 MB in the beginning and 180.4 MB in the end (delta: -14.5 MB). Peak memory consumption was 83.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22607.27 ms. Allocated memory was 237.0 MB in the beginning and 539.0 MB in the end (delta: 302.0 MB). Free memory was 180.4 MB in the beginning and 452.0 MB in the end (delta: -271.6 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 413]: 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 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 TRUE ((((((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)) [L85] a7 = 0 [L86] a20 = 1 [L87] a8 = 14 [L88] a16 = 4 [L89] a21 = 1 [L90] a17 = 0 [L91] 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 FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L406] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L409] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L412] COND TRUE ((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) [L413] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 207 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 22.4s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 18.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 304 SDtfs, 6284 SDslu, 521 SDs, 0 SdLazy, 10804 SolverSat, 1520 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4437occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 9 MinimizatonAttempts, 1603 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1451 NumberOfCodeBlocks, 1451 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1213 ConstructedInterpolants, 0 QuantifiedInterpolants, 466227 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 649/712 InterpolantCoveringCapability, 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...