/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options enumeration-timeout=5 --traceabstraction.additional.smt.options interpolation-heuristic=WIDESTAMONGSMALL --traceabstraction.additional.smt.options tolerance=1.0 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label44.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-5644d1e-m [2020-08-19 02:49:34,395 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-19 02:49:34,397 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-19 02:49:34,424 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-19 02:49:34,425 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-19 02:49:34,427 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-19 02:49:34,435 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-19 02:49:34,437 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-19 02:49:34,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-19 02:49:34,441 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-19 02:49:34,442 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-19 02:49:34,444 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-19 02:49:34,445 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-19 02:49:34,446 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-19 02:49:34,447 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-19 02:49:34,452 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-19 02:49:34,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-19 02:49:34,455 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-19 02:49:34,458 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-19 02:49:34,461 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-19 02:49:34,462 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-19 02:49:34,464 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-19 02:49:34,465 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-19 02:49:34,466 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-19 02:49:34,472 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-19 02:49:34,479 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-19 02:49:34,479 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-19 02:49:34,480 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-19 02:49:34,481 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-19 02:49:34,481 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-19 02:49:34,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-19 02:49:34,487 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-19 02:49:34,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-19 02:49:34,491 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-19 02:49:34,492 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-19 02:49:34,492 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-19 02:49:34,493 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-19 02:49:34,493 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-19 02:49:34,493 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-19 02:49:34,494 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-19 02:49:34,495 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-19 02:49:34,496 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-19 02:49:34,533 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-19 02:49:34,533 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-19 02:49:34,534 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-19 02:49:34,535 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-19 02:49:34,535 INFO L138 SettingsManager]: * Use SBE=true [2020-08-19 02:49:34,535 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-19 02:49:34,535 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-19 02:49:34,535 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-19 02:49:34,536 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-19 02:49:34,536 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-19 02:49:34,536 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-19 02:49:34,536 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-19 02:49:34,536 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-19 02:49:34,536 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-19 02:49:34,537 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-19 02:49:34,537 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-19 02:49:34,537 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-19 02:49:34,537 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-19 02:49:34,537 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-19 02:49:34,538 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-19 02:49:34,538 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-19 02:49:34,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-19 02:49:34,538 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-19 02:49:34,538 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-19 02:49:34,539 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-19 02:49:34,539 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-19 02:49:34,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-19 02:49:34,539 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-19 02:49:34,539 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-19 02:49:34,540 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=1.0; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=1.0; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=1.0; [2020-08-19 02:49:34,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-19 02:49:34,889 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-19 02:49:34,892 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-19 02:49:34,894 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-19 02:49:34,896 INFO L275 PluginConnector]: CDTParser initialized [2020-08-19 02:49:34,897 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label44.c [2020-08-19 02:49:34,957 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/03d263076/289af6ce9eed438fb05c371207ccab31/FLAG35f469c97 [2020-08-19 02:49:35,524 INFO L306 CDTParser]: Found 1 translation units. [2020-08-19 02:49:35,525 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem02_label44.c [2020-08-19 02:49:35,540 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/03d263076/289af6ce9eed438fb05c371207ccab31/FLAG35f469c97 [2020-08-19 02:49:35,824 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/03d263076/289af6ce9eed438fb05c371207ccab31 [2020-08-19 02:49:35,835 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-19 02:49:35,838 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-19 02:49:35,839 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-19 02:49:35,839 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-19 02:49:35,843 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-19 02:49:35,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 02:49:35" (1/1) ... [2020-08-19 02:49:35,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@586375c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 02:49:35, skipping insertion in model container [2020-08-19 02:49:35,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 02:49:35" (1/1) ... [2020-08-19 02:49:35,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-19 02:49:35,914 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-19 02:49:36,452 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 02:49:36,467 INFO L203 MainTranslator]: Completed pre-run [2020-08-19 02:49:36,609 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 02:49:36,626 INFO L208 MainTranslator]: Completed translation [2020-08-19 02:49:36,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 02:49:36 WrapperNode [2020-08-19 02:49:36,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-19 02:49:36,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-19 02:49:36,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-19 02:49:36,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-19 02:49:36,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 02:49:36" (1/1) ... [2020-08-19 02:49:36,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 02:49:36" (1/1) ... [2020-08-19 02:49:36,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 02:49:36" (1/1) ... [2020-08-19 02:49:36,658 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 02:49:36" (1/1) ... [2020-08-19 02:49:36,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 02:49:36" (1/1) ... [2020-08-19 02:49:36,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 02:49:36" (1/1) ... [2020-08-19 02:49:36,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 02:49:36" (1/1) ... [2020-08-19 02:49:36,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-19 02:49:36,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-19 02:49:36,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-19 02:49:36,731 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-19 02:49:36,731 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 02:49:36" (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-19 02:49:36,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-19 02:49:36,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-19 02:49:36,809 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-08-19 02:49:36,809 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-19 02:49:36,809 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-08-19 02:49:36,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-19 02:49:36,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-19 02:49:36,810 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-08-19 02:49:36,810 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-19 02:49:36,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-19 02:49:36,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-19 02:49:37,982 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-19 02:49:37,982 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-08-19 02:49:37,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 02:49:37 BoogieIcfgContainer [2020-08-19 02:49:37,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-19 02:49:37,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-19 02:49:37,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-19 02:49:37,998 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-19 02:49:37,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.08 02:49:35" (1/3) ... [2020-08-19 02:49:38,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64937618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 02:49:38, skipping insertion in model container [2020-08-19 02:49:38,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 02:49:36" (2/3) ... [2020-08-19 02:49:38,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64937618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 02:49:38, skipping insertion in model container [2020-08-19 02:49:38,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 02:49:37" (3/3) ... [2020-08-19 02:49:38,004 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label44.c [2020-08-19 02:49:38,014 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-19 02:49:38,027 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-19 02:49:38,042 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-19 02:49:38,077 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-19 02:49:38,078 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-19 02:49:38,078 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-19 02:49:38,078 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-19 02:49:38,078 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-19 02:49:38,079 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-19 02:49:38,079 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-19 02:49:38,079 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-19 02:49:38,106 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2020-08-19 02:49:38,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-08-19 02:49:38,123 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 02:49:38,124 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 02:49:38,125 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 02:49:38,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 02:49:38,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1767789518, now seen corresponding path program 1 times [2020-08-19 02:49:38,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 02:49:38,140 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1694862295] [2020-08-19 02:49:38,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 02:49:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:49:38,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 02:49:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:49:38,713 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-19 02:49:38,714 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1694862295] [2020-08-19 02:49:38,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 02:49:38,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-08-19 02:49:38,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801881123] [2020-08-19 02:49:38,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-19 02:49:38,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 02:49:38,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-19 02:49:38,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-19 02:49:38,744 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 5 states. [2020-08-19 02:49:41,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 02:49:41,096 INFO L93 Difference]: Finished difference Result 784 states and 1378 transitions. [2020-08-19 02:49:41,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-19 02:49:41,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2020-08-19 02:49:41,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 02:49:41,122 INFO L225 Difference]: With dead ends: 784 [2020-08-19 02:49:41,122 INFO L226 Difference]: Without dead ends: 480 [2020-08-19 02:49:41,138 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-08-19 02:49:41,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2020-08-19 02:49:41,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 473. [2020-08-19 02:49:41,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2020-08-19 02:49:41,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 640 transitions. [2020-08-19 02:49:41,272 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 640 transitions. Word has length 94 [2020-08-19 02:49:41,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 02:49:41,272 INFO L479 AbstractCegarLoop]: Abstraction has 473 states and 640 transitions. [2020-08-19 02:49:41,273 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-19 02:49:41,273 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 640 transitions. [2020-08-19 02:49:41,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-08-19 02:49:41,280 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 02:49:41,281 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 02:49:41,281 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-19 02:49:41,281 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 02:49:41,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 02:49:41,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1424154586, now seen corresponding path program 1 times [2020-08-19 02:49:41,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 02:49:41,282 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1519292111] [2020-08-19 02:49:41,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 02:49:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:49:41,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 02:49:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:49:41,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-19 02:49:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:49:41,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-19 02:49:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:49:41,504 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-19 02:49:41,505 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1519292111] [2020-08-19 02:49:41,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 02:49:41,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-19 02:49:41,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916147676] [2020-08-19 02:49:41,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-19 02:49:41,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 02:49:41,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-19 02:49:41,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-08-19 02:49:41,509 INFO L87 Difference]: Start difference. First operand 473 states and 640 transitions. Second operand 9 states. [2020-08-19 02:49:43,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 02:49:43,778 INFO L93 Difference]: Finished difference Result 1392 states and 1936 transitions. [2020-08-19 02:49:43,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-08-19 02:49:43,779 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111 [2020-08-19 02:49:43,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 02:49:43,786 INFO L225 Difference]: With dead ends: 1392 [2020-08-19 02:49:43,787 INFO L226 Difference]: Without dead ends: 925 [2020-08-19 02:49:43,790 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2020-08-19 02:49:43,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2020-08-19 02:49:43,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 767. [2020-08-19 02:49:43,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2020-08-19 02:49:43,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 972 transitions. [2020-08-19 02:49:43,837 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 972 transitions. Word has length 111 [2020-08-19 02:49:43,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 02:49:43,840 INFO L479 AbstractCegarLoop]: Abstraction has 767 states and 972 transitions. [2020-08-19 02:49:43,840 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-19 02:49:43,840 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 972 transitions. [2020-08-19 02:49:43,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-08-19 02:49:43,852 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 02:49:43,853 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:49:43,853 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-19 02:49:43,853 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 02:49:43,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 02:49:43,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1410212782, now seen corresponding path program 1 times [2020-08-19 02:49:43,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 02:49:43,855 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1962949392] [2020-08-19 02:49:43,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 02:49:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:49:44,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 02:49:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:49:44,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-19 02:49:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:49:44,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-19 02:49:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:49:44,080 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-19 02:49:44,081 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1962949392] [2020-08-19 02:49:44,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 02:49:44,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-19 02:49:44,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756115598] [2020-08-19 02:49:44,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-19 02:49:44,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 02:49:44,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-19 02:49:44,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-08-19 02:49:44,084 INFO L87 Difference]: Start difference. First operand 767 states and 972 transitions. Second operand 8 states. [2020-08-19 02:49:46,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 02:49:46,463 INFO L93 Difference]: Finished difference Result 2047 states and 2829 transitions. [2020-08-19 02:49:46,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-19 02:49:46,464 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2020-08-19 02:49:46,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 02:49:46,475 INFO L225 Difference]: With dead ends: 2047 [2020-08-19 02:49:46,476 INFO L226 Difference]: Without dead ends: 1286 [2020-08-19 02:49:46,479 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2020-08-19 02:49:46,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2020-08-19 02:49:46,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1245. [2020-08-19 02:49:46,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1245 states. [2020-08-19 02:49:46,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1559 transitions. [2020-08-19 02:49:46,554 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1559 transitions. Word has length 115 [2020-08-19 02:49:46,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 02:49:46,555 INFO L479 AbstractCegarLoop]: Abstraction has 1245 states and 1559 transitions. [2020-08-19 02:49:46,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-19 02:49:46,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1559 transitions. [2020-08-19 02:49:46,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-08-19 02:49:46,561 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 02:49:46,561 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 02:49:46,561 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-19 02:49:46,562 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 02:49:46,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 02:49:46,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1732096380, now seen corresponding path program 1 times [2020-08-19 02:49:46,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 02:49:46,563 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2082575484] [2020-08-19 02:49:46,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 02:49:46,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:49:46,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 02:49:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:49:46,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-19 02:49:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:49:46,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-19 02:49:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:49:46,745 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-19 02:49:46,746 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2082575484] [2020-08-19 02:49:46,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 02:49:46,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-19 02:49:46,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458147498] [2020-08-19 02:49:46,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-19 02:49:46,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 02:49:46,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-19 02:49:46,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-19 02:49:46,749 INFO L87 Difference]: Start difference. First operand 1245 states and 1559 transitions. Second operand 7 states. [2020-08-19 02:49:48,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 02:49:48,631 INFO L93 Difference]: Finished difference Result 4321 states and 5977 transitions. [2020-08-19 02:49:48,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-19 02:49:48,632 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 123 [2020-08-19 02:49:48,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 02:49:48,653 INFO L225 Difference]: With dead ends: 4321 [2020-08-19 02:49:48,653 INFO L226 Difference]: Without dead ends: 2938 [2020-08-19 02:49:48,660 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-08-19 02:49:48,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-08-19 02:49:48,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 2616. [2020-08-19 02:49:48,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2616 states. [2020-08-19 02:49:48,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2616 states to 2616 states and 3374 transitions. [2020-08-19 02:49:48,772 INFO L78 Accepts]: Start accepts. Automaton has 2616 states and 3374 transitions. Word has length 123 [2020-08-19 02:49:48,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 02:49:48,773 INFO L479 AbstractCegarLoop]: Abstraction has 2616 states and 3374 transitions. [2020-08-19 02:49:48,773 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-19 02:49:48,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2616 states and 3374 transitions. [2020-08-19 02:49:48,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-08-19 02:49:48,782 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 02:49:48,782 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:49:48,782 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-19 02:49:48,783 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 02:49:48,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 02:49:48,783 INFO L82 PathProgramCache]: Analyzing trace with hash 595242574, now seen corresponding path program 1 times [2020-08-19 02:49:48,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 02:49:48,784 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1282839584] [2020-08-19 02:49:48,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 02:49:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:49:48,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 02:49:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:49:48,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-19 02:49:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:49:48,987 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 02:49:48,987 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1282839584] [2020-08-19 02:49:48,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 02:49:48,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-08-19 02:49:48,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102064075] [2020-08-19 02:49:48,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-19 02:49:48,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 02:49:48,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-19 02:49:48,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-19 02:49:48,991 INFO L87 Difference]: Start difference. First operand 2616 states and 3374 transitions. Second operand 5 states. [2020-08-19 02:49:50,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 02:49:50,276 INFO L93 Difference]: Finished difference Result 5238 states and 6756 transitions. [2020-08-19 02:49:50,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-19 02:49:50,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2020-08-19 02:49:50,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 02:49:50,295 INFO L225 Difference]: With dead ends: 5238 [2020-08-19 02:49:50,295 INFO L226 Difference]: Without dead ends: 2772 [2020-08-19 02:49:50,305 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-08-19 02:49:50,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2772 states. [2020-08-19 02:49:50,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2772 to 2618. [2020-08-19 02:49:50,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2618 states. [2020-08-19 02:49:50,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 3285 transitions. [2020-08-19 02:49:50,387 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 3285 transitions. Word has length 128 [2020-08-19 02:49:50,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 02:49:50,389 INFO L479 AbstractCegarLoop]: Abstraction has 2618 states and 3285 transitions. [2020-08-19 02:49:50,389 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-19 02:49:50,389 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 3285 transitions. [2020-08-19 02:49:50,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-08-19 02:49:50,399 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 02:49:50,400 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:49:50,400 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-19 02:49:50,400 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 02:49:50,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 02:49:50,401 INFO L82 PathProgramCache]: Analyzing trace with hash -696516828, now seen corresponding path program 1 times [2020-08-19 02:49:50,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 02:49:50,401 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [114534412] [2020-08-19 02:49:50,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 02:49:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:49:50,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 02:49:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:49:50,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-19 02:49:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:49:50,631 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 47 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 02:49:50,631 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [114534412] [2020-08-19 02:49:50,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 02:49:50,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-08-19 02:49:50,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011231810] [2020-08-19 02:49:50,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-19 02:49:50,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 02:49:50,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-19 02:49:50,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-19 02:49:50,643 INFO L87 Difference]: Start difference. First operand 2618 states and 3285 transitions. Second operand 5 states. [2020-08-19 02:49:51,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 02:49:51,687 INFO L93 Difference]: Finished difference Result 6256 states and 7974 transitions. [2020-08-19 02:49:51,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-19 02:49:51,688 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2020-08-19 02:49:51,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 02:49:51,709 INFO L225 Difference]: With dead ends: 6256 [2020-08-19 02:49:51,709 INFO L226 Difference]: Without dead ends: 3788 [2020-08-19 02:49:51,719 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-19 02:49:51,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3788 states. [2020-08-19 02:49:51,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3788 to 3048. [2020-08-19 02:49:51,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3048 states. [2020-08-19 02:49:51,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3048 states to 3048 states and 3870 transitions. [2020-08-19 02:49:51,822 INFO L78 Accepts]: Start accepts. Automaton has 3048 states and 3870 transitions. Word has length 145 [2020-08-19 02:49:51,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 02:49:51,822 INFO L479 AbstractCegarLoop]: Abstraction has 3048 states and 3870 transitions. [2020-08-19 02:49:51,822 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-19 02:49:51,823 INFO L276 IsEmpty]: Start isEmpty. Operand 3048 states and 3870 transitions. [2020-08-19 02:49:51,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-08-19 02:49:51,835 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 02:49:51,835 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-08-19 02:49:51,835 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-19 02:49:51,835 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 02:49:51,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 02:49:51,836 INFO L82 PathProgramCache]: Analyzing trace with hash 781108354, now seen corresponding path program 1 times [2020-08-19 02:49:51,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 02:49:51,836 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1111184156] [2020-08-19 02:49:51,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 02:49:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-19 02:49:51,879 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-19 02:49:51,879 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-19 02:49:51,884 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-19 02:49:51,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.08 02:49:51 BoogieIcfgContainer [2020-08-19 02:49:51,917 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-19 02:49:51,920 INFO L168 Benchmark]: Toolchain (without parser) took 16082.43 ms. Allocated memory was 147.8 MB in the beginning and 437.3 MB in the end (delta: 289.4 MB). Free memory was 102.4 MB in the beginning and 247.0 MB in the end (delta: -144.7 MB). Peak memory consumption was 144.7 MB. Max. memory is 7.1 GB. [2020-08-19 02:49:51,920 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 147.8 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-08-19 02:49:51,922 INFO L168 Benchmark]: CACSL2BoogieTranslator took 788.90 ms. Allocated memory was 147.8 MB in the beginning and 205.5 MB in the end (delta: 57.7 MB). Free memory was 102.2 MB in the beginning and 172.0 MB in the end (delta: -69.9 MB). Peak memory consumption was 31.1 MB. Max. memory is 7.1 GB. [2020-08-19 02:49:51,922 INFO L168 Benchmark]: Boogie Preprocessor took 101.99 ms. Allocated memory is still 205.5 MB. Free memory was 172.0 MB in the beginning and 167.2 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. [2020-08-19 02:49:51,923 INFO L168 Benchmark]: RCFGBuilder took 1262.38 ms. Allocated memory was 205.5 MB in the beginning and 237.0 MB in the end (delta: 31.5 MB). Free memory was 167.2 MB in the beginning and 179.2 MB in the end (delta: -12.0 MB). Peak memory consumption was 81.0 MB. Max. memory is 7.1 GB. [2020-08-19 02:49:51,924 INFO L168 Benchmark]: TraceAbstraction took 13921.95 ms. Allocated memory was 237.0 MB in the beginning and 437.3 MB in the end (delta: 200.3 MB). Free memory was 179.2 MB in the beginning and 247.0 MB in the end (delta: -67.8 MB). Peak memory consumption was 132.4 MB. Max. memory is 7.1 GB. [2020-08-19 02:49:51,928 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.49 ms. Allocated memory is still 147.8 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 788.90 ms. Allocated memory was 147.8 MB in the beginning and 205.5 MB in the end (delta: 57.7 MB). Free memory was 102.2 MB in the beginning and 172.0 MB in the end (delta: -69.9 MB). Peak memory consumption was 31.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 101.99 ms. Allocated memory is still 205.5 MB. Free memory was 172.0 MB in the beginning and 167.2 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1262.38 ms. Allocated memory was 205.5 MB in the beginning and 237.0 MB in the end (delta: 31.5 MB). Free memory was 167.2 MB in the beginning and 179.2 MB in the end (delta: -12.0 MB). Peak memory consumption was 81.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13921.95 ms. Allocated memory was 237.0 MB in the beginning and 437.3 MB in the end (delta: 200.3 MB). Free memory was 179.2 MB in the beginning and 247.0 MB in the end (delta: -67.8 MB). Peak memory consumption was 132.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 436]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND TRUE ((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))) [L51] a28 = 11 [L52] a25 = 1 [L53] return 26; [L614] RET, EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) [L349] COND TRUE (!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1))) [L350] a28 = 9 [L351] a11 = 1 [L352] a25 = 0 [L353] return -1; [L614] RET, EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L414] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) [L417] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) [L420] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) [L423] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L426] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) [L429] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) [L432] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7))) [L435] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8)) [L436] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 236 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.8s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 264 SDtfs, 3515 SDslu, 364 SDs, 0 SdLazy, 6547 SolverSat, 1141 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3048occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 6 MinimizatonAttempts, 1422 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 892 NumberOfCodeBlocks, 892 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 710 ConstructedInterpolants, 0 QuantifiedInterpolants, 242172 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 1 PerfectInterpolantSequences, 139/150 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...