/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 true --traceabstraction.additional.smt.options enumeration-timeout=5 --traceabstraction.additional.smt.options interpolation-heuristic=HIGHLEXORDER -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label44.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-5644d1e-m [2020-08-18 19:32:06,965 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-18 19:32:06,969 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-18 19:32:07,006 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-18 19:32:07,007 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-18 19:32:07,018 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-18 19:32:07,020 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-18 19:32:07,024 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-18 19:32:07,027 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-18 19:32:07,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-18 19:32:07,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-18 19:32:07,031 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-18 19:32:07,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-18 19:32:07,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-18 19:32:07,035 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-18 19:32:07,038 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-18 19:32:07,040 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-18 19:32:07,043 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-18 19:32:07,046 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-18 19:32:07,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-18 19:32:07,054 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-18 19:32:07,055 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-18 19:32:07,056 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-18 19:32:07,057 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-18 19:32:07,059 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-18 19:32:07,059 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-18 19:32:07,059 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-18 19:32:07,060 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-18 19:32:07,061 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-18 19:32:07,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-18 19:32:07,062 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-18 19:32:07,062 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-18 19:32:07,063 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-18 19:32:07,064 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-18 19:32:07,065 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-18 19:32:07,065 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-18 19:32:07,066 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-18 19:32:07,066 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-18 19:32:07,066 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-18 19:32:07,067 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-18 19:32:07,068 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-18 19:32:07,068 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-18 19:32:07,091 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-18 19:32:07,091 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-18 19:32:07,092 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-18 19:32:07,092 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-18 19:32:07,093 INFO L138 SettingsManager]: * Use SBE=true [2020-08-18 19:32:07,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-18 19:32:07,093 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-18 19:32:07,093 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-18 19:32:07,093 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-18 19:32:07,094 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-18 19:32:07,094 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-18 19:32:07,094 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-18 19:32:07,094 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-18 19:32:07,094 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-18 19:32:07,095 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-18 19:32:07,095 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-18 19:32:07,095 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-18 19:32:07,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-18 19:32:07,095 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-18 19:32:07,096 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-18 19:32:07,096 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-18 19:32:07,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-18 19:32:07,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-18 19:32:07,096 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-18 19:32:07,097 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-18 19:32:07,097 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-18 19:32:07,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-18 19:32:07,097 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-18 19:32:07,097 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-18 19:32:07,098 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 -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=HIGHLEXORDER; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=HIGHLEXORDER; [2020-08-18 19:32:07,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-18 19:32:07,443 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-18 19:32:07,446 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-18 19:32:07,447 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-18 19:32:07,447 INFO L275 PluginConnector]: CDTParser initialized [2020-08-18 19:32:07,448 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label44.c [2020-08-18 19:32:07,527 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2862de1d2/43b3259b6d5a4bb4ab7647429824d674/FLAG403335ec1 [2020-08-18 19:32:08,152 INFO L306 CDTParser]: Found 1 translation units. [2020-08-18 19:32:08,153 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem01_label44.c [2020-08-18 19:32:08,166 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2862de1d2/43b3259b6d5a4bb4ab7647429824d674/FLAG403335ec1 [2020-08-18 19:32:08,385 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2862de1d2/43b3259b6d5a4bb4ab7647429824d674 [2020-08-18 19:32:08,395 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-18 19:32:08,396 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-18 19:32:08,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-18 19:32:08,398 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-18 19:32:08,401 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-18 19:32:08,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 07:32:08" (1/1) ... [2020-08-18 19:32:08,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f3eacf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 07:32:08, skipping insertion in model container [2020-08-18 19:32:08,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 07:32:08" (1/1) ... [2020-08-18 19:32:08,412 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-18 19:32:08,466 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-18 19:32:08,913 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-18 19:32:08,919 INFO L203 MainTranslator]: Completed pre-run [2020-08-18 19:32:09,187 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-18 19:32:09,203 INFO L208 MainTranslator]: Completed translation [2020-08-18 19:32:09,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 07:32:09 WrapperNode [2020-08-18 19:32:09,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-18 19:32:09,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-18 19:32:09,205 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-18 19:32:09,205 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-18 19:32:09,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 07:32:09" (1/1) ... [2020-08-18 19:32:09,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 07:32:09" (1/1) ... [2020-08-18 19:32:09,239 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 07:32:09" (1/1) ... [2020-08-18 19:32:09,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 07:32:09" (1/1) ... [2020-08-18 19:32:09,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 07:32:09" (1/1) ... [2020-08-18 19:32:09,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 07:32:09" (1/1) ... [2020-08-18 19:32:09,303 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 07:32:09" (1/1) ... [2020-08-18 19:32:09,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-18 19:32:09,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-18 19:32:09,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-18 19:32:09,312 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-18 19:32:09,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 07:32:09" (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-18 19:32:09,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-18 19:32:09,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-18 19:32:09,380 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-08-18 19:32:09,380 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-18 19:32:09,380 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-08-18 19:32:09,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-18 19:32:09,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-18 19:32:09,381 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-08-18 19:32:09,381 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-18 19:32:09,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-18 19:32:09,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-18 19:32:10,551 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-18 19:32:10,552 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-08-18 19:32:10,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 07:32:10 BoogieIcfgContainer [2020-08-18 19:32:10,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-18 19:32:10,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-18 19:32:10,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-18 19:32:10,578 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-18 19:32:10,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.08 07:32:08" (1/3) ... [2020-08-18 19:32:10,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d8fa18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.08 07:32:10, skipping insertion in model container [2020-08-18 19:32:10,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 07:32:09" (2/3) ... [2020-08-18 19:32:10,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d8fa18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.08 07:32:10, skipping insertion in model container [2020-08-18 19:32:10,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 07:32:10" (3/3) ... [2020-08-18 19:32:10,586 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label44.c [2020-08-18 19:32:10,599 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-18 19:32:10,613 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-18 19:32:10,632 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-18 19:32:10,674 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-18 19:32:10,675 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-18 19:32:10,675 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-18 19:32:10,676 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-18 19:32:10,676 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-18 19:32:10,676 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-18 19:32:10,676 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-18 19:32:10,676 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-18 19:32:10,706 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2020-08-18 19:32:10,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-08-18 19:32:10,722 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 19:32:10,724 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 19:32:10,724 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 19:32:10,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 19:32:10,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1855725642, now seen corresponding path program 1 times [2020-08-18 19:32:10,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 19:32:10,742 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [338900904] [2020-08-18 19:32:10,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 19:32:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:32:11,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 19:32:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:32:11,386 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-18 19:32:11,387 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [338900904] [2020-08-18 19:32:11,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 19:32:11,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-08-18 19:32:11,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654331589] [2020-08-18 19:32:11,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 19:32:11,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 19:32:11,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 19:32:11,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-18 19:32:11,420 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 5 states. [2020-08-18 19:32:13,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 19:32:13,568 INFO L93 Difference]: Finished difference Result 698 states and 1233 transitions. [2020-08-18 19:32:13,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-18 19:32:13,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2020-08-18 19:32:13,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 19:32:13,591 INFO L225 Difference]: With dead ends: 698 [2020-08-18 19:32:13,591 INFO L226 Difference]: Without dead ends: 423 [2020-08-18 19:32:13,600 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-18 19:32:13,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2020-08-18 19:32:13,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 417. [2020-08-18 19:32:13,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2020-08-18 19:32:13,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 585 transitions. [2020-08-18 19:32:13,698 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 585 transitions. Word has length 90 [2020-08-18 19:32:13,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 19:32:13,699 INFO L479 AbstractCegarLoop]: Abstraction has 417 states and 585 transitions. [2020-08-18 19:32:13,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 19:32:13,699 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 585 transitions. [2020-08-18 19:32:13,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-08-18 19:32:13,705 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 19:32:13,706 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 19:32:13,706 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-18 19:32:13,706 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 19:32:13,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 19:32:13,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1996722829, now seen corresponding path program 1 times [2020-08-18 19:32:13,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 19:32:13,707 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [958966325] [2020-08-18 19:32:13,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 19:32:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:32:13,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 19:32:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:32:13,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 19:32:13,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:32:13,938 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 19:32:13,939 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [958966325] [2020-08-18 19:32:13,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 19:32:13,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-18 19:32:13,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067151640] [2020-08-18 19:32:13,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-18 19:32:13,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 19:32:13,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-18 19:32:13,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-08-18 19:32:13,943 INFO L87 Difference]: Start difference. First operand 417 states and 585 transitions. Second operand 8 states. [2020-08-18 19:32:15,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 19:32:15,414 INFO L93 Difference]: Finished difference Result 1130 states and 1658 transitions. [2020-08-18 19:32:15,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-18 19:32:15,415 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 100 [2020-08-18 19:32:15,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 19:32:15,422 INFO L225 Difference]: With dead ends: 1130 [2020-08-18 19:32:15,423 INFO L226 Difference]: Without dead ends: 719 [2020-08-18 19:32:15,425 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-08-18 19:32:15,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2020-08-18 19:32:15,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 697. [2020-08-18 19:32:15,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2020-08-18 19:32:15,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 978 transitions. [2020-08-18 19:32:15,498 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 978 transitions. Word has length 100 [2020-08-18 19:32:15,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 19:32:15,498 INFO L479 AbstractCegarLoop]: Abstraction has 697 states and 978 transitions. [2020-08-18 19:32:15,498 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-18 19:32:15,499 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 978 transitions. [2020-08-18 19:32:15,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-08-18 19:32:15,504 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 19:32:15,504 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 19:32:15,504 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-18 19:32:15,507 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 19:32:15,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 19:32:15,507 INFO L82 PathProgramCache]: Analyzing trace with hash 2111365455, now seen corresponding path program 1 times [2020-08-18 19:32:15,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 19:32:15,508 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1053154619] [2020-08-18 19:32:15,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 19:32:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:32:15,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 19:32:15,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:32:15,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 19:32:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:32:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 19:32:15,721 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1053154619] [2020-08-18 19:32:15,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 19:32:15,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-08-18 19:32:15,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801897797] [2020-08-18 19:32:15,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 19:32:15,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 19:32:15,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 19:32:15,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-18 19:32:15,723 INFO L87 Difference]: Start difference. First operand 697 states and 978 transitions. Second operand 5 states. [2020-08-18 19:32:16,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 19:32:16,807 INFO L93 Difference]: Finished difference Result 1944 states and 2781 transitions. [2020-08-18 19:32:16,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 19:32:16,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2020-08-18 19:32:16,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 19:32:16,817 INFO L225 Difference]: With dead ends: 1944 [2020-08-18 19:32:16,817 INFO L226 Difference]: Without dead ends: 1253 [2020-08-18 19:32:16,820 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-18 19:32:16,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2020-08-18 19:32:16,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1110. [2020-08-18 19:32:16,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1110 states. [2020-08-18 19:32:16,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1492 transitions. [2020-08-18 19:32:16,871 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1492 transitions. Word has length 101 [2020-08-18 19:32:16,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 19:32:16,872 INFO L479 AbstractCegarLoop]: Abstraction has 1110 states and 1492 transitions. [2020-08-18 19:32:16,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 19:32:16,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1492 transitions. [2020-08-18 19:32:16,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-08-18 19:32:16,877 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 19:32:16,877 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:32:16,878 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-18 19:32:16,878 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 19:32:16,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 19:32:16,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1472223214, now seen corresponding path program 1 times [2020-08-18 19:32:16,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 19:32:16,879 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1430562908] [2020-08-18 19:32:16,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 19:32:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:32:17,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 19:32:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:32:17,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 19:32:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:32:17,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-18 19:32:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:32:17,100 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-18 19:32:17,101 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1430562908] [2020-08-18 19:32:17,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 19:32:17,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 19:32:17,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662811055] [2020-08-18 19:32:17,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 19:32:17,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 19:32:17,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 19:32:17,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-18 19:32:17,105 INFO L87 Difference]: Start difference. First operand 1110 states and 1492 transitions. Second operand 7 states. [2020-08-18 19:32:18,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 19:32:18,395 INFO L93 Difference]: Finished difference Result 2677 states and 3751 transitions. [2020-08-18 19:32:18,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-18 19:32:18,395 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2020-08-18 19:32:18,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 19:32:18,407 INFO L225 Difference]: With dead ends: 2677 [2020-08-18 19:32:18,407 INFO L226 Difference]: Without dead ends: 1573 [2020-08-18 19:32:18,411 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-08-18 19:32:18,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2020-08-18 19:32:18,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1120. [2020-08-18 19:32:18,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1120 states. [2020-08-18 19:32:18,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1503 transitions. [2020-08-18 19:32:18,472 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1503 transitions. Word has length 132 [2020-08-18 19:32:18,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 19:32:18,472 INFO L479 AbstractCegarLoop]: Abstraction has 1120 states and 1503 transitions. [2020-08-18 19:32:18,472 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 19:32:18,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1503 transitions. [2020-08-18 19:32:18,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-08-18 19:32:18,477 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 19:32:18,477 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:32:18,478 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-18 19:32:18,478 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 19:32:18,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 19:32:18,478 INFO L82 PathProgramCache]: Analyzing trace with hash -383347850, now seen corresponding path program 1 times [2020-08-18 19:32:18,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 19:32:18,479 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1013271661] [2020-08-18 19:32:18,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 19:32:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:32:18,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 19:32:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:32:18,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 19:32:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:32:18,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:32:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:32:18,717 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 52 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-18 19:32:18,717 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1013271661] [2020-08-18 19:32:18,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 19:32:18,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 19:32:18,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116317597] [2020-08-18 19:32:18,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 19:32:18,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 19:32:18,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 19:32:18,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-18 19:32:18,720 INFO L87 Difference]: Start difference. First operand 1120 states and 1503 transitions. Second operand 7 states. [2020-08-18 19:32:20,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 19:32:20,030 INFO L93 Difference]: Finished difference Result 2687 states and 3686 transitions. [2020-08-18 19:32:20,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-18 19:32:20,030 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 136 [2020-08-18 19:32:20,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 19:32:20,042 INFO L225 Difference]: With dead ends: 2687 [2020-08-18 19:32:20,042 INFO L226 Difference]: Without dead ends: 1573 [2020-08-18 19:32:20,046 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-08-18 19:32:20,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2020-08-18 19:32:20,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1418. [2020-08-18 19:32:20,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2020-08-18 19:32:20,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 1860 transitions. [2020-08-18 19:32:20,105 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 1860 transitions. Word has length 136 [2020-08-18 19:32:20,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 19:32:20,107 INFO L479 AbstractCegarLoop]: Abstraction has 1418 states and 1860 transitions. [2020-08-18 19:32:20,107 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 19:32:20,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 1860 transitions. [2020-08-18 19:32:20,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-08-18 19:32:20,113 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 19:32:20,113 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 19:32:20,113 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-18 19:32:20,114 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 19:32:20,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 19:32:20,114 INFO L82 PathProgramCache]: Analyzing trace with hash 2012786258, now seen corresponding path program 1 times [2020-08-18 19:32:20,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 19:32:20,115 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [331024539] [2020-08-18 19:32:20,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 19:32:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:32:20,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 19:32:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:32:20,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 19:32:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:32:20,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:32:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:32:20,399 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-08-18 19:32:20,400 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [331024539] [2020-08-18 19:32:20,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 19:32:20,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-08-18 19:32:20,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121810393] [2020-08-18 19:32:20,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 19:32:20,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 19:32:20,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 19:32:20,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-18 19:32:20,412 INFO L87 Difference]: Start difference. First operand 1418 states and 1860 transitions. Second operand 5 states. [2020-08-18 19:32:21,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 19:32:21,425 INFO L93 Difference]: Finished difference Result 3112 states and 4149 transitions. [2020-08-18 19:32:21,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 19:32:21,428 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 154 [2020-08-18 19:32:21,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 19:32:21,437 INFO L225 Difference]: With dead ends: 3112 [2020-08-18 19:32:21,438 INFO L226 Difference]: Without dead ends: 1700 [2020-08-18 19:32:21,442 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-08-18 19:32:21,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2020-08-18 19:32:21,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1696. [2020-08-18 19:32:21,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1696 states. [2020-08-18 19:32:21,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 2210 transitions. [2020-08-18 19:32:21,496 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 2210 transitions. Word has length 154 [2020-08-18 19:32:21,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 19:32:21,496 INFO L479 AbstractCegarLoop]: Abstraction has 1696 states and 2210 transitions. [2020-08-18 19:32:21,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 19:32:21,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2210 transitions. [2020-08-18 19:32:21,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2020-08-18 19:32:21,502 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 19:32:21,503 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 19:32:21,503 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-18 19:32:21,503 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 19:32:21,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 19:32:21,504 INFO L82 PathProgramCache]: Analyzing trace with hash -551051239, now seen corresponding path program 1 times [2020-08-18 19:32:21,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 19:32:21,504 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2062353335] [2020-08-18 19:32:21,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 19:32:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:32:21,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 19:32:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:32:21,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 19:32:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:32:21,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:32:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:32:21,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-08-18 19:32:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:32:21,819 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 83 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-08-18 19:32:21,820 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2062353335] [2020-08-18 19:32:21,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 19:32:21,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 19:32:21,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864993679] [2020-08-18 19:32:21,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 19:32:21,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 19:32:21,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 19:32:21,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-18 19:32:21,823 INFO L87 Difference]: Start difference. First operand 1696 states and 2210 transitions. Second operand 7 states. [2020-08-18 19:32:23,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 19:32:23,048 INFO L93 Difference]: Finished difference Result 3811 states and 4970 transitions. [2020-08-18 19:32:23,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-18 19:32:23,049 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 172 [2020-08-18 19:32:23,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 19:32:23,059 INFO L225 Difference]: With dead ends: 3811 [2020-08-18 19:32:23,059 INFO L226 Difference]: Without dead ends: 2121 [2020-08-18 19:32:23,064 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-08-18 19:32:23,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2020-08-18 19:32:23,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 2113. [2020-08-18 19:32:23,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2113 states. [2020-08-18 19:32:23,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 2113 states and 2688 transitions. [2020-08-18 19:32:23,124 INFO L78 Accepts]: Start accepts. Automaton has 2113 states and 2688 transitions. Word has length 172 [2020-08-18 19:32:23,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 19:32:23,124 INFO L479 AbstractCegarLoop]: Abstraction has 2113 states and 2688 transitions. [2020-08-18 19:32:23,125 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 19:32:23,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 2688 transitions. [2020-08-18 19:32:23,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2020-08-18 19:32:23,132 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 19:32:23,132 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:32:23,132 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-18 19:32:23,133 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 19:32:23,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 19:32:23,133 INFO L82 PathProgramCache]: Analyzing trace with hash -370196920, now seen corresponding path program 1 times [2020-08-18 19:32:23,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 19:32:23,134 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2078542505] [2020-08-18 19:32:23,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 19:32:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:32:23,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 19:32:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:32:23,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 19:32:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:32:23,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-18 19:32:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:32:23,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-08-18 19:32:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:32:23,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2020-08-18 19:32:23,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:32:23,421 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 108 proven. 26 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-08-18 19:32:23,422 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2078542505] [2020-08-18 19:32:23,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 19:32:23,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 19:32:23,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349572214] [2020-08-18 19:32:23,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 19:32:23,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 19:32:23,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 19:32:23,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-18 19:32:23,424 INFO L87 Difference]: Start difference. First operand 2113 states and 2688 transitions. Second operand 7 states. [2020-08-18 19:32:24,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 19:32:24,726 INFO L93 Difference]: Finished difference Result 4111 states and 5313 transitions. [2020-08-18 19:32:24,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-18 19:32:24,727 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 194 [2020-08-18 19:32:24,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 19:32:24,738 INFO L225 Difference]: With dead ends: 4111 [2020-08-18 19:32:24,739 INFO L226 Difference]: Without dead ends: 2139 [2020-08-18 19:32:24,744 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 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-18 19:32:24,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2020-08-18 19:32:24,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 1849. [2020-08-18 19:32:24,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1849 states. [2020-08-18 19:32:24,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2344 transitions. [2020-08-18 19:32:24,800 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 2344 transitions. Word has length 194 [2020-08-18 19:32:24,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 19:32:24,802 INFO L479 AbstractCegarLoop]: Abstraction has 1849 states and 2344 transitions. [2020-08-18 19:32:24,802 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 19:32:24,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2344 transitions. [2020-08-18 19:32:24,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2020-08-18 19:32:24,810 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 19:32:24,811 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 19:32:24,816 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-18 19:32:24,816 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 19:32:24,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 19:32:24,816 INFO L82 PathProgramCache]: Analyzing trace with hash 162442639, now seen corresponding path program 1 times [2020-08-18 19:32:24,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 19:32:24,817 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1073250558] [2020-08-18 19:32:24,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 19:32:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-18 19:32:24,913 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-18 19:32:24,913 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-18 19:32:24,923 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-18 19:32:24,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.08 07:32:24 BoogieIcfgContainer [2020-08-18 19:32:24,989 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-18 19:32:24,999 INFO L168 Benchmark]: Toolchain (without parser) took 16595.20 ms. Allocated memory was 138.4 MB in the beginning and 438.3 MB in the end (delta: 299.9 MB). Free memory was 100.4 MB in the beginning and 132.8 MB in the end (delta: -32.5 MB). Peak memory consumption was 267.4 MB. Max. memory is 7.1 GB. [2020-08-18 19:32:25,000 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 138.4 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-08-18 19:32:25,002 INFO L168 Benchmark]: CACSL2BoogieTranslator took 807.31 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 100.2 MB in the beginning and 169.9 MB in the end (delta: -69.7 MB). Peak memory consumption was 35.7 MB. Max. memory is 7.1 GB. [2020-08-18 19:32:25,003 INFO L168 Benchmark]: Boogie Preprocessor took 105.96 ms. Allocated memory is still 203.4 MB. Free memory was 169.9 MB in the beginning and 164.2 MB in the end (delta: 5.7 MB). Peak memory consumption was 5.7 MB. Max. memory is 7.1 GB. [2020-08-18 19:32:25,004 INFO L168 Benchmark]: RCFGBuilder took 1257.81 ms. Allocated memory was 203.4 MB in the beginning and 234.9 MB in the end (delta: 31.5 MB). Free memory was 164.2 MB in the beginning and 178.7 MB in the end (delta: -14.5 MB). Peak memory consumption was 84.2 MB. Max. memory is 7.1 GB. [2020-08-18 19:32:25,008 INFO L168 Benchmark]: TraceAbstraction took 14418.89 ms. Allocated memory was 234.9 MB in the beginning and 438.3 MB in the end (delta: 203.4 MB). Free memory was 178.7 MB in the beginning and 132.8 MB in the end (delta: 45.9 MB). Peak memory consumption was 249.3 MB. Max. memory is 7.1 GB. [2020-08-18 19:32:25,017 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 138.4 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 807.31 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 100.2 MB in the beginning and 169.9 MB in the end (delta: -69.7 MB). Peak memory consumption was 35.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 105.96 ms. Allocated memory is still 203.4 MB. Free memory was 169.9 MB in the beginning and 164.2 MB in the end (delta: 5.7 MB). Peak memory consumption was 5.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1257.81 ms. Allocated memory was 203.4 MB in the beginning and 234.9 MB in the end (delta: 31.5 MB). Free memory was 164.2 MB in the beginning and 178.7 MB in the end (delta: -14.5 MB). Peak memory consumption was 84.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14418.89 ms. Allocated memory was 234.9 MB in the beginning and 438.3 MB in the end (delta: 203.4 MB). Free memory was 178.7 MB in the beginning and 132.8 MB in the end (delta: 45.9 MB). Peak memory consumption was 249.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 428]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND TRUE (((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8)) [L32] a16 = 5 [L33] a20 = 0 [L34] return 24; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L265] COND TRUE ((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15))) [L266] a17 = 0 [L267] return 24; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) [L312] COND TRUE ((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5)) [L313] a8 = 13 [L314] a16 = 4 [L315] return -1; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L403] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L406] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L409] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L412] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L415] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L418] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L421] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L424] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L427] COND TRUE ((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)) [L428] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 207 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.2s, OverallIterations: 9, TraceHistogramMax: 5, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 200 SDtfs, 3935 SDslu, 274 SDs, 0 SdLazy, 5484 SolverSat, 1154 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2113occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 1081 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1285 NumberOfCodeBlocks, 1285 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1071 ConstructedInterpolants, 0 QuantifiedInterpolants, 392132 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 430/471 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...