/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/Problem02_label50.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-89f541c [2020-08-27 21:54:16,062 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-27 21:54:16,066 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-27 21:54:16,112 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-27 21:54:16,113 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-27 21:54:16,124 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-27 21:54:16,127 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-27 21:54:16,132 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-27 21:54:16,135 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-27 21:54:16,137 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-27 21:54:16,141 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-27 21:54:16,142 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-27 21:54:16,143 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-27 21:54:16,144 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-27 21:54:16,145 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-27 21:54:16,146 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-27 21:54:16,147 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-27 21:54:16,148 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-27 21:54:16,149 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-27 21:54:16,151 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-27 21:54:16,153 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-27 21:54:16,154 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-27 21:54:16,155 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-27 21:54:16,157 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-27 21:54:16,159 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-27 21:54:16,159 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-27 21:54:16,160 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-27 21:54:16,161 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-27 21:54:16,161 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-27 21:54:16,162 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-27 21:54:16,162 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-27 21:54:16,163 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-27 21:54:16,164 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-27 21:54:16,165 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-27 21:54:16,166 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-27 21:54:16,166 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-27 21:54:16,167 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-27 21:54:16,167 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-27 21:54:16,167 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-27 21:54:16,168 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-27 21:54:16,169 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-27 21:54:16,170 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-27 21:54:16,198 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-27 21:54:16,198 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-27 21:54:16,200 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-27 21:54:16,200 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-27 21:54:16,200 INFO L138 SettingsManager]: * Use SBE=true [2020-08-27 21:54:16,200 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-27 21:54:16,200 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-27 21:54:16,201 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-27 21:54:16,201 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-27 21:54:16,201 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-27 21:54:16,201 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-27 21:54:16,202 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-27 21:54:16,202 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-27 21:54:16,202 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-27 21:54:16,202 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-27 21:54:16,202 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-27 21:54:16,203 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-27 21:54:16,203 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-27 21:54:16,203 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-27 21:54:16,203 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-27 21:54:16,203 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-27 21:54:16,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-27 21:54:16,204 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-27 21:54:16,204 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-27 21:54:16,204 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-27 21:54:16,205 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-27 21:54:16,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-27 21:54:16,205 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-27 21:54:16,205 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-27 21:54:16,205 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> false [2020-08-27 21:54:16,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-27 21:54:16,674 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-27 21:54:16,678 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-27 21:54:16,680 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-27 21:54:16,681 INFO L275 PluginConnector]: CDTParser initialized [2020-08-27 21:54:16,682 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label50.c [2020-08-27 21:54:16,759 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/20a5e8a7a/0bf4664762ff4f0f94594e4bd1f68180/FLAG7fdf43c76 [2020-08-27 21:54:17,457 INFO L306 CDTParser]: Found 1 translation units. [2020-08-27 21:54:17,458 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem02_label50.c [2020-08-27 21:54:17,479 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/20a5e8a7a/0bf4664762ff4f0f94594e4bd1f68180/FLAG7fdf43c76 [2020-08-27 21:54:17,638 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/20a5e8a7a/0bf4664762ff4f0f94594e4bd1f68180 [2020-08-27 21:54:17,654 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-27 21:54:17,657 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-27 21:54:17,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-27 21:54:17,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-27 21:54:17,663 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-27 21:54:17,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:54:17" (1/1) ... [2020-08-27 21:54:17,669 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23bccf0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:54:17, skipping insertion in model container [2020-08-27 21:54:17,670 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:54:17" (1/1) ... [2020-08-27 21:54:17,680 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-27 21:54:17,732 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-27 21:54:18,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-27 21:54:18,239 INFO L203 MainTranslator]: Completed pre-run [2020-08-27 21:54:18,438 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-27 21:54:18,462 INFO L208 MainTranslator]: Completed translation [2020-08-27 21:54:18,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:54:18 WrapperNode [2020-08-27 21:54:18,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-27 21:54:18,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-27 21:54:18,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-27 21:54:18,464 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-27 21:54:18,478 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:54:18" (1/1) ... [2020-08-27 21:54:18,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:54:18" (1/1) ... [2020-08-27 21:54:18,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:54:18" (1/1) ... [2020-08-27 21:54:18,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:54:18" (1/1) ... [2020-08-27 21:54:18,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:54:18" (1/1) ... [2020-08-27 21:54:18,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:54:18" (1/1) ... [2020-08-27 21:54:18,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:54:18" (1/1) ... [2020-08-27 21:54:18,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-27 21:54:18,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-27 21:54:18,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-27 21:54:18,587 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-27 21:54:18,589 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:54:18" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-27 21:54:18,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-27 21:54:18,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-27 21:54:18,657 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-08-27 21:54:18,657 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-27 21:54:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-08-27 21:54:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-27 21:54:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-27 21:54:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-08-27 21:54:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-27 21:54:18,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-27 21:54:18,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-27 21:54:19,873 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-27 21:54:19,874 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-08-27 21:54:19,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:54:19 BoogieIcfgContainer [2020-08-27 21:54:19,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-27 21:54:19,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-27 21:54:19,891 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-27 21:54:19,895 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-27 21:54:19,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 09:54:17" (1/3) ... [2020-08-27 21:54:19,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66ab69bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:54:19, skipping insertion in model container [2020-08-27 21:54:19,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:54:18" (2/3) ... [2020-08-27 21:54:19,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66ab69bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:54:19, skipping insertion in model container [2020-08-27 21:54:19,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:54:19" (3/3) ... [2020-08-27 21:54:19,901 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label50.c [2020-08-27 21:54:19,913 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-27 21:54:19,932 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-27 21:54:19,956 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-27 21:54:19,995 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-27 21:54:19,995 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-27 21:54:19,996 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-27 21:54:19,996 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-27 21:54:19,996 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-27 21:54:19,996 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-27 21:54:19,996 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-27 21:54:19,996 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-27 21:54:20,022 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2020-08-27 21:54:20,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-08-27 21:54:20,033 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:54:20,035 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:54:20,035 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:54:20,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:54:20,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1330544841, now seen corresponding path program 1 times [2020-08-27 21:54:20,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:54:20,051 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1420585179] [2020-08-27 21:54:20,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:54:20,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:54:20,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:54:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:54:20,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-27 21:54:20,671 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1420585179] [2020-08-27 21:54:20,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:54:20,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-08-27 21:54:20,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459809216] [2020-08-27 21:54:20,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-27 21:54:20,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:54:20,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-27 21:54:20,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-27 21:54:20,713 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 5 states. [2020-08-27 21:54:23,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:54:23,168 INFO L93 Difference]: Finished difference Result 813 states and 1406 transitions. [2020-08-27 21:54:23,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-27 21:54:23,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2020-08-27 21:54:23,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:54:23,194 INFO L225 Difference]: With dead ends: 813 [2020-08-27 21:54:23,195 INFO L226 Difference]: Without dead ends: 488 [2020-08-27 21:54:23,206 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-08-27 21:54:23,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2020-08-27 21:54:23,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 481. [2020-08-27 21:54:23,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2020-08-27 21:54:23,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 692 transitions. [2020-08-27 21:54:23,342 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 692 transitions. Word has length 87 [2020-08-27 21:54:23,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:54:23,343 INFO L479 AbstractCegarLoop]: Abstraction has 481 states and 692 transitions. [2020-08-27 21:54:23,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-27 21:54:23,343 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 692 transitions. [2020-08-27 21:54:23,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-08-27 21:54:23,350 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:54:23,351 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:54:23,351 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-27 21:54:23,351 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:54:23,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:54:23,352 INFO L82 PathProgramCache]: Analyzing trace with hash 979586382, now seen corresponding path program 1 times [2020-08-27 21:54:23,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:54:23,352 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [145844786] [2020-08-27 21:54:23,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:54:23,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:54:23,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:54:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:54:23,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-27 21:54:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:54:23,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-27 21:54:23,639 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [145844786] [2020-08-27 21:54:23,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:54:23,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-08-27 21:54:23,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024450105] [2020-08-27 21:54:23,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-27 21:54:23,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:54:23,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-27 21:54:23,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-27 21:54:23,645 INFO L87 Difference]: Start difference. First operand 481 states and 692 transitions. Second operand 5 states. [2020-08-27 21:54:25,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:54:25,036 INFO L93 Difference]: Finished difference Result 1402 states and 2060 transitions. [2020-08-27 21:54:25,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-27 21:54:25,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2020-08-27 21:54:25,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:54:25,047 INFO L225 Difference]: With dead ends: 1402 [2020-08-27 21:54:25,047 INFO L226 Difference]: Without dead ends: 927 [2020-08-27 21:54:25,049 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-08-27 21:54:25,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2020-08-27 21:54:25,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 920. [2020-08-27 21:54:25,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2020-08-27 21:54:25,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1270 transitions. [2020-08-27 21:54:25,112 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1270 transitions. Word has length 95 [2020-08-27 21:54:25,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:54:25,113 INFO L479 AbstractCegarLoop]: Abstraction has 920 states and 1270 transitions. [2020-08-27 21:54:25,113 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-27 21:54:25,113 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1270 transitions. [2020-08-27 21:54:25,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-27 21:54:25,124 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:54:25,124 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:54:25,125 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-27 21:54:25,125 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:54:25,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:54:25,126 INFO L82 PathProgramCache]: Analyzing trace with hash 2096741041, now seen corresponding path program 1 times [2020-08-27 21:54:25,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:54:25,126 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1364213629] [2020-08-27 21:54:25,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:54:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:54:25,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:54:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:54:25,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-27 21:54:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:54:25,351 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-27 21:54:25,352 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1364213629] [2020-08-27 21:54:25,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:54:25,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-27 21:54:25,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281965628] [2020-08-27 21:54:25,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-27 21:54:25,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:54:25,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-27 21:54:25,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-08-27 21:54:25,354 INFO L87 Difference]: Start difference. First operand 920 states and 1270 transitions. Second operand 8 states. [2020-08-27 21:54:27,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:54:27,708 INFO L93 Difference]: Finished difference Result 3686 states and 5429 transitions. [2020-08-27 21:54:27,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-27 21:54:27,709 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 109 [2020-08-27 21:54:27,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:54:27,728 INFO L225 Difference]: With dead ends: 3686 [2020-08-27 21:54:27,728 INFO L226 Difference]: Without dead ends: 2772 [2020-08-27 21:54:27,732 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2020-08-27 21:54:27,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2772 states. [2020-08-27 21:54:27,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2772 to 2711. [2020-08-27 21:54:27,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2711 states. [2020-08-27 21:54:27,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 3731 transitions. [2020-08-27 21:54:27,862 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 3731 transitions. Word has length 109 [2020-08-27 21:54:27,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:54:27,865 INFO L479 AbstractCegarLoop]: Abstraction has 2711 states and 3731 transitions. [2020-08-27 21:54:27,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-27 21:54:27,865 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 3731 transitions. [2020-08-27 21:54:27,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-08-27 21:54:27,878 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:54:27,879 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:54:27,879 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-27 21:54:27,880 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:54:27,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:54:27,880 INFO L82 PathProgramCache]: Analyzing trace with hash -290326403, now seen corresponding path program 1 times [2020-08-27 21:54:27,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:54:27,881 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [371910323] [2020-08-27 21:54:27,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:54:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:54:28,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:54:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:54:28,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-27 21:54:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:54:28,103 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-27 21:54:28,103 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [371910323] [2020-08-27 21:54:28,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:54:28,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-27 21:54:28,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773297118] [2020-08-27 21:54:28,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-27 21:54:28,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:54:28,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-27 21:54:28,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-08-27 21:54:28,107 INFO L87 Difference]: Start difference. First operand 2711 states and 3731 transitions. Second operand 8 states. [2020-08-27 21:54:30,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:54:30,428 INFO L93 Difference]: Finished difference Result 8395 states and 11828 transitions. [2020-08-27 21:54:30,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-27 21:54:30,429 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2020-08-27 21:54:30,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:54:30,460 INFO L225 Difference]: With dead ends: 8395 [2020-08-27 21:54:30,460 INFO L226 Difference]: Without dead ends: 5690 [2020-08-27 21:54:30,470 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2020-08-27 21:54:30,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5690 states. [2020-08-27 21:54:30,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5690 to 5379. [2020-08-27 21:54:30,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5379 states. [2020-08-27 21:54:30,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5379 states to 5379 states and 6882 transitions. [2020-08-27 21:54:30,701 INFO L78 Accepts]: Start accepts. Automaton has 5379 states and 6882 transitions. Word has length 115 [2020-08-27 21:54:30,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:54:30,702 INFO L479 AbstractCegarLoop]: Abstraction has 5379 states and 6882 transitions. [2020-08-27 21:54:30,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-27 21:54:30,702 INFO L276 IsEmpty]: Start isEmpty. Operand 5379 states and 6882 transitions. [2020-08-27 21:54:30,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-08-27 21:54:30,711 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:54:30,711 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:54:30,711 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-27 21:54:30,711 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:54:30,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:54:30,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1866094056, now seen corresponding path program 1 times [2020-08-27 21:54:30,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:54:30,712 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [569205637] [2020-08-27 21:54:30,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:54:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:54:30,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:54:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:54:30,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-27 21:54:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:54:30,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-27 21:54:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:54:30,932 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-08-27 21:54:30,933 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [569205637] [2020-08-27 21:54:30,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:54:30,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-27 21:54:30,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373365143] [2020-08-27 21:54:30,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-27 21:54:30,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:54:30,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-27 21:54:30,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-08-27 21:54:30,935 INFO L87 Difference]: Start difference. First operand 5379 states and 6882 transitions. Second operand 7 states. [2020-08-27 21:54:33,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:54:33,202 INFO L93 Difference]: Finished difference Result 12645 states and 16302 transitions. [2020-08-27 21:54:33,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-27 21:54:33,203 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 122 [2020-08-27 21:54:33,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:54:33,240 INFO L225 Difference]: With dead ends: 12645 [2020-08-27 21:54:33,240 INFO L226 Difference]: Without dead ends: 5501 [2020-08-27 21:54:33,265 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-08-27 21:54:33,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5501 states. [2020-08-27 21:54:33,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5501 to 5059. [2020-08-27 21:54:33,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5059 states. [2020-08-27 21:54:33,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5059 states to 5059 states and 6154 transitions. [2020-08-27 21:54:33,456 INFO L78 Accepts]: Start accepts. Automaton has 5059 states and 6154 transitions. Word has length 122 [2020-08-27 21:54:33,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:54:33,456 INFO L479 AbstractCegarLoop]: Abstraction has 5059 states and 6154 transitions. [2020-08-27 21:54:33,456 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-27 21:54:33,457 INFO L276 IsEmpty]: Start isEmpty. Operand 5059 states and 6154 transitions. [2020-08-27 21:54:33,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-08-27 21:54:33,466 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:54:33,467 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:54:33,468 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-27 21:54:33,468 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:54:33,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:54:33,469 INFO L82 PathProgramCache]: Analyzing trace with hash -196538764, now seen corresponding path program 1 times [2020-08-27 21:54:33,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:54:33,470 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [268414437] [2020-08-27 21:54:33,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:54:33,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:54:33,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:54:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:54:33,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-27 21:54:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:54:33,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-27 21:54:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:54:33,675 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 45 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-27 21:54:33,676 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [268414437] [2020-08-27 21:54:33,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:54:33,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-27 21:54:33,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523316761] [2020-08-27 21:54:33,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-27 21:54:33,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:54:33,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-27 21:54:33,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-27 21:54:33,683 INFO L87 Difference]: Start difference. First operand 5059 states and 6154 transitions. Second operand 7 states. [2020-08-27 21:54:35,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:54:35,958 INFO L93 Difference]: Finished difference Result 9298 states and 11301 transitions. [2020-08-27 21:54:35,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-27 21:54:35,960 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2020-08-27 21:54:35,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:54:35,979 INFO L225 Difference]: With dead ends: 9298 [2020-08-27 21:54:35,979 INFO L226 Difference]: Without dead ends: 4081 [2020-08-27 21:54:35,992 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-08-27 21:54:35,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4081 states. [2020-08-27 21:54:36,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4081 to 3928. [2020-08-27 21:54:36,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3928 states. [2020-08-27 21:54:36,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3928 states to 3928 states and 4511 transitions. [2020-08-27 21:54:36,089 INFO L78 Accepts]: Start accepts. Automaton has 3928 states and 4511 transitions. Word has length 128 [2020-08-27 21:54:36,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:54:36,090 INFO L479 AbstractCegarLoop]: Abstraction has 3928 states and 4511 transitions. [2020-08-27 21:54:36,090 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-27 21:54:36,090 INFO L276 IsEmpty]: Start isEmpty. Operand 3928 states and 4511 transitions. [2020-08-27 21:54:36,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-08-27 21:54:36,101 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:54:36,101 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:54:36,101 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-27 21:54:36,102 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:54:36,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:54:36,102 INFO L82 PathProgramCache]: Analyzing trace with hash 658084568, now seen corresponding path program 1 times [2020-08-27 21:54:36,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:54:36,103 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2111004336] [2020-08-27 21:54:36,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:54:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:54:36,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:54:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:54:36,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-27 21:54:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:54:36,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-27 21:54:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:54:36,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-08-27 21:54:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:54:36,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-08-27 21:54:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:54:36,471 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 52 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-08-27 21:54:36,472 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2111004336] [2020-08-27 21:54:36,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:54:36,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-27 21:54:36,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208375553] [2020-08-27 21:54:36,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-27 21:54:36,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:54:36,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-27 21:54:36,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-08-27 21:54:36,474 INFO L87 Difference]: Start difference. First operand 3928 states and 4511 transitions. Second operand 9 states. [2020-08-27 21:54:38,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:54:38,771 INFO L93 Difference]: Finished difference Result 8012 states and 9274 transitions. [2020-08-27 21:54:38,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-08-27 21:54:38,771 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 141 [2020-08-27 21:54:38,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:54:38,787 INFO L225 Difference]: With dead ends: 8012 [2020-08-27 21:54:38,787 INFO L226 Difference]: Without dead ends: 4086 [2020-08-27 21:54:38,796 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2020-08-27 21:54:38,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4086 states. [2020-08-27 21:54:38,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4086 to 3780. [2020-08-27 21:54:38,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3780 states. [2020-08-27 21:54:38,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3780 states to 3780 states and 4277 transitions. [2020-08-27 21:54:38,897 INFO L78 Accepts]: Start accepts. Automaton has 3780 states and 4277 transitions. Word has length 141 [2020-08-27 21:54:38,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:54:38,898 INFO L479 AbstractCegarLoop]: Abstraction has 3780 states and 4277 transitions. [2020-08-27 21:54:38,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-27 21:54:38,898 INFO L276 IsEmpty]: Start isEmpty. Operand 3780 states and 4277 transitions. [2020-08-27 21:54:38,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2020-08-27 21:54:38,908 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:54:38,909 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-08-27 21:54:38,909 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-27 21:54:38,909 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:54:38,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:54:38,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1262211764, now seen corresponding path program 1 times [2020-08-27 21:54:38,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:54:38,911 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1869233234] [2020-08-27 21:54:38,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:54:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:54:39,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:54:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:54:39,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-27 21:54:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:54:39,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-08-27 21:54:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:54:39,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-08-27 21:54:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:54:39,403 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 120 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-08-27 21:54:39,403 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1869233234] [2020-08-27 21:54:39,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:54:39,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-27 21:54:39,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692846617] [2020-08-27 21:54:39,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-27 21:54:39,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:54:39,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-27 21:54:39,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-08-27 21:54:39,406 INFO L87 Difference]: Start difference. First operand 3780 states and 4277 transitions. Second operand 11 states. [2020-08-27 21:54:41,251 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2020-08-27 21:54:42,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:54:42,675 INFO L93 Difference]: Finished difference Result 7552 states and 8567 transitions. [2020-08-27 21:54:42,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-08-27 21:54:42,676 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 194 [2020-08-27 21:54:42,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:54:42,697 INFO L225 Difference]: With dead ends: 7552 [2020-08-27 21:54:42,697 INFO L226 Difference]: Without dead ends: 2988 [2020-08-27 21:54:42,706 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=180, Invalid=470, Unknown=0, NotChecked=0, Total=650 [2020-08-27 21:54:42,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2988 states. [2020-08-27 21:54:42,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2988 to 2830. [2020-08-27 21:54:42,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2830 states. [2020-08-27 21:54:42,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2830 states to 2830 states and 3030 transitions. [2020-08-27 21:54:42,767 INFO L78 Accepts]: Start accepts. Automaton has 2830 states and 3030 transitions. Word has length 194 [2020-08-27 21:54:42,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:54:42,767 INFO L479 AbstractCegarLoop]: Abstraction has 2830 states and 3030 transitions. [2020-08-27 21:54:42,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-27 21:54:42,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2830 states and 3030 transitions. [2020-08-27 21:54:42,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2020-08-27 21:54:42,774 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:54:42,775 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-08-27 21:54:42,775 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-27 21:54:42,775 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:54:42,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:54:42,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1694040566, now seen corresponding path program 1 times [2020-08-27 21:54:42,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:54:42,776 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [962410639] [2020-08-27 21:54:42,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:54:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-27 21:54:42,849 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-27 21:54:42,849 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-27 21:54:42,858 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-27 21:54:42,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 09:54:42 BoogieIcfgContainer [2020-08-27 21:54:42,938 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-27 21:54:42,948 INFO L168 Benchmark]: Toolchain (without parser) took 25284.87 ms. Allocated memory was 139.5 MB in the beginning and 592.4 MB in the end (delta: 453.0 MB). Free memory was 101.6 MB in the beginning and 342.4 MB in the end (delta: -240.8 MB). Peak memory consumption was 212.2 MB. Max. memory is 7.1 GB. [2020-08-27 21:54:42,950 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-08-27 21:54:42,951 INFO L168 Benchmark]: CACSL2BoogieTranslator took 804.77 ms. Allocated memory was 139.5 MB in the beginning and 205.0 MB in the end (delta: 65.5 MB). Free memory was 101.4 MB in the beginning and 171.9 MB in the end (delta: -70.5 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2020-08-27 21:54:42,952 INFO L168 Benchmark]: Boogie Preprocessor took 122.65 ms. Allocated memory is still 205.0 MB. Free memory was 171.9 MB in the beginning and 167.0 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2020-08-27 21:54:42,956 INFO L168 Benchmark]: RCFGBuilder took 1301.14 ms. Allocated memory was 205.0 MB in the beginning and 237.5 MB in the end (delta: 32.5 MB). Free memory was 167.0 MB in the beginning and 181.7 MB in the end (delta: -14.8 MB). Peak memory consumption was 83.9 MB. Max. memory is 7.1 GB. [2020-08-27 21:54:42,957 INFO L168 Benchmark]: TraceAbstraction took 23048.22 ms. Allocated memory was 237.5 MB in the beginning and 592.4 MB in the end (delta: 354.9 MB). Free memory was 181.7 MB in the beginning and 342.4 MB in the end (delta: -160.7 MB). Peak memory consumption was 194.3 MB. Max. memory is 7.1 GB. [2020-08-27 21:54:42,965 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.20 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 804.77 ms. Allocated memory was 139.5 MB in the beginning and 205.0 MB in the end (delta: 65.5 MB). Free memory was 101.4 MB in the beginning and 171.9 MB in the end (delta: -70.5 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 122.65 ms. Allocated memory is still 205.0 MB. Free memory was 171.9 MB in the beginning and 167.0 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1301.14 ms. Allocated memory was 205.0 MB in the beginning and 237.5 MB in the end (delta: 32.5 MB). Free memory was 167.0 MB in the beginning and 181.7 MB in the end (delta: -14.8 MB). Peak memory consumption was 83.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23048.22 ms. Allocated memory was 237.5 MB in the beginning and 592.4 MB in the end (delta: 354.9 MB). Free memory was 181.7 MB in the beginning and 342.4 MB in the end (delta: -160.7 MB). Peak memory consumption was 194.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 415]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) [L234] COND TRUE ((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))) [L235] a28 = 9 [L236] return 23; [L614] RET, EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) [L394] COND TRUE (((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)) [L395] a19 = 0 [L396] a28 = 7 [L397] return 25; [L614] RET, EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) [L54] COND TRUE ((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1)) [L55] a28 = 7 [L56] a11 = 1 [L57] a25 = 0 [L58] return -1; [L614] RET, EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L414] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8)) [L415] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 236 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 22.8s, OverallIterations: 9, TraceHistogramMax: 5, AutomataDifference: 18.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 314 SDtfs, 6416 SDslu, 487 SDs, 0 SdLazy, 9186 SolverSat, 1634 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5379occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 8 MinimizatonAttempts, 1445 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1220 NumberOfCodeBlocks, 1220 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 983 ConstructedInterpolants, 0 QuantifiedInterpolants, 343276 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 363/399 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...