/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_label38.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-89f541c [2020-08-27 21:52:45,042 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-27 21:52:45,047 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-27 21:52:45,090 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-27 21:52:45,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-27 21:52:45,102 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-27 21:52:45,105 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-27 21:52:45,110 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-27 21:52:45,113 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-27 21:52:45,117 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-27 21:52:45,118 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-27 21:52:45,119 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-27 21:52:45,120 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-27 21:52:45,123 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-27 21:52:45,126 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-27 21:52:45,128 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-27 21:52:45,130 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-27 21:52:45,131 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-27 21:52:45,134 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-27 21:52:45,143 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-27 21:52:45,146 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-27 21:52:45,147 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-27 21:52:45,148 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-27 21:52:45,149 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-27 21:52:45,153 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-27 21:52:45,153 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-27 21:52:45,153 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-27 21:52:45,156 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-27 21:52:45,157 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-27 21:52:45,159 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-27 21:52:45,159 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-27 21:52:45,160 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-27 21:52:45,161 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-27 21:52:45,162 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-27 21:52:45,164 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-27 21:52:45,164 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-27 21:52:45,165 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-27 21:52:45,165 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-27 21:52:45,165 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-27 21:52:45,166 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-27 21:52:45,168 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-27 21:52:45,169 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-27 21:52:45,216 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-27 21:52:45,216 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-27 21:52:45,218 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-27 21:52:45,219 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-27 21:52:45,219 INFO L138 SettingsManager]: * Use SBE=true [2020-08-27 21:52:45,219 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-27 21:52:45,220 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-27 21:52:45,220 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-27 21:52:45,220 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-27 21:52:45,220 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-27 21:52:45,221 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-27 21:52:45,222 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-27 21:52:45,222 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-27 21:52:45,222 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-27 21:52:45,222 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-27 21:52:45,223 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-27 21:52:45,223 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-27 21:52:45,223 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-27 21:52:45,223 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-27 21:52:45,223 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-27 21:52:45,224 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-27 21:52:45,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-27 21:52:45,224 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-27 21:52:45,224 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-27 21:52:45,224 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-27 21:52:45,225 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-27 21:52:45,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-27 21:52:45,225 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-27 21:52:45,225 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-27 21:52:45,225 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-27 21:52:45,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-27 21:52:45,725 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-27 21:52:45,730 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-27 21:52:45,732 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-27 21:52:45,732 INFO L275 PluginConnector]: CDTParser initialized [2020-08-27 21:52:45,734 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label38.c [2020-08-27 21:52:45,828 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/0c44b0d4e/c80c365859c94fb8a659461f713fcf43/FLAGa97c69d24 [2020-08-27 21:52:46,551 INFO L306 CDTParser]: Found 1 translation units. [2020-08-27 21:52:46,552 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem01_label38.c [2020-08-27 21:52:46,568 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/0c44b0d4e/c80c365859c94fb8a659461f713fcf43/FLAGa97c69d24 [2020-08-27 21:52:46,726 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/0c44b0d4e/c80c365859c94fb8a659461f713fcf43 [2020-08-27 21:52:46,741 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-27 21:52:46,743 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-27 21:52:46,744 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-27 21:52:46,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-27 21:52:46,751 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-27 21:52:46,752 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:52:46" (1/1) ... [2020-08-27 21:52:46,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55e164ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:52:46, skipping insertion in model container [2020-08-27 21:52:46,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:52:46" (1/1) ... [2020-08-27 21:52:46,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-27 21:52:46,821 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-27 21:52:47,316 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-27 21:52:47,323 INFO L203 MainTranslator]: Completed pre-run [2020-08-27 21:52:47,564 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-27 21:52:47,582 INFO L208 MainTranslator]: Completed translation [2020-08-27 21:52:47,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:52:47 WrapperNode [2020-08-27 21:52:47,583 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-27 21:52:47,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-27 21:52:47,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-27 21:52:47,585 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-27 21:52:47,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:52:47" (1/1) ... [2020-08-27 21:52:47,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:52:47" (1/1) ... [2020-08-27 21:52:47,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:52:47" (1/1) ... [2020-08-27 21:52:47,622 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:52:47" (1/1) ... [2020-08-27 21:52:47,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:52:47" (1/1) ... [2020-08-27 21:52:47,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:52:47" (1/1) ... [2020-08-27 21:52:47,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:52:47" (1/1) ... [2020-08-27 21:52:47,713 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-27 21:52:47,714 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-27 21:52:47,714 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-27 21:52:47,714 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-27 21:52:47,715 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:52:47" (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-27 21:52:47,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-27 21:52:47,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-27 21:52:47,797 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-08-27 21:52:47,797 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-27 21:52:47,798 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-08-27 21:52:47,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-27 21:52:47,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-27 21:52:47,798 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-08-27 21:52:47,799 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-27 21:52:47,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-27 21:52:47,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-27 21:52:49,047 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-27 21:52:49,047 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-08-27 21:52:49,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:52:49 BoogieIcfgContainer [2020-08-27 21:52:49,055 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-27 21:52:49,056 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-27 21:52:49,056 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-27 21:52:49,060 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-27 21:52:49,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 09:52:46" (1/3) ... [2020-08-27 21:52:49,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4445c8ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:52:49, skipping insertion in model container [2020-08-27 21:52:49,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:52:47" (2/3) ... [2020-08-27 21:52:49,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4445c8ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:52:49, skipping insertion in model container [2020-08-27 21:52:49,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:52:49" (3/3) ... [2020-08-27 21:52:49,065 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label38.c [2020-08-27 21:52:49,077 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-27 21:52:49,089 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-27 21:52:49,115 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-27 21:52:49,152 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-27 21:52:49,152 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-27 21:52:49,152 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-27 21:52:49,152 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-27 21:52:49,152 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-27 21:52:49,153 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-27 21:52:49,153 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-27 21:52:49,153 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-27 21:52:49,182 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2020-08-27 21:52:49,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-08-27 21:52:49,198 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:52:49,199 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:52:49,200 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:52:49,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:52:49,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1861146994, now seen corresponding path program 1 times [2020-08-27 21:52:49,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:52:49,220 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1954212464] [2020-08-27 21:52:49,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:52:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:52:49,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:52:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:52:49,841 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-27 21:52:49,842 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1954212464] [2020-08-27 21:52:49,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:52:49,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-08-27 21:52:49,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435932548] [2020-08-27 21:52:49,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-27 21:52:49,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:52:49,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-27 21:52:49,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-27 21:52:49,877 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 5 states. [2020-08-27 21:52:51,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:52:51,533 INFO L93 Difference]: Finished difference Result 557 states and 956 transitions. [2020-08-27 21:52:51,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-27 21:52:51,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2020-08-27 21:52:51,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:52:51,556 INFO L225 Difference]: With dead ends: 557 [2020-08-27 21:52:51,556 INFO L226 Difference]: Without dead ends: 286 [2020-08-27 21:52:51,564 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-27 21:52:51,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2020-08-27 21:52:51,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 280. [2020-08-27 21:52:51,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-08-27 21:52:51,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 402 transitions. [2020-08-27 21:52:51,650 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 402 transitions. Word has length 88 [2020-08-27 21:52:51,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:52:51,652 INFO L479 AbstractCegarLoop]: Abstraction has 280 states and 402 transitions. [2020-08-27 21:52:51,652 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-27 21:52:51,652 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 402 transitions. [2020-08-27 21:52:51,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-08-27 21:52:51,658 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:52:51,658 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, 1, 1, 1] [2020-08-27 21:52:51,659 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-27 21:52:51,659 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:52:51,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:52:51,659 INFO L82 PathProgramCache]: Analyzing trace with hash -136469723, now seen corresponding path program 1 times [2020-08-27 21:52:51,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:52:51,660 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1514044513] [2020-08-27 21:52:51,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:52:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:52:51,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:52:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:52:51,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-27 21:52:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:52:51,911 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-27 21:52:51,912 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1514044513] [2020-08-27 21:52:51,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:52:51,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-27 21:52:51,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036457922] [2020-08-27 21:52:51,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-27 21:52:51,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:52:51,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-27 21:52:51,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-08-27 21:52:51,916 INFO L87 Difference]: Start difference. First operand 280 states and 402 transitions. Second operand 8 states. [2020-08-27 21:52:53,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:52:53,506 INFO L93 Difference]: Finished difference Result 713 states and 1049 transitions. [2020-08-27 21:52:53,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-27 21:52:53,507 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 98 [2020-08-27 21:52:53,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:52:53,512 INFO L225 Difference]: With dead ends: 713 [2020-08-27 21:52:53,512 INFO L226 Difference]: Without dead ends: 439 [2020-08-27 21:52:53,515 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-08-27 21:52:53,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2020-08-27 21:52:53,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 421. [2020-08-27 21:52:53,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2020-08-27 21:52:53,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 590 transitions. [2020-08-27 21:52:53,586 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 590 transitions. Word has length 98 [2020-08-27 21:52:53,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:52:53,587 INFO L479 AbstractCegarLoop]: Abstraction has 421 states and 590 transitions. [2020-08-27 21:52:53,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-27 21:52:53,587 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 590 transitions. [2020-08-27 21:52:53,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-08-27 21:52:53,596 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:52:53,596 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, 1, 1, 1] [2020-08-27 21:52:53,596 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-27 21:52:53,596 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:52:53,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:52:53,597 INFO L82 PathProgramCache]: Analyzing trace with hash -2049197465, now seen corresponding path program 1 times [2020-08-27 21:52:53,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:52:53,597 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [14308051] [2020-08-27 21:52:53,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:52:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:52:53,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:52:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:52:53,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-27 21:52:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:52:53,941 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-27 21:52:53,941 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [14308051] [2020-08-27 21:52:53,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:52:53,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-08-27 21:52:53,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183330535] [2020-08-27 21:52:53,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-27 21:52:53,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:52:53,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-27 21:52:53,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-27 21:52:53,944 INFO L87 Difference]: Start difference. First operand 421 states and 590 transitions. Second operand 5 states. [2020-08-27 21:52:55,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:52:55,119 INFO L93 Difference]: Finished difference Result 1257 states and 1815 transitions. [2020-08-27 21:52:55,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-27 21:52:55,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2020-08-27 21:52:55,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:52:55,128 INFO L225 Difference]: With dead ends: 1257 [2020-08-27 21:52:55,129 INFO L226 Difference]: Without dead ends: 842 [2020-08-27 21:52:55,130 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-27 21:52:55,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2020-08-27 21:52:55,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 836. [2020-08-27 21:52:55,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2020-08-27 21:52:55,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1170 transitions. [2020-08-27 21:52:55,171 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1170 transitions. Word has length 99 [2020-08-27 21:52:55,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:52:55,172 INFO L479 AbstractCegarLoop]: Abstraction has 836 states and 1170 transitions. [2020-08-27 21:52:55,172 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-27 21:52:55,172 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1170 transitions. [2020-08-27 21:52:55,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-08-27 21:52:55,177 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:52:55,178 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, 1, 1, 1] [2020-08-27 21:52:55,178 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-27 21:52:55,178 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:52:55,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:52:55,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1744209819, now seen corresponding path program 1 times [2020-08-27 21:52:55,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:52:55,179 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [395862621] [2020-08-27 21:52:55,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:52:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:52:55,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:52:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:52:55,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-27 21:52:55,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:52:55,444 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-27 21:52:55,445 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [395862621] [2020-08-27 21:52:55,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:52:55,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-27 21:52:55,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75305985] [2020-08-27 21:52:55,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-27 21:52:55,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:52:55,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-27 21:52:55,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-27 21:52:55,447 INFO L87 Difference]: Start difference. First operand 836 states and 1170 transitions. Second operand 6 states. [2020-08-27 21:52:56,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:52:56,803 INFO L93 Difference]: Finished difference Result 2359 states and 3419 transitions. [2020-08-27 21:52:56,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-27 21:52:56,804 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2020-08-27 21:52:56,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:52:56,817 INFO L225 Difference]: With dead ends: 2359 [2020-08-27 21:52:56,817 INFO L226 Difference]: Without dead ends: 1529 [2020-08-27 21:52:56,820 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-08-27 21:52:56,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2020-08-27 21:52:56,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1386. [2020-08-27 21:52:56,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1386 states. [2020-08-27 21:52:56,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1872 transitions. [2020-08-27 21:52:56,908 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1872 transitions. Word has length 105 [2020-08-27 21:52:56,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:52:56,910 INFO L479 AbstractCegarLoop]: Abstraction has 1386 states and 1872 transitions. [2020-08-27 21:52:56,910 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-27 21:52:56,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1872 transitions. [2020-08-27 21:52:56,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-08-27 21:52:56,918 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:52:56,919 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 21:52:56,919 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-27 21:52:56,920 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:52:56,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:52:56,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1307592906, now seen corresponding path program 1 times [2020-08-27 21:52:56,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:52:56,921 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2102921657] [2020-08-27 21:52:56,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:52:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:52:57,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:52:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:52:57,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-27 21:52:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:52:57,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-27 21:52:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:52:57,135 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-27 21:52:57,136 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2102921657] [2020-08-27 21:52:57,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:52:57,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-27 21:52:57,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956311179] [2020-08-27 21:52:57,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-27 21:52:57,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:52:57,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-27 21:52:57,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-27 21:52:57,138 INFO L87 Difference]: Start difference. First operand 1386 states and 1872 transitions. Second operand 7 states. [2020-08-27 21:52:59,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:52:59,182 INFO L93 Difference]: Finished difference Result 3253 states and 4635 transitions. [2020-08-27 21:52:59,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-27 21:52:59,182 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2020-08-27 21:52:59,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:52:59,197 INFO L225 Difference]: With dead ends: 3253 [2020-08-27 21:52:59,197 INFO L226 Difference]: Without dead ends: 1873 [2020-08-27 21:52:59,202 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 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-27 21:52:59,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2020-08-27 21:52:59,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1865. [2020-08-27 21:52:59,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1865 states. [2020-08-27 21:52:59,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1865 states and 2583 transitions. [2020-08-27 21:52:59,288 INFO L78 Accepts]: Start accepts. Automaton has 1865 states and 2583 transitions. Word has length 128 [2020-08-27 21:52:59,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:52:59,289 INFO L479 AbstractCegarLoop]: Abstraction has 1865 states and 2583 transitions. [2020-08-27 21:52:59,289 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-27 21:52:59,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1865 states and 2583 transitions. [2020-08-27 21:52:59,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-08-27 21:52:59,298 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:52:59,299 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 21:52:59,299 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-27 21:52:59,299 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:52:59,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:52:59,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1735292846, now seen corresponding path program 1 times [2020-08-27 21:52:59,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:52:59,301 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1329734548] [2020-08-27 21:52:59,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:52:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:52:59,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:52:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:52:59,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-27 21:52:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:52:59,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:52:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:52:59,649 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 39 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-08-27 21:52:59,649 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1329734548] [2020-08-27 21:52:59,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:52:59,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-08-27 21:52:59,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526138494] [2020-08-27 21:52:59,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-27 21:52:59,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:52:59,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-27 21:52:59,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-27 21:52:59,662 INFO L87 Difference]: Start difference. First operand 1865 states and 2583 transitions. Second operand 5 states. [2020-08-27 21:53:00,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:53:00,835 INFO L93 Difference]: Finished difference Result 4012 states and 5603 transitions. [2020-08-27 21:53:00,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-27 21:53:00,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2020-08-27 21:53:00,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:53:00,851 INFO L225 Difference]: With dead ends: 4012 [2020-08-27 21:53:00,851 INFO L226 Difference]: Without dead ends: 2157 [2020-08-27 21:53:00,859 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-27 21:53:00,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2157 states. [2020-08-27 21:53:00,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2157 to 2012. [2020-08-27 21:53:00,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2020-08-27 21:53:00,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 2703 transitions. [2020-08-27 21:53:00,938 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 2703 transitions. Word has length 132 [2020-08-27 21:53:00,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:53:00,938 INFO L479 AbstractCegarLoop]: Abstraction has 2012 states and 2703 transitions. [2020-08-27 21:53:00,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-27 21:53:00,938 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 2703 transitions. [2020-08-27 21:53:00,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-08-27 21:53:00,947 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:53:00,948 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:53:00,948 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-27 21:53:00,948 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:53:00,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:53:00,949 INFO L82 PathProgramCache]: Analyzing trace with hash -273287469, now seen corresponding path program 1 times [2020-08-27 21:53:00,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:53:00,949 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1374872905] [2020-08-27 21:53:00,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:53:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:01,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:53:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:01,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-27 21:53:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:01,255 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-27 21:53:01,256 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1374872905] [2020-08-27 21:53:01,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:53:01,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-27 21:53:01,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166336387] [2020-08-27 21:53:01,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-27 21:53:01,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:53:01,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-27 21:53:01,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-08-27 21:53:01,259 INFO L87 Difference]: Start difference. First operand 2012 states and 2703 transitions. Second operand 8 states. [2020-08-27 21:53:02,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:53:02,799 INFO L93 Difference]: Finished difference Result 4127 states and 5429 transitions. [2020-08-27 21:53:02,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-27 21:53:02,800 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 141 [2020-08-27 21:53:02,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:53:02,811 INFO L225 Difference]: With dead ends: 4127 [2020-08-27 21:53:02,811 INFO L226 Difference]: Without dead ends: 2125 [2020-08-27 21:53:02,820 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-08-27 21:53:02,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2020-08-27 21:53:02,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 1849. [2020-08-27 21:53:02,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1849 states. [2020-08-27 21:53:02,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2286 transitions. [2020-08-27 21:53:02,884 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 2286 transitions. Word has length 141 [2020-08-27 21:53:02,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:53:02,884 INFO L479 AbstractCegarLoop]: Abstraction has 1849 states and 2286 transitions. [2020-08-27 21:53:02,884 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-27 21:53:02,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2286 transitions. [2020-08-27 21:53:02,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-08-27 21:53:02,890 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:53:02,891 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 21:53:02,891 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-27 21:53:02,891 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:53:02,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:53:02,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1409122264, now seen corresponding path program 1 times [2020-08-27 21:53:02,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:53:02,892 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [23609364] [2020-08-27 21:53:02,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:53:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:03,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:53:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:03,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-27 21:53:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:03,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-08-27 21:53:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:03,261 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 60 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-27 21:53:03,261 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [23609364] [2020-08-27 21:53:03,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:53:03,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-27 21:53:03,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398227123] [2020-08-27 21:53:03,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-27 21:53:03,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:53:03,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-27 21:53:03,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-27 21:53:03,264 INFO L87 Difference]: Start difference. First operand 1849 states and 2286 transitions. Second operand 7 states. [2020-08-27 21:53:04,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:53:04,861 INFO L93 Difference]: Finished difference Result 3990 states and 4952 transitions. [2020-08-27 21:53:04,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-27 21:53:04,862 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 149 [2020-08-27 21:53:04,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:53:04,872 INFO L225 Difference]: With dead ends: 3990 [2020-08-27 21:53:04,872 INFO L226 Difference]: Without dead ends: 2147 [2020-08-27 21:53:04,877 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-27 21:53:04,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2020-08-27 21:53:04,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 1718. [2020-08-27 21:53:04,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1718 states. [2020-08-27 21:53:04,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2068 transitions. [2020-08-27 21:53:04,929 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2068 transitions. Word has length 149 [2020-08-27 21:53:04,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:53:04,929 INFO L479 AbstractCegarLoop]: Abstraction has 1718 states and 2068 transitions. [2020-08-27 21:53:04,929 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-27 21:53:04,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2068 transitions. [2020-08-27 21:53:04,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2020-08-27 21:53:04,935 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:53:04,936 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 21:53:04,936 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-27 21:53:04,936 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:53:04,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:53:04,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1345296538, now seen corresponding path program 1 times [2020-08-27 21:53:04,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:53:04,938 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1765915185] [2020-08-27 21:53:04,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:53:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:05,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:53:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:05,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-27 21:53:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:05,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-27 21:53:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:05,257 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 66 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-27 21:53:05,258 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1765915185] [2020-08-27 21:53:05,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:53:05,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-27 21:53:05,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405198552] [2020-08-27 21:53:05,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-27 21:53:05,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:53:05,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-27 21:53:05,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-27 21:53:05,260 INFO L87 Difference]: Start difference. First operand 1718 states and 2068 transitions. Second operand 7 states. [2020-08-27 21:53:06,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:53:06,601 INFO L93 Difference]: Finished difference Result 3458 states and 4194 transitions. [2020-08-27 21:53:06,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-27 21:53:06,602 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 152 [2020-08-27 21:53:06,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:53:06,609 INFO L225 Difference]: With dead ends: 3458 [2020-08-27 21:53:06,610 INFO L226 Difference]: Without dead ends: 1746 [2020-08-27 21:53:06,613 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-27 21:53:06,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2020-08-27 21:53:06,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1577. [2020-08-27 21:53:06,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-08-27 21:53:06,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 1884 transitions. [2020-08-27 21:53:06,655 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 1884 transitions. Word has length 152 [2020-08-27 21:53:06,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:53:06,655 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 1884 transitions. [2020-08-27 21:53:06,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-27 21:53:06,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 1884 transitions. [2020-08-27 21:53:06,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-08-27 21:53:06,661 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:53:06,661 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:53:06,662 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-27 21:53:06,662 INFO L427 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:53:06,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:53:06,662 INFO L82 PathProgramCache]: Analyzing trace with hash -82886138, now seen corresponding path program 1 times [2020-08-27 21:53:06,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:53:06,663 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [581751352] [2020-08-27 21:53:06,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:53:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:06,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:53:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:06,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-27 21:53:06,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:06,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-27 21:53:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:07,000 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-27 21:53:07,002 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [581751352] [2020-08-27 21:53:07,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:53:07,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-27 21:53:07,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536097032] [2020-08-27 21:53:07,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-27 21:53:07,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:53:07,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-27 21:53:07,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-27 21:53:07,004 INFO L87 Difference]: Start difference. First operand 1577 states and 1884 transitions. Second operand 7 states. [2020-08-27 21:53:08,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:53:08,621 INFO L93 Difference]: Finished difference Result 3446 states and 4114 transitions. [2020-08-27 21:53:08,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-27 21:53:08,625 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 174 [2020-08-27 21:53:08,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:53:08,633 INFO L225 Difference]: With dead ends: 3446 [2020-08-27 21:53:08,633 INFO L226 Difference]: Without dead ends: 1875 [2020-08-27 21:53:08,637 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-08-27 21:53:08,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2020-08-27 21:53:08,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1863. [2020-08-27 21:53:08,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1863 states. [2020-08-27 21:53:08,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1863 states to 1863 states and 2177 transitions. [2020-08-27 21:53:08,682 INFO L78 Accepts]: Start accepts. Automaton has 1863 states and 2177 transitions. Word has length 174 [2020-08-27 21:53:08,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:53:08,682 INFO L479 AbstractCegarLoop]: Abstraction has 1863 states and 2177 transitions. [2020-08-27 21:53:08,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-27 21:53:08,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1863 states and 2177 transitions. [2020-08-27 21:53:08,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2020-08-27 21:53:08,689 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:53:08,690 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-27 21:53:08,690 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-27 21:53:08,690 INFO L427 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:53:08,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:53:08,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1827070031, now seen corresponding path program 1 times [2020-08-27 21:53:08,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:53:08,691 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [425803888] [2020-08-27 21:53:08,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:53:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:08,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:53:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:08,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-27 21:53:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:08,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-08-27 21:53:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:08,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-08-27 21:53:08,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:09,279 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 160 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-27 21:53:09,280 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [425803888] [2020-08-27 21:53:09,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:53:09,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-27 21:53:09,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061341961] [2020-08-27 21:53:09,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-27 21:53:09,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:53:09,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-27 21:53:09,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-08-27 21:53:09,285 INFO L87 Difference]: Start difference. First operand 1863 states and 2177 transitions. Second operand 10 states. [2020-08-27 21:53:09,958 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2020-08-27 21:53:10,187 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 78 [2020-08-27 21:53:10,715 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2020-08-27 21:53:11,443 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2020-08-27 21:53:12,789 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2020-08-27 21:53:13,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:53:13,898 INFO L93 Difference]: Finished difference Result 4540 states and 5340 transitions. [2020-08-27 21:53:13,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-08-27 21:53:13,899 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 199 [2020-08-27 21:53:13,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:53:13,908 INFO L225 Difference]: With dead ends: 4540 [2020-08-27 21:53:13,909 INFO L226 Difference]: Without dead ends: 2683 [2020-08-27 21:53:13,912 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=198, Invalid=504, Unknown=0, NotChecked=0, Total=702 [2020-08-27 21:53:13,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2683 states. [2020-08-27 21:53:13,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2683 to 2133. [2020-08-27 21:53:13,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2020-08-27 21:53:13,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 2468 transitions. [2020-08-27 21:53:13,967 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 2468 transitions. Word has length 199 [2020-08-27 21:53:13,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:53:13,968 INFO L479 AbstractCegarLoop]: Abstraction has 2133 states and 2468 transitions. [2020-08-27 21:53:13,968 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-27 21:53:13,968 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2468 transitions. [2020-08-27 21:53:13,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2020-08-27 21:53:13,974 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:53:13,975 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-08-27 21:53:13,975 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-27 21:53:13,975 INFO L427 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:53:13,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:53:13,976 INFO L82 PathProgramCache]: Analyzing trace with hash 2033686183, now seen corresponding path program 1 times [2020-08-27 21:53:13,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:53:13,976 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1053622998] [2020-08-27 21:53:13,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:53:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:14,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:53:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:14,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-27 21:53:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:14,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-08-27 21:53:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:14,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-08-27 21:53:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:14,331 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 113 proven. 3 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-08-27 21:53:14,331 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1053622998] [2020-08-27 21:53:14,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:53:14,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-08-27 21:53:14,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460725764] [2020-08-27 21:53:14,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-27 21:53:14,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:53:14,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-27 21:53:14,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-27 21:53:14,335 INFO L87 Difference]: Start difference. First operand 2133 states and 2468 transitions. Second operand 5 states. [2020-08-27 21:53:15,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:53:15,688 INFO L93 Difference]: Finished difference Result 4816 states and 5601 transitions. [2020-08-27 21:53:15,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-27 21:53:15,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2020-08-27 21:53:15,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:53:15,699 INFO L225 Difference]: With dead ends: 4816 [2020-08-27 21:53:15,699 INFO L226 Difference]: Without dead ends: 2689 [2020-08-27 21:53:15,703 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-27 21:53:15,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2689 states. [2020-08-27 21:53:15,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2689 to 2411. [2020-08-27 21:53:15,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2411 states. [2020-08-27 21:53:15,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 2751 transitions. [2020-08-27 21:53:15,769 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 2751 transitions. Word has length 204 [2020-08-27 21:53:15,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:53:15,770 INFO L479 AbstractCegarLoop]: Abstraction has 2411 states and 2751 transitions. [2020-08-27 21:53:15,770 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-27 21:53:15,770 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 2751 transitions. [2020-08-27 21:53:15,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2020-08-27 21:53:15,778 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:53:15,778 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:53:15,778 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-27 21:53:15,779 INFO L427 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:53:15,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:53:15,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1986135978, now seen corresponding path program 1 times [2020-08-27 21:53:15,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:53:15,780 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [502297911] [2020-08-27 21:53:15,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:53:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-27 21:53:15,856 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-27 21:53:15,857 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-27 21:53:15,867 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-27 21:53:15,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 09:53:15 BoogieIcfgContainer [2020-08-27 21:53:15,942 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-27 21:53:15,949 INFO L168 Benchmark]: Toolchain (without parser) took 29201.61 ms. Allocated memory was 138.9 MB in the beginning and 610.8 MB in the end (delta: 471.9 MB). Free memory was 100.7 MB in the beginning and 362.3 MB in the end (delta: -261.5 MB). Peak memory consumption was 210.3 MB. Max. memory is 7.1 GB. [2020-08-27 21:53:15,950 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-08-27 21:53:15,951 INFO L168 Benchmark]: CACSL2BoogieTranslator took 839.65 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 100.5 MB in the beginning and 171.2 MB in the end (delta: -70.7 MB). Peak memory consumption was 35.5 MB. Max. memory is 7.1 GB. [2020-08-27 21:53:15,951 INFO L168 Benchmark]: Boogie Preprocessor took 129.06 ms. Allocated memory is still 204.5 MB. Free memory was 171.2 MB in the beginning and 166.2 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. [2020-08-27 21:53:15,952 INFO L168 Benchmark]: RCFGBuilder took 1341.27 ms. Allocated memory was 204.5 MB in the beginning and 235.9 MB in the end (delta: 31.5 MB). Free memory was 166.2 MB in the beginning and 181.2 MB in the end (delta: -15.0 MB). Peak memory consumption was 85.0 MB. Max. memory is 7.1 GB. [2020-08-27 21:53:15,953 INFO L168 Benchmark]: TraceAbstraction took 26885.89 ms. Allocated memory was 235.9 MB in the beginning and 610.8 MB in the end (delta: 374.9 MB). Free memory was 179.7 MB in the beginning and 362.3 MB in the end (delta: -182.5 MB). Peak memory consumption was 192.3 MB. Max. memory is 7.1 GB. [2020-08-27 21:53:15,956 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.23 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 839.65 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 100.5 MB in the beginning and 171.2 MB in the end (delta: -70.7 MB). Peak memory consumption was 35.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.06 ms. Allocated memory is still 204.5 MB. Free memory was 171.2 MB in the beginning and 166.2 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1341.27 ms. Allocated memory was 204.5 MB in the beginning and 235.9 MB in the end (delta: 31.5 MB). Free memory was 166.2 MB in the beginning and 181.2 MB in the end (delta: -15.0 MB). Peak memory consumption was 85.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26885.89 ms. Allocated memory was 235.9 MB in the beginning and 610.8 MB in the end (delta: 374.9 MB). Free memory was 179.7 MB in the beginning and 362.3 MB in the end (delta: -182.5 MB). Peak memory consumption was 192.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 422]: 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 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 TRUE (((((((!(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)) [L279] a20 = 1 [L280] a8 = 13 [L281] a16 = 4 [L282] a7 = 0 [L283] a21 = 1 [L284] a17 = 0 [L285] 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 FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L415] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L418] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L421] COND TRUE ((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)) [L422] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 207 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 26.7s, OverallIterations: 13, TraceHistogramMax: 5, AutomataDifference: 21.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 343 SDtfs, 5727 SDslu, 458 SDs, 0 SdLazy, 10597 SolverSat, 1610 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 199 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2411occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 2040 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1937 NumberOfCodeBlocks, 1937 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1657 ConstructedInterpolants, 0 QuantifiedInterpolants, 1020268 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 744/763 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...