/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 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label38.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-5644d1e-m [2020-08-18 11:22:30,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-18 11:22:30,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-18 11:22:30,515 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-18 11:22:30,516 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-18 11:22:30,517 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-18 11:22:30,518 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-18 11:22:30,520 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-18 11:22:30,522 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-18 11:22:30,522 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-18 11:22:30,523 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-18 11:22:30,524 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-18 11:22:30,525 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-18 11:22:30,526 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-18 11:22:30,527 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-18 11:22:30,528 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-18 11:22:30,530 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-18 11:22:30,532 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-18 11:22:30,536 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-18 11:22:30,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-18 11:22:30,541 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-18 11:22:30,542 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-18 11:22:30,546 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-18 11:22:30,547 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-18 11:22:30,549 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-18 11:22:30,549 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-18 11:22:30,549 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-18 11:22:30,553 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-18 11:22:30,554 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-18 11:22:30,555 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-18 11:22:30,556 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-18 11:22:30,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-18 11:22:30,559 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-18 11:22:30,559 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-18 11:22:30,561 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-18 11:22:30,561 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-18 11:22:30,562 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-18 11:22:30,562 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-18 11:22:30,562 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-18 11:22:30,573 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-18 11:22:30,573 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-18 11:22:30,574 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 11:22:30,620 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-18 11:22:30,620 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-18 11:22:30,622 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-18 11:22:30,623 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-18 11:22:30,623 INFO L138 SettingsManager]: * Use SBE=true [2020-08-18 11:22:30,623 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-18 11:22:30,623 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-18 11:22:30,624 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-18 11:22:30,624 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-18 11:22:30,624 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-18 11:22:30,625 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-18 11:22:30,625 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-18 11:22:30,625 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-18 11:22:30,625 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-18 11:22:30,626 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-18 11:22:30,626 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-18 11:22:30,626 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-18 11:22:30,627 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-18 11:22:30,627 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-18 11:22:30,627 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-18 11:22:30,627 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-18 11:22:30,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-18 11:22:30,628 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-18 11:22:30,628 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-18 11:22:30,628 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-18 11:22:30,628 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-18 11:22:30,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-18 11:22:30,629 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-18 11:22:30,629 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-18 11:22:30,629 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 [2020-08-18 11:22:30,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-18 11:22:30,967 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-18 11:22:30,973 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-18 11:22:30,975 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-18 11:22:30,975 INFO L275 PluginConnector]: CDTParser initialized [2020-08-18 11:22:30,976 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label38.c [2020-08-18 11:22:31,054 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/037437a4e/2462dbe18966475b8970f4852e1d8e57/FLAGaa4f867d6 [2020-08-18 11:22:31,654 INFO L306 CDTParser]: Found 1 translation units. [2020-08-18 11:22:31,655 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem01_label38.c [2020-08-18 11:22:31,671 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/037437a4e/2462dbe18966475b8970f4852e1d8e57/FLAGaa4f867d6 [2020-08-18 11:22:31,900 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/037437a4e/2462dbe18966475b8970f4852e1d8e57 [2020-08-18 11:22:31,911 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-18 11:22:31,913 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-18 11:22:31,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-18 11:22:31,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-18 11:22:31,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-18 11:22:31,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 11:22:31" (1/1) ... [2020-08-18 11:22:31,923 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f80c2a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:22:31, skipping insertion in model container [2020-08-18 11:22:31,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 11:22:31" (1/1) ... [2020-08-18 11:22:31,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-18 11:22:31,995 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-18 11:22:32,549 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-18 11:22:32,557 INFO L203 MainTranslator]: Completed pre-run [2020-08-18 11:22:32,687 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-18 11:22:32,704 INFO L208 MainTranslator]: Completed translation [2020-08-18 11:22:32,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:22:32 WrapperNode [2020-08-18 11:22:32,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-18 11:22:32,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-18 11:22:32,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-18 11:22:32,706 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-18 11:22:32,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:22:32" (1/1) ... [2020-08-18 11:22:32,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:22:32" (1/1) ... [2020-08-18 11:22:32,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:22:32" (1/1) ... [2020-08-18 11:22:32,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:22:32" (1/1) ... [2020-08-18 11:22:32,788 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:22:32" (1/1) ... [2020-08-18 11:22:32,805 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:22:32" (1/1) ... [2020-08-18 11:22:32,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:22:32" (1/1) ... [2020-08-18 11:22:32,819 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-18 11:22:32,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-18 11:22:32,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-18 11:22:32,820 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-18 11:22:32,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:22:32" (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 11:22:32,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-18 11:22:32,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-18 11:22:32,885 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-08-18 11:22:32,885 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-18 11:22:32,886 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-08-18 11:22:32,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-18 11:22:32,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-18 11:22:32,886 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-08-18 11:22:32,887 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-18 11:22:32,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-18 11:22:32,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-18 11:22:33,999 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-18 11:22:33,999 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-08-18 11:22:34,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 11:22:34 BoogieIcfgContainer [2020-08-18 11:22:34,006 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-18 11:22:34,007 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-18 11:22:34,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-18 11:22:34,011 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-18 11:22:34,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.08 11:22:31" (1/3) ... [2020-08-18 11:22:34,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31befab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.08 11:22:34, skipping insertion in model container [2020-08-18 11:22:34,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:22:32" (2/3) ... [2020-08-18 11:22:34,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31befab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.08 11:22:34, skipping insertion in model container [2020-08-18 11:22:34,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 11:22:34" (3/3) ... [2020-08-18 11:22:34,016 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label38.c [2020-08-18 11:22:34,028 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-18 11:22:34,037 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-18 11:22:34,051 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-18 11:22:34,084 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-18 11:22:34,084 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-18 11:22:34,084 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-18 11:22:34,084 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-18 11:22:34,084 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-18 11:22:34,085 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-18 11:22:34,085 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-18 11:22:34,085 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-18 11:22:34,109 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2020-08-18 11:22:34,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-08-18 11:22:34,120 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 11:22:34,121 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 11:22:34,122 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 11:22:34,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 11:22:34,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1861146994, now seen corresponding path program 1 times [2020-08-18 11:22:34,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 11:22:34,139 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [478687368] [2020-08-18 11:22:34,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 11:22:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:34,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 11:22:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:34,698 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 11:22:34,699 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [478687368] [2020-08-18 11:22:34,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 11:22:34,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-08-18 11:22:34,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649587118] [2020-08-18 11:22:34,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 11:22:34,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 11:22:34,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 11:22:34,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-18 11:22:34,727 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 5 states. [2020-08-18 11:22:36,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 11:22:36,260 INFO L93 Difference]: Finished difference Result 557 states and 956 transitions. [2020-08-18 11:22:36,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 11:22:36,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2020-08-18 11:22:36,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 11:22:36,279 INFO L225 Difference]: With dead ends: 557 [2020-08-18 11:22:36,279 INFO L226 Difference]: Without dead ends: 286 [2020-08-18 11:22:36,286 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-08-18 11:22:36,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2020-08-18 11:22:36,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 280. [2020-08-18 11:22:36,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-08-18 11:22:36,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 402 transitions. [2020-08-18 11:22:36,362 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 402 transitions. Word has length 88 [2020-08-18 11:22:36,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 11:22:36,363 INFO L479 AbstractCegarLoop]: Abstraction has 280 states and 402 transitions. [2020-08-18 11:22:36,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 11:22:36,363 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 402 transitions. [2020-08-18 11:22:36,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-08-18 11:22:36,368 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 11:22:36,368 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 11:22:36,370 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-18 11:22:36,370 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 11:22:36,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 11:22:36,371 INFO L82 PathProgramCache]: Analyzing trace with hash -136469723, now seen corresponding path program 1 times [2020-08-18 11:22:36,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 11:22:36,371 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1742853878] [2020-08-18 11:22:36,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 11:22:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:36,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 11:22:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:36,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 11:22:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:36,629 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 11:22:36,630 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1742853878] [2020-08-18 11:22:36,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 11:22:36,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-18 11:22:36,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368302314] [2020-08-18 11:22:36,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-18 11:22:36,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 11:22:36,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-18 11:22:36,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-08-18 11:22:36,634 INFO L87 Difference]: Start difference. First operand 280 states and 402 transitions. Second operand 8 states. [2020-08-18 11:22:38,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 11:22:38,114 INFO L93 Difference]: Finished difference Result 713 states and 1049 transitions. [2020-08-18 11:22:38,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-18 11:22:38,117 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 98 [2020-08-18 11:22:38,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 11:22:38,125 INFO L225 Difference]: With dead ends: 713 [2020-08-18 11:22:38,126 INFO L226 Difference]: Without dead ends: 439 [2020-08-18 11:22:38,131 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 11:22:38,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2020-08-18 11:22:38,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 421. [2020-08-18 11:22:38,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2020-08-18 11:22:38,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 590 transitions. [2020-08-18 11:22:38,182 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 590 transitions. Word has length 98 [2020-08-18 11:22:38,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 11:22:38,182 INFO L479 AbstractCegarLoop]: Abstraction has 421 states and 590 transitions. [2020-08-18 11:22:38,182 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-18 11:22:38,182 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 590 transitions. [2020-08-18 11:22:38,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-08-18 11:22:38,186 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 11:22:38,187 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 11:22:38,187 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-18 11:22:38,187 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 11:22:38,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 11:22:38,188 INFO L82 PathProgramCache]: Analyzing trace with hash -2049197465, now seen corresponding path program 1 times [2020-08-18 11:22:38,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 11:22:38,188 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2097752832] [2020-08-18 11:22:38,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 11:22:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:38,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 11:22:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:38,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 11:22:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:38,384 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 11:22:38,385 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2097752832] [2020-08-18 11:22:38,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 11:22:38,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-08-18 11:22:38,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804628502] [2020-08-18 11:22:38,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 11:22:38,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 11:22:38,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 11:22:38,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-18 11:22:38,388 INFO L87 Difference]: Start difference. First operand 421 states and 590 transitions. Second operand 5 states. [2020-08-18 11:22:39,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 11:22:39,451 INFO L93 Difference]: Finished difference Result 1257 states and 1815 transitions. [2020-08-18 11:22:39,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 11:22:39,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2020-08-18 11:22:39,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 11:22:39,459 INFO L225 Difference]: With dead ends: 1257 [2020-08-18 11:22:39,460 INFO L226 Difference]: Without dead ends: 842 [2020-08-18 11:22:39,461 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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 11:22:39,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2020-08-18 11:22:39,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 836. [2020-08-18 11:22:39,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2020-08-18 11:22:39,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1170 transitions. [2020-08-18 11:22:39,505 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1170 transitions. Word has length 99 [2020-08-18 11:22:39,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 11:22:39,506 INFO L479 AbstractCegarLoop]: Abstraction has 836 states and 1170 transitions. [2020-08-18 11:22:39,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 11:22:39,506 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1170 transitions. [2020-08-18 11:22:39,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-08-18 11:22:39,513 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 11:22:39,513 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 11:22:39,513 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-18 11:22:39,513 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 11:22:39,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 11:22:39,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1744209819, now seen corresponding path program 1 times [2020-08-18 11:22:39,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 11:22:39,514 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1835223559] [2020-08-18 11:22:39,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 11:22:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:39,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 11:22:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:39,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 11:22:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:39,753 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 11:22:39,754 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1835223559] [2020-08-18 11:22:39,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 11:22:39,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-18 11:22:39,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749348250] [2020-08-18 11:22:39,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-18 11:22:39,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 11:22:39,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-18 11:22:39,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-18 11:22:39,757 INFO L87 Difference]: Start difference. First operand 836 states and 1170 transitions. Second operand 6 states. [2020-08-18 11:22:40,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 11:22:40,946 INFO L93 Difference]: Finished difference Result 2359 states and 3419 transitions. [2020-08-18 11:22:40,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 11:22:40,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2020-08-18 11:22:40,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 11:22:40,962 INFO L225 Difference]: With dead ends: 2359 [2020-08-18 11:22:40,963 INFO L226 Difference]: Without dead ends: 1529 [2020-08-18 11:22:40,967 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-08-18 11:22:40,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2020-08-18 11:22:41,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1386. [2020-08-18 11:22:41,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1386 states. [2020-08-18 11:22:41,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1872 transitions. [2020-08-18 11:22:41,106 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1872 transitions. Word has length 105 [2020-08-18 11:22:41,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 11:22:41,107 INFO L479 AbstractCegarLoop]: Abstraction has 1386 states and 1872 transitions. [2020-08-18 11:22:41,107 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-18 11:22:41,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1872 transitions. [2020-08-18 11:22:41,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-08-18 11:22:41,111 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 11:22:41,111 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 11:22:41,112 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-18 11:22:41,112 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 11:22:41,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 11:22:41,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1307592906, now seen corresponding path program 1 times [2020-08-18 11:22:41,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 11:22:41,113 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2052531467] [2020-08-18 11:22:41,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 11:22:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:41,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 11:22:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:41,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 11:22:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:41,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-18 11:22:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:41,304 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-18 11:22:41,305 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2052531467] [2020-08-18 11:22:41,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 11:22:41,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 11:22:41,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958058876] [2020-08-18 11:22:41,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 11:22:41,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 11:22:41,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 11:22:41,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-18 11:22:41,307 INFO L87 Difference]: Start difference. First operand 1386 states and 1872 transitions. Second operand 7 states. [2020-08-18 11:22:43,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 11:22:43,306 INFO L93 Difference]: Finished difference Result 3253 states and 4635 transitions. [2020-08-18 11:22:43,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-18 11:22:43,307 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2020-08-18 11:22:43,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 11:22:43,323 INFO L225 Difference]: With dead ends: 3253 [2020-08-18 11:22:43,323 INFO L226 Difference]: Without dead ends: 1873 [2020-08-18 11:22:43,328 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-08-18 11:22:43,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2020-08-18 11:22:43,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1865. [2020-08-18 11:22:43,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1865 states. [2020-08-18 11:22:43,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1865 states and 2583 transitions. [2020-08-18 11:22:43,410 INFO L78 Accepts]: Start accepts. Automaton has 1865 states and 2583 transitions. Word has length 128 [2020-08-18 11:22:43,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 11:22:43,411 INFO L479 AbstractCegarLoop]: Abstraction has 1865 states and 2583 transitions. [2020-08-18 11:22:43,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 11:22:43,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1865 states and 2583 transitions. [2020-08-18 11:22:43,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-08-18 11:22:43,419 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 11:22:43,420 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 11:22:43,420 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-18 11:22:43,420 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 11:22:43,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 11:22:43,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1735292846, now seen corresponding path program 1 times [2020-08-18 11:22:43,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 11:22:43,421 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1259893681] [2020-08-18 11:22:43,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 11:22:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:43,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 11:22:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:43,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 11:22:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:43,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 11:22:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:43,603 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 39 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-08-18 11:22:43,604 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1259893681] [2020-08-18 11:22:43,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 11:22:43,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-08-18 11:22:43,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656051767] [2020-08-18 11:22:43,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 11:22:43,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 11:22:43,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 11:22:43,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-18 11:22:43,607 INFO L87 Difference]: Start difference. First operand 1865 states and 2583 transitions. Second operand 5 states. [2020-08-18 11:22:43,872 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-08-18 11:22:44,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 11:22:44,791 INFO L93 Difference]: Finished difference Result 4012 states and 5603 transitions. [2020-08-18 11:22:44,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 11:22:44,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2020-08-18 11:22:44,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 11:22:44,807 INFO L225 Difference]: With dead ends: 4012 [2020-08-18 11:22:44,807 INFO L226 Difference]: Without dead ends: 2157 [2020-08-18 11:22:44,816 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-08-18 11:22:44,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2157 states. [2020-08-18 11:22:44,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2157 to 2012. [2020-08-18 11:22:44,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2020-08-18 11:22:44,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 2703 transitions. [2020-08-18 11:22:44,910 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 2703 transitions. Word has length 132 [2020-08-18 11:22:44,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 11:22:44,910 INFO L479 AbstractCegarLoop]: Abstraction has 2012 states and 2703 transitions. [2020-08-18 11:22:44,910 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 11:22:44,911 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 2703 transitions. [2020-08-18 11:22:44,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-08-18 11:22:44,919 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 11:22:44,919 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 11:22:44,920 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-18 11:22:44,920 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 11:22:44,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 11:22:44,920 INFO L82 PathProgramCache]: Analyzing trace with hash -273287469, now seen corresponding path program 1 times [2020-08-18 11:22:44,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 11:22:44,921 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1740975297] [2020-08-18 11:22:44,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 11:22:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:45,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 11:22:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:45,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 11:22:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:45,257 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 11:22:45,257 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1740975297] [2020-08-18 11:22:45,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 11:22:45,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-18 11:22:45,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800040076] [2020-08-18 11:22:45,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-18 11:22:45,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 11:22:45,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-18 11:22:45,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-08-18 11:22:45,260 INFO L87 Difference]: Start difference. First operand 2012 states and 2703 transitions. Second operand 8 states. [2020-08-18 11:22:47,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 11:22:47,058 INFO L93 Difference]: Finished difference Result 4127 states and 5429 transitions. [2020-08-18 11:22:47,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-18 11:22:47,059 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 141 [2020-08-18 11:22:47,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 11:22:47,068 INFO L225 Difference]: With dead ends: 4127 [2020-08-18 11:22:47,068 INFO L226 Difference]: Without dead ends: 2125 [2020-08-18 11:22:47,075 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-08-18 11:22:47,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2020-08-18 11:22:47,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 1849. [2020-08-18 11:22:47,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1849 states. [2020-08-18 11:22:47,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2286 transitions. [2020-08-18 11:22:47,127 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 2286 transitions. Word has length 141 [2020-08-18 11:22:47,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 11:22:47,128 INFO L479 AbstractCegarLoop]: Abstraction has 1849 states and 2286 transitions. [2020-08-18 11:22:47,128 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-18 11:22:47,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2286 transitions. [2020-08-18 11:22:47,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-08-18 11:22:47,133 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 11:22:47,133 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 11:22:47,133 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-18 11:22:47,133 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 11:22:47,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 11:22:47,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1409122264, now seen corresponding path program 1 times [2020-08-18 11:22:47,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 11:22:47,134 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [98525431] [2020-08-18 11:22:47,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 11:22:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:47,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 11:22:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:47,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 11:22:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:47,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-08-18 11:22:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:47,445 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 60 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-18 11:22:47,445 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [98525431] [2020-08-18 11:22:47,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 11:22:47,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 11:22:47,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511970124] [2020-08-18 11:22:47,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 11:22:47,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 11:22:47,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 11:22:47,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-18 11:22:47,448 INFO L87 Difference]: Start difference. First operand 1849 states and 2286 transitions. Second operand 7 states. [2020-08-18 11:22:48,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 11:22:48,739 INFO L93 Difference]: Finished difference Result 3990 states and 4952 transitions. [2020-08-18 11:22:48,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-18 11:22:48,740 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 149 [2020-08-18 11:22:48,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 11:22:48,751 INFO L225 Difference]: With dead ends: 3990 [2020-08-18 11:22:48,752 INFO L226 Difference]: Without dead ends: 2147 [2020-08-18 11:22:48,757 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-08-18 11:22:48,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2020-08-18 11:22:48,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 1718. [2020-08-18 11:22:48,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1718 states. [2020-08-18 11:22:48,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2068 transitions. [2020-08-18 11:22:48,812 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2068 transitions. Word has length 149 [2020-08-18 11:22:48,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 11:22:48,812 INFO L479 AbstractCegarLoop]: Abstraction has 1718 states and 2068 transitions. [2020-08-18 11:22:48,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 11:22:48,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2068 transitions. [2020-08-18 11:22:48,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2020-08-18 11:22:48,818 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 11:22:48,818 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 11:22:48,819 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-18 11:22:48,819 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 11:22:48,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 11:22:48,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1345296538, now seen corresponding path program 1 times [2020-08-18 11:22:48,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 11:22:48,820 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1030717039] [2020-08-18 11:22:48,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 11:22:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:48,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 11:22:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:48,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 11:22:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:48,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-18 11:22:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:49,114 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 66 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-18 11:22:49,115 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1030717039] [2020-08-18 11:22:49,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 11:22:49,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 11:22:49,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615368817] [2020-08-18 11:22:49,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 11:22:49,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 11:22:49,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 11:22:49,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-18 11:22:49,117 INFO L87 Difference]: Start difference. First operand 1718 states and 2068 transitions. Second operand 7 states. [2020-08-18 11:22:50,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 11:22:50,370 INFO L93 Difference]: Finished difference Result 3458 states and 4194 transitions. [2020-08-18 11:22:50,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-18 11:22:50,371 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 152 [2020-08-18 11:22:50,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 11:22:50,378 INFO L225 Difference]: With dead ends: 3458 [2020-08-18 11:22:50,379 INFO L226 Difference]: Without dead ends: 1746 [2020-08-18 11:22:50,383 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-08-18 11:22:50,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2020-08-18 11:22:50,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1577. [2020-08-18 11:22:50,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-08-18 11:22:50,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 1884 transitions. [2020-08-18 11:22:50,428 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 1884 transitions. Word has length 152 [2020-08-18 11:22:50,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 11:22:50,429 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 1884 transitions. [2020-08-18 11:22:50,429 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 11:22:50,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 1884 transitions. [2020-08-18 11:22:50,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-08-18 11:22:50,434 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 11:22:50,434 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 11:22:50,434 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-18 11:22:50,435 INFO L427 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 11:22:50,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 11:22:50,435 INFO L82 PathProgramCache]: Analyzing trace with hash -82886138, now seen corresponding path program 1 times [2020-08-18 11:22:50,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 11:22:50,435 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1773451384] [2020-08-18 11:22:50,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 11:22:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:50,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 11:22:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:50,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 11:22:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:50,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-18 11:22:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:50,716 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-18 11:22:50,717 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1773451384] [2020-08-18 11:22:50,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 11:22:50,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 11:22:50,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546338728] [2020-08-18 11:22:50,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 11:22:50,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 11:22:50,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 11:22:50,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-18 11:22:50,719 INFO L87 Difference]: Start difference. First operand 1577 states and 1884 transitions. Second operand 7 states. [2020-08-18 11:22:52,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 11:22:52,153 INFO L93 Difference]: Finished difference Result 3446 states and 4114 transitions. [2020-08-18 11:22:52,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-18 11:22:52,156 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 174 [2020-08-18 11:22:52,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 11:22:52,163 INFO L225 Difference]: With dead ends: 3446 [2020-08-18 11:22:52,163 INFO L226 Difference]: Without dead ends: 1875 [2020-08-18 11:22:52,167 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-08-18 11:22:52,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2020-08-18 11:22:52,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1863. [2020-08-18 11:22:52,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1863 states. [2020-08-18 11:22:52,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1863 states to 1863 states and 2177 transitions. [2020-08-18 11:22:52,218 INFO L78 Accepts]: Start accepts. Automaton has 1863 states and 2177 transitions. Word has length 174 [2020-08-18 11:22:52,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 11:22:52,219 INFO L479 AbstractCegarLoop]: Abstraction has 1863 states and 2177 transitions. [2020-08-18 11:22:52,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 11:22:52,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1863 states and 2177 transitions. [2020-08-18 11:22:52,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2020-08-18 11:22:52,230 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 11:22:52,231 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 11:22:52,231 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-18 11:22:52,231 INFO L427 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 11:22:52,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 11:22:52,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1827070031, now seen corresponding path program 1 times [2020-08-18 11:22:52,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 11:22:52,232 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [387332075] [2020-08-18 11:22:52,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 11:22:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:52,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 11:22:52,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:52,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 11:22:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:52,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-08-18 11:22:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:52,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-08-18 11:22:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:52,739 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 160 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-18 11:22:52,739 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [387332075] [2020-08-18 11:22:52,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 11:22:52,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-18 11:22:52,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088228967] [2020-08-18 11:22:52,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-18 11:22:52,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 11:22:52,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-18 11:22:52,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-08-18 11:22:52,743 INFO L87 Difference]: Start difference. First operand 1863 states and 2177 transitions. Second operand 10 states. [2020-08-18 11:22:53,339 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2020-08-18 11:22:53,555 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 78 [2020-08-18 11:22:53,965 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2020-08-18 11:22:54,568 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2020-08-18 11:22:55,727 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2020-08-18 11:22:56,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 11:22:56,762 INFO L93 Difference]: Finished difference Result 4540 states and 5340 transitions. [2020-08-18 11:22:56,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-08-18 11:22:56,763 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 199 [2020-08-18 11:22:56,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 11:22:56,773 INFO L225 Difference]: With dead ends: 4540 [2020-08-18 11:22:56,773 INFO L226 Difference]: Without dead ends: 2683 [2020-08-18 11:22:56,777 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=198, Invalid=504, Unknown=0, NotChecked=0, Total=702 [2020-08-18 11:22:56,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2683 states. [2020-08-18 11:22:56,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2683 to 2133. [2020-08-18 11:22:56,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2020-08-18 11:22:56,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 2468 transitions. [2020-08-18 11:22:56,839 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 2468 transitions. Word has length 199 [2020-08-18 11:22:56,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 11:22:56,840 INFO L479 AbstractCegarLoop]: Abstraction has 2133 states and 2468 transitions. [2020-08-18 11:22:56,840 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-18 11:22:56,841 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2468 transitions. [2020-08-18 11:22:56,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2020-08-18 11:22:56,847 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 11:22:56,848 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 11:22:56,848 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-18 11:22:56,848 INFO L427 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 11:22:56,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 11:22:56,849 INFO L82 PathProgramCache]: Analyzing trace with hash 2033686183, now seen corresponding path program 1 times [2020-08-18 11:22:56,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 11:22:56,849 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1570046432] [2020-08-18 11:22:56,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 11:22:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:56,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 11:22:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:57,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 11:22:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:57,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-08-18 11:22:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:57,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-08-18 11:22:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:22:57,135 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 113 proven. 3 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-08-18 11:22:57,136 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1570046432] [2020-08-18 11:22:57,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 11:22:57,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-08-18 11:22:57,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982574818] [2020-08-18 11:22:57,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 11:22:57,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 11:22:57,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 11:22:57,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-18 11:22:57,138 INFO L87 Difference]: Start difference. First operand 2133 states and 2468 transitions. Second operand 5 states. [2020-08-18 11:22:58,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 11:22:58,202 INFO L93 Difference]: Finished difference Result 4816 states and 5601 transitions. [2020-08-18 11:22:58,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 11:22:58,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2020-08-18 11:22:58,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 11:22:58,216 INFO L225 Difference]: With dead ends: 4816 [2020-08-18 11:22:58,216 INFO L226 Difference]: Without dead ends: 2689 [2020-08-18 11:22:58,221 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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 11:22:58,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2689 states. [2020-08-18 11:22:58,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2689 to 2411. [2020-08-18 11:22:58,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2411 states. [2020-08-18 11:22:58,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 2751 transitions. [2020-08-18 11:22:58,319 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 2751 transitions. Word has length 204 [2020-08-18 11:22:58,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 11:22:58,320 INFO L479 AbstractCegarLoop]: Abstraction has 2411 states and 2751 transitions. [2020-08-18 11:22:58,320 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 11:22:58,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 2751 transitions. [2020-08-18 11:22:58,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2020-08-18 11:22:58,328 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 11:22:58,328 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 11:22:58,328 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-18 11:22:58,328 INFO L427 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 11:22:58,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 11:22:58,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1986135978, now seen corresponding path program 1 times [2020-08-18 11:22:58,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 11:22:58,329 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1987984533] [2020-08-18 11:22:58,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 11:22:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-18 11:22:58,389 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-18 11:22:58,390 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-18 11:22:58,396 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-18 11:22:58,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.08 11:22:58 BoogieIcfgContainer [2020-08-18 11:22:58,470 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-18 11:22:58,476 INFO L168 Benchmark]: Toolchain (without parser) took 26559.67 ms. Allocated memory was 138.4 MB in the beginning and 637.5 MB in the end (delta: 499.1 MB). Free memory was 99.9 MB in the beginning and 547.7 MB in the end (delta: -447.8 MB). Peak memory consumption was 51.3 MB. Max. memory is 7.1 GB. [2020-08-18 11:22:58,477 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.4 MB. Free memory was 120.0 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-08-18 11:22:58,480 INFO L168 Benchmark]: CACSL2BoogieTranslator took 790.52 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 99.7 MB in the beginning and 167.5 MB in the end (delta: -67.8 MB). Peak memory consumption was 33.3 MB. Max. memory is 7.1 GB. [2020-08-18 11:22:58,481 INFO L168 Benchmark]: Boogie Preprocessor took 113.60 ms. Allocated memory is still 201.9 MB. Free memory was 167.5 MB in the beginning and 162.4 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. [2020-08-18 11:22:58,484 INFO L168 Benchmark]: RCFGBuilder took 1187.08 ms. Allocated memory was 201.9 MB in the beginning and 232.8 MB in the end (delta: 30.9 MB). Free memory was 162.4 MB in the beginning and 176.5 MB in the end (delta: -14.1 MB). Peak memory consumption was 84.3 MB. Max. memory is 7.1 GB. [2020-08-18 11:22:58,485 INFO L168 Benchmark]: TraceAbstraction took 24462.64 ms. Allocated memory was 232.8 MB in the beginning and 637.5 MB in the end (delta: 404.8 MB). Free memory was 176.5 MB in the beginning and 547.7 MB in the end (delta: -371.2 MB). Peak memory consumption was 33.5 MB. Max. memory is 7.1 GB. [2020-08-18 11:22:58,495 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.19 ms. Allocated memory is still 138.4 MB. Free memory was 120.0 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 790.52 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 99.7 MB in the beginning and 167.5 MB in the end (delta: -67.8 MB). Peak memory consumption was 33.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 113.60 ms. Allocated memory is still 201.9 MB. Free memory was 167.5 MB in the beginning and 162.4 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1187.08 ms. Allocated memory was 201.9 MB in the beginning and 232.8 MB in the end (delta: 30.9 MB). Free memory was 162.4 MB in the beginning and 176.5 MB in the end (delta: -14.1 MB). Peak memory consumption was 84.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24462.64 ms. Allocated memory was 232.8 MB in the beginning and 637.5 MB in the end (delta: 404.8 MB). Free memory was 176.5 MB in the beginning and 547.7 MB in the end (delta: -371.2 MB). Peak memory consumption was 33.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 422]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] return 21; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] return 21; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] return 26; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) [L278] COND TRUE (((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8)) [L279] a20 = 1 [L280] a8 = 13 [L281] a16 = 4 [L282] a7 = 0 [L283] a21 = 1 [L284] a17 = 0 [L285] return -1; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L403] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L406] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L409] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L412] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L415] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L418] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L421] COND TRUE ((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)) [L422] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 207 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 24.3s, OverallIterations: 13, TraceHistogramMax: 5, AutomataDifference: 19.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 343 SDtfs, 5727 SDslu, 458 SDs, 0 SdLazy, 10597 SolverSat, 1610 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 199 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2411occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 2040 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1937 NumberOfCodeBlocks, 1937 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1657 ConstructedInterpolants, 0 QuantifiedInterpolants, 1020268 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 744/763 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...