/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_label56.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-eb0fd7c [2020-09-21 10:23:06,042 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-21 10:23:06,047 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-21 10:23:06,096 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-21 10:23:06,097 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-21 10:23:06,109 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-21 10:23:06,110 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-21 10:23:06,113 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-21 10:23:06,117 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-21 10:23:06,121 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-21 10:23:06,122 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-21 10:23:06,125 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-21 10:23:06,125 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-21 10:23:06,128 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-21 10:23:06,131 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-21 10:23:06,133 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-21 10:23:06,135 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-21 10:23:06,137 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-21 10:23:06,139 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-21 10:23:06,147 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-21 10:23:06,150 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-21 10:23:06,151 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-21 10:23:06,152 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-21 10:23:06,153 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-21 10:23:06,158 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-21 10:23:06,159 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-21 10:23:06,159 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-21 10:23:06,162 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-21 10:23:06,163 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-21 10:23:06,165 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-21 10:23:06,165 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-21 10:23:06,166 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-21 10:23:06,167 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-21 10:23:06,168 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-21 10:23:06,169 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-21 10:23:06,169 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-21 10:23:06,170 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-21 10:23:06,170 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-21 10:23:06,171 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-21 10:23:06,172 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-21 10:23:06,173 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-21 10:23:06,174 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-09-21 10:23:06,226 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-21 10:23:06,227 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-21 10:23:06,229 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-21 10:23:06,229 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-21 10:23:06,230 INFO L138 SettingsManager]: * Use SBE=true [2020-09-21 10:23:06,230 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-21 10:23:06,230 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-21 10:23:06,231 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-21 10:23:06,231 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-21 10:23:06,231 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-21 10:23:06,232 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-21 10:23:06,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-21 10:23:06,233 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-21 10:23:06,233 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-21 10:23:06,233 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-21 10:23:06,234 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-21 10:23:06,234 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-21 10:23:06,234 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-21 10:23:06,234 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-21 10:23:06,235 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-21 10:23:06,235 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-21 10:23:06,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 10:23:06,235 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-21 10:23:06,235 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-21 10:23:06,236 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-21 10:23:06,236 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-21 10:23:06,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-21 10:23:06,236 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-21 10:23:06,236 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-21 10:23:06,236 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-09-21 10:23:06,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-21 10:23:06,690 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-21 10:23:06,695 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-21 10:23:06,697 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-21 10:23:06,697 INFO L275 PluginConnector]: CDTParser initialized [2020-09-21 10:23:06,698 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label56.c [2020-09-21 10:23:06,798 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/abba7cac5/76b1498d12514395a743b4ad351716fc/FLAGd7bedf92f [2020-09-21 10:23:07,444 INFO L306 CDTParser]: Found 1 translation units. [2020-09-21 10:23:07,449 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem01_label56.c [2020-09-21 10:23:07,472 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/abba7cac5/76b1498d12514395a743b4ad351716fc/FLAGd7bedf92f [2020-09-21 10:23:07,704 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/abba7cac5/76b1498d12514395a743b4ad351716fc [2020-09-21 10:23:07,723 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-21 10:23:07,729 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-21 10:23:07,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-21 10:23:07,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-21 10:23:07,738 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-21 10:23:07,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:23:07" (1/1) ... [2020-09-21 10:23:07,744 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4734e8fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:23:07, skipping insertion in model container [2020-09-21 10:23:07,745 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:23:07" (1/1) ... [2020-09-21 10:23:07,755 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-21 10:23:07,826 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-21 10:23:08,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:23:08,303 INFO L203 MainTranslator]: Completed pre-run [2020-09-21 10:23:08,619 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:23:08,641 INFO L208 MainTranslator]: Completed translation [2020-09-21 10:23:08,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:23:08 WrapperNode [2020-09-21 10:23:08,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-21 10:23:08,645 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-21 10:23:08,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-21 10:23:08,645 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-21 10:23:08,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:23:08" (1/1) ... [2020-09-21 10:23:08,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:23:08" (1/1) ... [2020-09-21 10:23:08,693 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:23:08" (1/1) ... [2020-09-21 10:23:08,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:23:08" (1/1) ... [2020-09-21 10:23:08,745 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:23:08" (1/1) ... [2020-09-21 10:23:08,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:23:08" (1/1) ... [2020-09-21 10:23:08,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:23:08" (1/1) ... [2020-09-21 10:23:08,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-21 10:23:08,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-21 10:23:08,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-21 10:23:08,770 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-21 10:23:08,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:23:08" (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-09-21 10:23:08,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-21 10:23:08,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-21 10:23:08,845 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-09-21 10:23:08,845 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-21 10:23:08,845 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-09-21 10:23:08,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-21 10:23:08,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-21 10:23:08,846 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-21 10:23:08,846 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-21 10:23:08,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-21 10:23:08,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-21 10:23:10,044 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-21 10:23:10,044 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-21 10:23:10,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:23:10 BoogieIcfgContainer [2020-09-21 10:23:10,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-21 10:23:10,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-21 10:23:10,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-21 10:23:10,058 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-21 10:23:10,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 10:23:07" (1/3) ... [2020-09-21 10:23:10,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6bd996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:23:10, skipping insertion in model container [2020-09-21 10:23:10,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:23:08" (2/3) ... [2020-09-21 10:23:10,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6bd996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:23:10, skipping insertion in model container [2020-09-21 10:23:10,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:23:10" (3/3) ... [2020-09-21 10:23:10,062 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label56.c [2020-09-21 10:23:10,075 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-21 10:23:10,086 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-21 10:23:10,111 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-21 10:23:10,145 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-21 10:23:10,146 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-21 10:23:10,146 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-21 10:23:10,146 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-21 10:23:10,146 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-21 10:23:10,147 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-21 10:23:10,147 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-21 10:23:10,147 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-21 10:23:10,177 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2020-09-21 10:23:10,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-09-21 10:23:10,189 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:23:10,191 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] [2020-09-21 10:23:10,191 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:23:10,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:23:10,201 INFO L82 PathProgramCache]: Analyzing trace with hash -503641322, now seen corresponding path program 1 times [2020-09-21 10:23:10,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:23:10,213 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [242390309] [2020-09-21 10:23:10,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:23:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:10,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:23:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:10,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:23:10,848 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [242390309] [2020-09-21 10:23:10,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:23:10,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-21 10:23:10,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493303631] [2020-09-21 10:23:10,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:23:10,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:23:10,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:23:10,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:23:10,883 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 5 states. [2020-09-21 10:23:13,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:23:13,318 INFO L93 Difference]: Finished difference Result 698 states and 1233 transitions. [2020-09-21 10:23:13,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-21 10:23:13,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2020-09-21 10:23:13,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:23:13,354 INFO L225 Difference]: With dead ends: 698 [2020-09-21 10:23:13,355 INFO L226 Difference]: Without dead ends: 423 [2020-09-21 10:23:13,363 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:23:13,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2020-09-21 10:23:13,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 417. [2020-09-21 10:23:13,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2020-09-21 10:23:13,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 603 transitions. [2020-09-21 10:23:13,471 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 603 transitions. Word has length 82 [2020-09-21 10:23:13,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:23:13,472 INFO L479 AbstractCegarLoop]: Abstraction has 417 states and 603 transitions. [2020-09-21 10:23:13,472 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:23:13,473 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 603 transitions. [2020-09-21 10:23:13,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-09-21 10:23:13,479 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:23:13,480 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] [2020-09-21 10:23:13,480 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-21 10:23:13,481 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:23:13,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:23:13,481 INFO L82 PathProgramCache]: Analyzing trace with hash 613251555, now seen corresponding path program 1 times [2020-09-21 10:23:13,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:23:13,482 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [905750882] [2020-09-21 10:23:13,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:23:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:13,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:23:13,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:13,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 10:23:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:13,774 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:23:13,775 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [905750882] [2020-09-21 10:23:13,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:23:13,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-21 10:23:13,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652231782] [2020-09-21 10:23:13,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:23:13,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:23:13,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:23:13,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:23:13,779 INFO L87 Difference]: Start difference. First operand 417 states and 603 transitions. Second operand 5 states. [2020-09-21 10:23:15,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:23:15,069 INFO L93 Difference]: Finished difference Result 1245 states and 1837 transitions. [2020-09-21 10:23:15,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:23:15,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2020-09-21 10:23:15,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:23:15,076 INFO L225 Difference]: With dead ends: 1245 [2020-09-21 10:23:15,076 INFO L226 Difference]: Without dead ends: 834 [2020-09-21 10:23:15,079 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:23:15,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2020-09-21 10:23:15,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 693. [2020-09-21 10:23:15,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2020-09-21 10:23:15,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 960 transitions. [2020-09-21 10:23:15,135 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 960 transitions. Word has length 99 [2020-09-21 10:23:15,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:23:15,136 INFO L479 AbstractCegarLoop]: Abstraction has 693 states and 960 transitions. [2020-09-21 10:23:15,136 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:23:15,137 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 960 transitions. [2020-09-21 10:23:15,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-09-21 10:23:15,158 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:23:15,158 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-21 10:23:15,159 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-21 10:23:15,159 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:23:15,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:23:15,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1223806666, now seen corresponding path program 1 times [2020-09-21 10:23:15,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:23:15,160 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1247288864] [2020-09-21 10:23:15,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:23:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:15,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:23:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:15,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 10:23:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:15,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-21 10:23:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:15,498 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-21 10:23:15,498 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1247288864] [2020-09-21 10:23:15,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:23:15,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 10:23:15,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479869369] [2020-09-21 10:23:15,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 10:23:15,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:23:15,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 10:23:15,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:23:15,501 INFO L87 Difference]: Start difference. First operand 693 states and 960 transitions. Second operand 7 states. [2020-09-21 10:23:16,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:23:16,988 INFO L93 Difference]: Finished difference Result 1690 states and 2417 transitions. [2020-09-21 10:23:16,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-21 10:23:16,990 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 136 [2020-09-21 10:23:16,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:23:17,000 INFO L225 Difference]: With dead ends: 1690 [2020-09-21 10:23:17,001 INFO L226 Difference]: Without dead ends: 1003 [2020-09-21 10:23:17,003 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 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-09-21 10:23:17,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2020-09-21 10:23:17,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 838. [2020-09-21 10:23:17,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2020-09-21 10:23:17,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1143 transitions. [2020-09-21 10:23:17,057 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1143 transitions. Word has length 136 [2020-09-21 10:23:17,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:23:17,057 INFO L479 AbstractCegarLoop]: Abstraction has 838 states and 1143 transitions. [2020-09-21 10:23:17,058 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 10:23:17,058 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1143 transitions. [2020-09-21 10:23:17,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-09-21 10:23:17,064 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:23:17,064 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-21 10:23:17,065 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-21 10:23:17,065 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:23:17,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:23:17,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1817929918, now seen corresponding path program 1 times [2020-09-21 10:23:17,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:23:17,066 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1997054478] [2020-09-21 10:23:17,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:23:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:17,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:23:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:17,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 10:23:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:17,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:23:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:17,406 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 52 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-21 10:23:17,407 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1997054478] [2020-09-21 10:23:17,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:23:17,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-21 10:23:17,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109133166] [2020-09-21 10:23:17,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-21 10:23:17,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:23:17,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-21 10:23:17,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:23:17,409 INFO L87 Difference]: Start difference. First operand 838 states and 1143 transitions. Second operand 8 states. [2020-09-21 10:23:18,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:23:18,988 INFO L93 Difference]: Finished difference Result 2260 states and 3152 transitions. [2020-09-21 10:23:18,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-21 10:23:18,989 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 140 [2020-09-21 10:23:18,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:23:19,001 INFO L225 Difference]: With dead ends: 2260 [2020-09-21 10:23:19,001 INFO L226 Difference]: Without dead ends: 1428 [2020-09-21 10:23:19,005 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 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-09-21 10:23:19,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-09-21 10:23:19,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1281. [2020-09-21 10:23:19,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1281 states. [2020-09-21 10:23:19,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1678 transitions. [2020-09-21 10:23:19,074 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1678 transitions. Word has length 140 [2020-09-21 10:23:19,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:23:19,075 INFO L479 AbstractCegarLoop]: Abstraction has 1281 states and 1678 transitions. [2020-09-21 10:23:19,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-21 10:23:19,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1678 transitions. [2020-09-21 10:23:19,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-09-21 10:23:19,087 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:23:19,088 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:23:19,088 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-21 10:23:19,088 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:23:19,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:23:19,089 INFO L82 PathProgramCache]: Analyzing trace with hash -623709673, now seen corresponding path program 1 times [2020-09-21 10:23:19,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:23:19,090 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [546114616] [2020-09-21 10:23:19,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:23:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:19,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:23:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:19,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 10:23:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:19,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-21 10:23:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:19,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-21 10:23:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:19,339 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 72 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-09-21 10:23:19,340 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [546114616] [2020-09-21 10:23:19,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:23:19,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 10:23:19,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224012799] [2020-09-21 10:23:19,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 10:23:19,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:23:19,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 10:23:19,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:23:19,342 INFO L87 Difference]: Start difference. First operand 1281 states and 1678 transitions. Second operand 7 states. [2020-09-21 10:23:20,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:23:20,695 INFO L93 Difference]: Finished difference Result 2584 states and 3414 transitions. [2020-09-21 10:23:20,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-21 10:23:20,695 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 151 [2020-09-21 10:23:20,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:23:20,703 INFO L225 Difference]: With dead ends: 2584 [2020-09-21 10:23:20,703 INFO L226 Difference]: Without dead ends: 1309 [2020-09-21 10:23:20,707 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 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-09-21 10:23:20,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2020-09-21 10:23:20,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1152. [2020-09-21 10:23:20,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2020-09-21 10:23:20,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1510 transitions. [2020-09-21 10:23:20,745 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1510 transitions. Word has length 151 [2020-09-21 10:23:20,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:23:20,746 INFO L479 AbstractCegarLoop]: Abstraction has 1152 states and 1510 transitions. [2020-09-21 10:23:20,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 10:23:20,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1510 transitions. [2020-09-21 10:23:20,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-09-21 10:23:20,751 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:23:20,751 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2020-09-21 10:23:20,751 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-21 10:23:20,751 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:23:20,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:23:20,752 INFO L82 PathProgramCache]: Analyzing trace with hash 752268368, now seen corresponding path program 1 times [2020-09-21 10:23:20,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:23:20,752 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1632877929] [2020-09-21 10:23:20,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:23:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:20,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:23:20,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:20,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 10:23:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:20,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-21 10:23:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:20,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-09-21 10:23:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:20,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-09-21 10:23:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:21,042 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 93 proven. 37 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-21 10:23:21,042 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1632877929] [2020-09-21 10:23:21,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:23:21,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 10:23:21,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585606467] [2020-09-21 10:23:21,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 10:23:21,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:23:21,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 10:23:21,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:23:21,048 INFO L87 Difference]: Start difference. First operand 1152 states and 1510 transitions. Second operand 7 states. [2020-09-21 10:23:22,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:23:22,583 INFO L93 Difference]: Finished difference Result 3047 states and 4152 transitions. [2020-09-21 10:23:22,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-21 10:23:22,584 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 174 [2020-09-21 10:23:22,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:23:22,597 INFO L225 Difference]: With dead ends: 3047 [2020-09-21 10:23:22,597 INFO L226 Difference]: Without dead ends: 1901 [2020-09-21 10:23:22,602 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 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-09-21 10:23:22,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2020-09-21 10:23:22,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1873. [2020-09-21 10:23:22,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1873 states. [2020-09-21 10:23:22,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 2413 transitions. [2020-09-21 10:23:22,666 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 2413 transitions. Word has length 174 [2020-09-21 10:23:22,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:23:22,666 INFO L479 AbstractCegarLoop]: Abstraction has 1873 states and 2413 transitions. [2020-09-21 10:23:22,667 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 10:23:22,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2413 transitions. [2020-09-21 10:23:22,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-09-21 10:23:22,674 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:23:22,674 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-09-21 10:23:22,674 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-21 10:23:22,675 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:23:22,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:23:22,675 INFO L82 PathProgramCache]: Analyzing trace with hash 300051243, now seen corresponding path program 1 times [2020-09-21 10:23:22,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:23:22,676 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1549239883] [2020-09-21 10:23:22,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:23:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:22,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:23:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:22,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 10:23:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:22,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-21 10:23:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:22,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-21 10:23:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:23,084 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 98 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-21 10:23:23,084 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1549239883] [2020-09-21 10:23:23,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:23:23,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 10:23:23,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255839473] [2020-09-21 10:23:23,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 10:23:23,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:23:23,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 10:23:23,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:23:23,088 INFO L87 Difference]: Start difference. First operand 1873 states and 2413 transitions. Second operand 7 states. [2020-09-21 10:23:24,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:23:24,860 INFO L93 Difference]: Finished difference Result 4296 states and 5621 transitions. [2020-09-21 10:23:24,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-21 10:23:24,860 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 173 [2020-09-21 10:23:24,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:23:24,875 INFO L225 Difference]: With dead ends: 4296 [2020-09-21 10:23:24,876 INFO L226 Difference]: Without dead ends: 2564 [2020-09-21 10:23:24,881 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-09-21 10:23:24,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2020-09-21 10:23:24,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2562. [2020-09-21 10:23:24,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2562 states. [2020-09-21 10:23:24,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 3212 transitions. [2020-09-21 10:23:24,995 INFO L78 Accepts]: Start accepts. Automaton has 2562 states and 3212 transitions. Word has length 173 [2020-09-21 10:23:24,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:23:24,995 INFO L479 AbstractCegarLoop]: Abstraction has 2562 states and 3212 transitions. [2020-09-21 10:23:24,996 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 10:23:24,996 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 3212 transitions. [2020-09-21 10:23:25,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2020-09-21 10:23:25,003 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:23:25,004 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-09-21 10:23:25,004 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-21 10:23:25,004 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:23:25,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:23:25,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1578325538, now seen corresponding path program 1 times [2020-09-21 10:23:25,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:23:25,006 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1966393149] [2020-09-21 10:23:25,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:23:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:25,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:23:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:25,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 10:23:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:25,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-21 10:23:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:25,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-09-21 10:23:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:25,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-21 10:23:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:25,298 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 140 proven. 54 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2020-09-21 10:23:25,299 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1966393149] [2020-09-21 10:23:25,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:23:25,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 10:23:25,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831304525] [2020-09-21 10:23:25,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 10:23:25,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:23:25,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 10:23:25,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:23:25,301 INFO L87 Difference]: Start difference. First operand 2562 states and 3212 transitions. Second operand 7 states. [2020-09-21 10:23:26,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:23:26,956 INFO L93 Difference]: Finished difference Result 5402 states and 6847 transitions. [2020-09-21 10:23:26,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-21 10:23:26,957 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 210 [2020-09-21 10:23:26,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:23:26,974 INFO L225 Difference]: With dead ends: 5402 [2020-09-21 10:23:26,974 INFO L226 Difference]: Without dead ends: 2981 [2020-09-21 10:23:26,983 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 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-09-21 10:23:26,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2020-09-21 10:23:27,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 2977. [2020-09-21 10:23:27,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2977 states. [2020-09-21 10:23:27,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2977 states to 2977 states and 3718 transitions. [2020-09-21 10:23:27,072 INFO L78 Accepts]: Start accepts. Automaton has 2977 states and 3718 transitions. Word has length 210 [2020-09-21 10:23:27,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:23:27,076 INFO L479 AbstractCegarLoop]: Abstraction has 2977 states and 3718 transitions. [2020-09-21 10:23:27,076 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 10:23:27,076 INFO L276 IsEmpty]: Start isEmpty. Operand 2977 states and 3718 transitions. [2020-09-21 10:23:27,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2020-09-21 10:23:27,088 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:23:27,088 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:23:27,088 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-21 10:23:27,088 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:23:27,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:23:27,091 INFO L82 PathProgramCache]: Analyzing trace with hash 765637946, now seen corresponding path program 1 times [2020-09-21 10:23:27,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:23:27,092 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [817359452] [2020-09-21 10:23:27,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:23:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:27,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:23:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:27,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 10:23:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:27,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-21 10:23:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:27,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-09-21 10:23:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:27,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-21 10:23:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:27,489 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 165 proven. 57 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2020-09-21 10:23:27,489 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [817359452] [2020-09-21 10:23:27,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:23:27,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-21 10:23:27,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774008781] [2020-09-21 10:23:27,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-21 10:23:27,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:23:27,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-21 10:23:27,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-09-21 10:23:27,496 INFO L87 Difference]: Start difference. First operand 2977 states and 3718 transitions. Second operand 9 states. [2020-09-21 10:23:31,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:23:31,714 INFO L93 Difference]: Finished difference Result 7305 states and 9384 transitions. [2020-09-21 10:23:31,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-21 10:23:31,717 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 224 [2020-09-21 10:23:31,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:23:31,742 INFO L225 Difference]: With dead ends: 7305 [2020-09-21 10:23:31,742 INFO L226 Difference]: Without dead ends: 4469 [2020-09-21 10:23:31,752 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2020-09-21 10:23:31,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4469 states. [2020-09-21 10:23:31,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4469 to 4459. [2020-09-21 10:23:31,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4459 states. [2020-09-21 10:23:31,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4459 states to 4459 states and 5645 transitions. [2020-09-21 10:23:31,948 INFO L78 Accepts]: Start accepts. Automaton has 4459 states and 5645 transitions. Word has length 224 [2020-09-21 10:23:31,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:23:31,949 INFO L479 AbstractCegarLoop]: Abstraction has 4459 states and 5645 transitions. [2020-09-21 10:23:31,949 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-21 10:23:31,949 INFO L276 IsEmpty]: Start isEmpty. Operand 4459 states and 5645 transitions. [2020-09-21 10:23:31,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2020-09-21 10:23:31,971 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:23:31,971 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:23:31,972 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-21 10:23:31,972 INFO L427 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:23:31,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:23:31,972 INFO L82 PathProgramCache]: Analyzing trace with hash -443844938, now seen corresponding path program 1 times [2020-09-21 10:23:31,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:23:31,973 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1188028327] [2020-09-21 10:23:31,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:23:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:32,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:23:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:32,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 10:23:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:32,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-21 10:23:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:32,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2020-09-21 10:23:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:32,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-09-21 10:23:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:32,458 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 189 proven. 27 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-09-21 10:23:32,459 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1188028327] [2020-09-21 10:23:32,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:23:32,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-21 10:23:32,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486266395] [2020-09-21 10:23:32,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-21 10:23:32,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:23:32,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-21 10:23:32,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:23:32,461 INFO L87 Difference]: Start difference. First operand 4459 states and 5645 transitions. Second operand 10 states. [2020-09-21 10:23:33,419 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2020-09-21 10:23:35,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:23:35,844 INFO L93 Difference]: Finished difference Result 8586 states and 10611 transitions. [2020-09-21 10:23:35,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-21 10:23:35,845 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 254 [2020-09-21 10:23:35,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:23:35,864 INFO L225 Difference]: With dead ends: 8586 [2020-09-21 10:23:35,864 INFO L226 Difference]: Without dead ends: 4268 [2020-09-21 10:23:35,878 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2020-09-21 10:23:35,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4268 states. [2020-09-21 10:23:35,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4268 to 4119. [2020-09-21 10:23:35,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4119 states. [2020-09-21 10:23:35,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4119 states to 4119 states and 4860 transitions. [2020-09-21 10:23:35,993 INFO L78 Accepts]: Start accepts. Automaton has 4119 states and 4860 transitions. Word has length 254 [2020-09-21 10:23:35,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:23:35,993 INFO L479 AbstractCegarLoop]: Abstraction has 4119 states and 4860 transitions. [2020-09-21 10:23:35,994 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-21 10:23:35,994 INFO L276 IsEmpty]: Start isEmpty. Operand 4119 states and 4860 transitions. [2020-09-21 10:23:36,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2020-09-21 10:23:36,012 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:23:36,012 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:23:36,013 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-21 10:23:36,013 INFO L427 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:23:36,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:23:36,013 INFO L82 PathProgramCache]: Analyzing trace with hash 377203419, now seen corresponding path program 1 times [2020-09-21 10:23:36,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:23:36,014 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1570986807] [2020-09-21 10:23:36,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:23:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-21 10:23:36,128 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-21 10:23:36,129 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-21 10:23:36,137 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-21 10:23:36,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 10:23:36 BoogieIcfgContainer [2020-09-21 10:23:36,217 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-21 10:23:36,219 INFO L168 Benchmark]: Toolchain (without parser) took 28494.27 ms. Allocated memory was 141.0 MB in the beginning and 595.6 MB in the end (delta: 454.6 MB). Free memory was 101.2 MB in the beginning and 200.0 MB in the end (delta: -98.8 MB). Peak memory consumption was 355.8 MB. Max. memory is 7.1 GB. [2020-09-21 10:23:36,221 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 141.0 MB. Free memory was 121.3 MB in the beginning and 120.9 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. [2020-09-21 10:23:36,225 INFO L168 Benchmark]: CACSL2BoogieTranslator took 911.26 ms. Allocated memory was 141.0 MB in the beginning and 206.6 MB in the end (delta: 65.5 MB). Free memory was 100.8 MB in the beginning and 172.5 MB in the end (delta: -71.8 MB). Peak memory consumption was 33.9 MB. Max. memory is 7.1 GB. [2020-09-21 10:23:36,226 INFO L168 Benchmark]: Boogie Preprocessor took 124.42 ms. Allocated memory is still 206.6 MB. Free memory was 172.5 MB in the beginning and 167.6 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2020-09-21 10:23:36,229 INFO L168 Benchmark]: RCFGBuilder took 1283.02 ms. Allocated memory was 206.6 MB in the beginning and 238.6 MB in the end (delta: 32.0 MB). Free memory was 167.6 MB in the beginning and 178.4 MB in the end (delta: -10.8 MB). Peak memory consumption was 80.1 MB. Max. memory is 7.1 GB. [2020-09-21 10:23:36,230 INFO L168 Benchmark]: TraceAbstraction took 26163.39 ms. Allocated memory was 238.6 MB in the beginning and 595.6 MB in the end (delta: 357.0 MB). Free memory was 178.4 MB in the beginning and 200.0 MB in the end (delta: -21.6 MB). Peak memory consumption was 335.4 MB. Max. memory is 7.1 GB. [2020-09-21 10:23:36,240 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.22 ms. Allocated memory is still 141.0 MB. Free memory was 121.3 MB in the beginning and 120.9 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 911.26 ms. Allocated memory was 141.0 MB in the beginning and 206.6 MB in the end (delta: 65.5 MB). Free memory was 100.8 MB in the beginning and 172.5 MB in the end (delta: -71.8 MB). Peak memory consumption was 33.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 124.42 ms. Allocated memory is still 206.6 MB. Free memory was 172.5 MB in the beginning and 167.6 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1283.02 ms. Allocated memory was 206.6 MB in the beginning and 238.6 MB in the end (delta: 32.0 MB). Free memory was 167.6 MB in the beginning and 178.4 MB in the end (delta: -10.8 MB). Peak memory consumption was 80.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26163.39 ms. Allocated memory was 238.6 MB in the beginning and 595.6 MB in the end (delta: 357.0 MB). Free memory was 178.4 MB in the beginning and 200.0 MB in the end (delta: -21.6 MB). Peak memory consumption was 335.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 404]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] return 21; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] return 21; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] return 26; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L73] a7 = 1 [L74] a17 = 1 [L75] a21 = 0 [L76] a20 = 1 [L77] a8 = 13 [L78] a16 = 5 [L79] return 26; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND TRUE ((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1))) [L224] a21 = 1 [L225] a8 = 14 [L226] a16 = 4 [L227] a20 = 0 [L228] a7 = 0 [L229] a17 = 0 [L230] return -1; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L403] COND TRUE ((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) [L404] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 207 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 25.9s, OverallIterations: 11, TraceHistogramMax: 6, AutomataDifference: 20.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 319 SDtfs, 5640 SDslu, 522 SDs, 0 SdLazy, 10822 SolverSat, 1906 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4459occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 809 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1910 NumberOfCodeBlocks, 1910 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1633 ConstructedInterpolants, 0 QuantifiedInterpolants, 683973 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 1194/1410 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...