/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 produce-proofs=true --traceabstraction.additional.smt.options produce-unsat-cores=true --traceabstraction.additional.smt.options interpolation-heuristic=FIRST --traceabstraction.additional.smt.options log-additional-information=true -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label15.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-eb0fd7c [2020-09-21 11:27:10,495 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-21 11:27:10,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-21 11:27:10,544 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-21 11:27:10,546 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-21 11:27:10,555 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-21 11:27:10,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-21 11:27:10,561 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-21 11:27:10,564 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-21 11:27:10,568 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-21 11:27:10,569 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-21 11:27:10,571 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-21 11:27:10,571 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-21 11:27:10,574 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-21 11:27:10,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-21 11:27:10,580 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-21 11:27:10,582 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-21 11:27:10,585 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-21 11:27:10,587 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-21 11:27:10,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-21 11:27:10,598 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-21 11:27:10,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-21 11:27:10,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-21 11:27:10,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-21 11:27:10,615 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-21 11:27:10,615 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-21 11:27:10,615 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-21 11:27:10,618 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-21 11:27:10,619 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-21 11:27:10,620 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-21 11:27:10,620 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-21 11:27:10,622 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-21 11:27:10,623 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-21 11:27:10,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-21 11:27:10,626 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-21 11:27:10,626 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-21 11:27:10,627 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-21 11:27:10,627 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-21 11:27:10,627 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-21 11:27:10,628 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-21 11:27:10,630 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-21 11:27:10,631 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-21 11:27:10,679 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-21 11:27:10,680 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-21 11:27:10,682 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-21 11:27:10,682 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-21 11:27:10,683 INFO L138 SettingsManager]: * Use SBE=true [2020-09-21 11:27:10,683 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-21 11:27:10,683 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-21 11:27:10,684 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-21 11:27:10,684 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-21 11:27:10,684 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-21 11:27:10,685 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-21 11:27:10,685 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-21 11:27:10,686 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-21 11:27:10,686 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-21 11:27:10,686 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-21 11:27:10,687 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-21 11:27:10,687 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-21 11:27:10,687 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-21 11:27:10,687 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-21 11:27:10,688 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-21 11:27:10,688 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-21 11:27:10,688 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 11:27:10,688 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-21 11:27:10,688 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-21 11:27:10,689 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-21 11:27:10,689 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-21 11:27:10,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-21 11:27:10,689 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-21 11:27:10,689 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-21 11:27:10,689 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 -> produce-proofs=true;produce-unsat-cores=true;interpolation-heuristic=FIRST;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;interpolation-heuristic=FIRST;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;interpolation-heuristic=FIRST;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;interpolation-heuristic=FIRST;log-additional-information=true; [2020-09-21 11:27:11,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-21 11:27:11,175 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-21 11:27:11,182 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-21 11:27:11,184 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-21 11:27:11,185 INFO L275 PluginConnector]: CDTParser initialized [2020-09-21 11:27:11,186 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label15.c [2020-09-21 11:27:11,268 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/0c99ffdbc/7218154bb9bd41b4a2a04d77969d1e89/FLAG70f5cbd59 [2020-09-21 11:27:11,922 INFO L306 CDTParser]: Found 1 translation units. [2020-09-21 11:27:11,923 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label15.c [2020-09-21 11:27:11,940 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/0c99ffdbc/7218154bb9bd41b4a2a04d77969d1e89/FLAG70f5cbd59 [2020-09-21 11:27:12,131 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/0c99ffdbc/7218154bb9bd41b4a2a04d77969d1e89 [2020-09-21 11:27:12,144 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-21 11:27:12,150 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-21 11:27:12,151 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-21 11:27:12,151 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-21 11:27:12,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-21 11:27:12,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 11:27:12" (1/1) ... [2020-09-21 11:27:12,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@112bbb30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:27:12, skipping insertion in model container [2020-09-21 11:27:12,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 11:27:12" (1/1) ... [2020-09-21 11:27:12,172 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-21 11:27:12,251 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-21 11:27:12,838 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 11:27:12,849 INFO L203 MainTranslator]: Completed pre-run [2020-09-21 11:27:12,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 11:27:12,998 INFO L208 MainTranslator]: Completed translation [2020-09-21 11:27:12,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:27:12 WrapperNode [2020-09-21 11:27:12,999 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-21 11:27:13,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-21 11:27:13,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-21 11:27:13,000 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-21 11:27:13,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:27:12" (1/1) ... [2020-09-21 11:27:13,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:27:12" (1/1) ... [2020-09-21 11:27:13,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:27:12" (1/1) ... [2020-09-21 11:27:13,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:27:12" (1/1) ... [2020-09-21 11:27:13,100 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:27:12" (1/1) ... [2020-09-21 11:27:13,116 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:27:12" (1/1) ... [2020-09-21 11:27:13,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:27:12" (1/1) ... [2020-09-21 11:27:13,132 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-21 11:27:13,133 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-21 11:27:13,133 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-21 11:27:13,133 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-21 11:27:13,134 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:27:12" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 11:27:13,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-21 11:27:13,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-21 11:27:13,243 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-09-21 11:27:13,243 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-21 11:27:13,244 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-09-21 11:27:13,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-21 11:27:13,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-21 11:27:13,244 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-21 11:27:13,245 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-21 11:27:13,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-21 11:27:13,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-21 11:27:14,619 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-21 11:27:14,619 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-21 11:27:14,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 11:27:14 BoogieIcfgContainer [2020-09-21 11:27:14,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-21 11:27:14,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-21 11:27:14,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-21 11:27:14,644 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-21 11:27:14,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 11:27:12" (1/3) ... [2020-09-21 11:27:14,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a48d67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 11:27:14, skipping insertion in model container [2020-09-21 11:27:14,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:27:12" (2/3) ... [2020-09-21 11:27:14,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a48d67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 11:27:14, skipping insertion in model container [2020-09-21 11:27:14,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 11:27:14" (3/3) ... [2020-09-21 11:27:14,652 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label15.c [2020-09-21 11:27:14,669 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-21 11:27:14,687 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-21 11:27:14,711 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-21 11:27:14,754 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-21 11:27:14,755 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-21 11:27:14,755 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-21 11:27:14,755 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-21 11:27:14,755 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-21 11:27:14,755 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-21 11:27:14,756 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-21 11:27:14,756 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-21 11:27:14,787 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2020-09-21 11:27:14,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-21 11:27:14,798 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 11:27:14,799 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 11:27:14,800 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 11:27:14,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 11:27:14,807 INFO L82 PathProgramCache]: Analyzing trace with hash -553937361, now seen corresponding path program 1 times [2020-09-21 11:27:14,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 11:27:14,817 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1949361213] [2020-09-21 11:27:14,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 11:27:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:27:15,027 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:27:15,028 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:27:15,028 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:27:15,028 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:27:15,029 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 25 [2020-09-21 11:27:15,029 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:27:15,029 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 62 [2020-09-21 11:27:15,029 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:27:15,030 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-21 11:27:15,030 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 6 [2020-09-21 11:27:15,030 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 18 [2020-09-21 11:27:15,030 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 11:27:15,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 11:27:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:27:15,154 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:27:15,154 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:27:15,154 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:27:15,155 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:27:15,155 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 11:27:15,155 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:27:15,155 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-09-21 11:27:15,156 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:27:15,156 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 11:27:15,156 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 11:27:15,156 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-09-21 11:27:15,156 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:27:15,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 11:27:15,183 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1949361213] [2020-09-21 11:27:15,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 11:27:15,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-21 11:27:15,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039490293] [2020-09-21 11:27:15,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 11:27:15,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 11:27:15,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 11:27:15,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-21 11:27:15,216 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 5 states. [2020-09-21 11:27:17,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 11:27:17,560 INFO L93 Difference]: Finished difference Result 730 states and 1301 transitions. [2020-09-21 11:27:17,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-21 11:27:17,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-21 11:27:17,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 11:27:17,607 INFO L225 Difference]: With dead ends: 730 [2020-09-21 11:27:17,608 INFO L226 Difference]: Without dead ends: 447 [2020-09-21 11:27:17,621 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-09-21 11:27:17,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2020-09-21 11:27:17,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 441. [2020-09-21 11:27:17,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2020-09-21 11:27:17,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 672 transitions. [2020-09-21 11:27:17,732 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 672 transitions. Word has length 16 [2020-09-21 11:27:17,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 11:27:17,732 INFO L479 AbstractCegarLoop]: Abstraction has 441 states and 672 transitions. [2020-09-21 11:27:17,733 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 11:27:17,733 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 672 transitions. [2020-09-21 11:27:17,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-09-21 11:27:17,741 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 11:27:17,742 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 11:27:17,742 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-21 11:27:17,742 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 11:27:17,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 11:27:17,743 INFO L82 PathProgramCache]: Analyzing trace with hash 829722045, now seen corresponding path program 1 times [2020-09-21 11:27:17,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 11:27:17,744 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1233189438] [2020-09-21 11:27:17,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 11:27:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:27:17,983 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:27:17,983 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:27:17,983 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:27:17,984 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:27:17,985 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 146 [2020-09-21 11:27:17,985 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:27:17,985 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 118 [2020-09-21 11:27:17,985 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:27:17,985 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 11:27:17,985 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 130 [2020-09-21 11:27:17,986 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 15 [2020-09-21 11:27:17,986 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:27:18,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 11:27:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:27:18,117 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:27:18,117 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:27:18,118 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:27:18,118 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:27:18,118 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 11:27:18,118 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:27:18,119 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1 [2020-09-21 11:27:18,119 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:27:18,119 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 11:27:18,119 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 11:27:18,120 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 11:27:18,120 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 11:27:18,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 11:27:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:27:18,192 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:27:18,192 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:27:18,193 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:27:18,193 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:27:18,193 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 121 [2020-09-21 11:27:18,193 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:27:18,194 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 8 [2020-09-21 11:27:18,194 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:27:18,194 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 11:27:18,194 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 11:27:18,195 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 114 [2020-09-21 11:27:18,195 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:27:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 11:27:18,335 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1233189438] [2020-09-21 11:27:18,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 11:27:18,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-21 11:27:18,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576678751] [2020-09-21 11:27:18,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 11:27:18,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 11:27:18,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 11:27:18,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-21 11:27:18,339 INFO L87 Difference]: Start difference. First operand 441 states and 672 transitions. Second operand 5 states. [2020-09-21 11:27:19,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 11:27:19,864 INFO L93 Difference]: Finished difference Result 1172 states and 1811 transitions. [2020-09-21 11:27:19,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 11:27:19,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2020-09-21 11:27:19,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 11:27:19,871 INFO L225 Difference]: With dead ends: 1172 [2020-09-21 11:27:19,872 INFO L226 Difference]: Without dead ends: 737 [2020-09-21 11:27:19,874 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-09-21 11:27:19,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2020-09-21 11:27:19,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 588. [2020-09-21 11:27:19,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2020-09-21 11:27:19,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 841 transitions. [2020-09-21 11:27:19,915 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 841 transitions. Word has length 135 [2020-09-21 11:27:19,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 11:27:19,916 INFO L479 AbstractCegarLoop]: Abstraction has 588 states and 841 transitions. [2020-09-21 11:27:19,916 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 11:27:19,916 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 841 transitions. [2020-09-21 11:27:19,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-09-21 11:27:19,924 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 11:27:19,924 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 11:27:19,924 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-21 11:27:19,925 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 11:27:19,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 11:27:19,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1210877841, now seen corresponding path program 1 times [2020-09-21 11:27:19,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 11:27:19,926 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1121168710] [2020-09-21 11:27:19,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 11:27:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:27:20,015 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:27:20,016 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:27:20,016 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:27:20,016 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:27:20,016 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 152 [2020-09-21 11:27:20,017 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:27:20,017 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 31 [2020-09-21 11:27:20,017 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:27:20,017 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-21 11:27:20,017 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 6 [2020-09-21 11:27:20,018 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 131 [2020-09-21 11:27:20,018 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:27:20,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 11:27:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:27:20,107 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:27:20,108 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:27:20,108 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:27:20,108 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:27:20,108 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 11:27:20,109 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:27:20,109 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-09-21 11:27:20,109 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:27:20,109 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 11:27:20,110 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 11:27:20,110 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-09-21 11:27:20,110 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:27:20,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 11:27:20,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:27:20,185 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:27:20,185 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:27:20,186 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:27:20,186 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:27:20,186 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 127 [2020-09-21 11:27:20,186 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:27:20,187 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 15 [2020-09-21 11:27:20,187 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:27:20,187 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 11:27:20,187 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-21 11:27:20,188 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 126 [2020-09-21 11:27:20,188 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:27:20,345 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 11:27:20,345 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1121168710] [2020-09-21 11:27:20,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 11:27:20,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-21 11:27:20,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484919030] [2020-09-21 11:27:20,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-21 11:27:20,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 11:27:20,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-21 11:27:20,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-21 11:27:20,350 INFO L87 Difference]: Start difference. First operand 588 states and 841 transitions. Second operand 8 states. [2020-09-21 11:27:22,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 11:27:22,598 INFO L93 Difference]: Finished difference Result 1927 states and 2946 transitions. [2020-09-21 11:27:22,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-21 11:27:22,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 141 [2020-09-21 11:27:22,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 11:27:22,616 INFO L225 Difference]: With dead ends: 1927 [2020-09-21 11:27:22,617 INFO L226 Difference]: Without dead ends: 1345 [2020-09-21 11:27:22,620 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2020-09-21 11:27:22,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2020-09-21 11:27:22,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 896. [2020-09-21 11:27:22,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2020-09-21 11:27:22,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1204 transitions. [2020-09-21 11:27:22,694 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1204 transitions. Word has length 141 [2020-09-21 11:27:22,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 11:27:22,696 INFO L479 AbstractCegarLoop]: Abstraction has 896 states and 1204 transitions. [2020-09-21 11:27:22,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-21 11:27:22,696 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1204 transitions. [2020-09-21 11:27:22,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-09-21 11:27:22,715 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 11:27:22,716 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-09-21 11:27:22,716 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-21 11:27:22,717 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 11:27:22,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 11:27:22,717 INFO L82 PathProgramCache]: Analyzing trace with hash -2135877389, now seen corresponding path program 1 times [2020-09-21 11:27:22,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 11:27:22,718 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [616414221] [2020-09-21 11:27:22,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 11:27:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:27:22,791 FATAL L256 erpolLogProxyWrapper]: Difference in size: 5 [2020-09-21 11:27:22,792 FATAL L256 erpolLogProxyWrapper]: Difference in depth: -84 [2020-09-21 11:27:22,792 FATAL L256 erpolLogProxyWrapper]: Difference in width: 84 [2020-09-21 11:27:22,792 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:27:22,792 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 233 [2020-09-21 11:27:22,793 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:27:22,793 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 21 [2020-09-21 11:27:22,793 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:27:22,793 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 11:27:22,794 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 90 [2020-09-21 11:27:22,794 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 26 [2020-09-21 11:27:22,794 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:27:22,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 11:27:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:27:22,889 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:27:22,889 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:27:22,889 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:27:22,889 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:27:22,890 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 11:27:22,890 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:27:22,890 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1 [2020-09-21 11:27:22,890 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:27:22,891 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 11:27:22,891 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 11:27:22,891 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 11:27:22,891 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:27:22,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 11:27:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:27:22,939 FATAL L256 erpolLogProxyWrapper]: Difference in size: 1 [2020-09-21 11:27:22,939 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:27:22,940 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:27:22,940 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:27:22,940 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 81 [2020-09-21 11:27:22,940 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:27:22,941 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 11 [2020-09-21 11:27:22,941 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:27:22,941 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 11:27:22,941 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 11:27:22,942 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-09-21 11:27:22,942 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:27:22,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-09-21 11:27:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:27:23,041 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:27:23,041 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:27:23,042 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:27:23,042 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:27:23,042 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 127 [2020-09-21 11:27:23,043 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:27:23,043 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 17 [2020-09-21 11:27:23,043 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:27:23,044 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 11:27:23,044 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-21 11:27:23,044 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 126 [2020-09-21 11:27:23,044 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 11:27:23,282 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 94 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-21 11:27:23,283 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [616414221] [2020-09-21 11:27:23,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 11:27:23,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 11:27:23,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709177494] [2020-09-21 11:27:23,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 11:27:23,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 11:27:23,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 11:27:23,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 11:27:23,285 INFO L87 Difference]: Start difference. First operand 896 states and 1204 transitions. Second operand 7 states. [2020-09-21 11:27:24,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 11:27:24,675 INFO L93 Difference]: Finished difference Result 1873 states and 2679 transitions. [2020-09-21 11:27:24,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-21 11:27:24,676 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 220 [2020-09-21 11:27:24,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 11:27:24,684 INFO L225 Difference]: With dead ends: 1873 [2020-09-21 11:27:24,685 INFO L226 Difference]: Without dead ends: 956 [2020-09-21 11:27:24,689 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-09-21 11:27:24,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2020-09-21 11:27:24,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 906. [2020-09-21 11:27:24,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2020-09-21 11:27:24,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1226 transitions. [2020-09-21 11:27:24,738 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1226 transitions. Word has length 220 [2020-09-21 11:27:24,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 11:27:24,739 INFO L479 AbstractCegarLoop]: Abstraction has 906 states and 1226 transitions. [2020-09-21 11:27:24,739 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 11:27:24,739 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1226 transitions. [2020-09-21 11:27:24,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2020-09-21 11:27:24,745 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 11:27:24,745 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-09-21 11:27:24,745 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-21 11:27:24,746 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 11:27:24,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 11:27:24,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1874245381, now seen corresponding path program 1 times [2020-09-21 11:27:24,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 11:27:24,747 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2116075056] [2020-09-21 11:27:24,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 11:27:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:27:24,849 FATAL L256 erpolLogProxyWrapper]: Difference in size: 5 [2020-09-21 11:27:24,849 FATAL L256 erpolLogProxyWrapper]: Difference in depth: -120 [2020-09-21 11:27:24,849 FATAL L256 erpolLogProxyWrapper]: Difference in width: 120 [2020-09-21 11:27:24,850 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:27:24,850 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 269 [2020-09-21 11:27:24,850 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:27:24,850 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 24 [2020-09-21 11:27:24,850 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:27:24,851 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 11:27:24,851 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 126 [2020-09-21 11:27:24,851 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 128 [2020-09-21 11:27:24,851 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:27:24,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 11:27:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:27:24,968 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:27:24,969 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:27:24,969 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:27:24,969 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:27:24,969 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 11:27:24,969 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:27:24,970 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1 [2020-09-21 11:27:24,970 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:27:24,970 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 11:27:24,970 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 11:27:24,971 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 11:27:24,971 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:27:24,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 11:27:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:27:25,018 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:27:25,018 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:27:25,019 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:27:25,019 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:27:25,019 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 117 [2020-09-21 11:27:25,019 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:27:25,020 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-09-21 11:27:25,020 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:27:25,020 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 11:27:25,020 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 11:27:25,021 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 110 [2020-09-21 11:27:25,021 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:27:25,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-09-21 11:27:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:27:25,134 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:27:25,134 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:27:25,135 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:27:25,135 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:27:25,135 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 127 [2020-09-21 11:27:25,136 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:27:25,136 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 10 [2020-09-21 11:27:25,136 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:27:25,136 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 11:27:25,137 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-21 11:27:25,137 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 126 [2020-09-21 11:27:25,137 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 11:27:25,458 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 130 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-21 11:27:25,459 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2116075056] [2020-09-21 11:27:25,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 11:27:25,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-21 11:27:25,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031997933] [2020-09-21 11:27:25,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-21 11:27:25,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 11:27:25,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-21 11:27:25,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-09-21 11:27:25,462 INFO L87 Difference]: Start difference. First operand 906 states and 1226 transitions. Second operand 8 states. [2020-09-21 11:27:27,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 11:27:27,062 INFO L93 Difference]: Finished difference Result 2122 states and 2924 transitions. [2020-09-21 11:27:27,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-21 11:27:27,063 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 256 [2020-09-21 11:27:27,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 11:27:27,070 INFO L225 Difference]: With dead ends: 2122 [2020-09-21 11:27:27,070 INFO L226 Difference]: Without dead ends: 1222 [2020-09-21 11:27:27,073 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-09-21 11:27:27,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2020-09-21 11:27:27,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1210. [2020-09-21 11:27:27,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2020-09-21 11:27:27,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1580 transitions. [2020-09-21 11:27:27,124 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1580 transitions. Word has length 256 [2020-09-21 11:27:27,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 11:27:27,125 INFO L479 AbstractCegarLoop]: Abstraction has 1210 states and 1580 transitions. [2020-09-21 11:27:27,125 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-21 11:27:27,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1580 transitions. [2020-09-21 11:27:27,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2020-09-21 11:27:27,134 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 11:27:27,134 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-09-21 11:27:27,134 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-21 11:27:27,135 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 11:27:27,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 11:27:27,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1051985820, now seen corresponding path program 1 times [2020-09-21 11:27:27,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 11:27:27,137 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1724533014] [2020-09-21 11:27:27,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 11:27:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:27:27,310 FATAL L256 erpolLogProxyWrapper]: Difference in size: 5 [2020-09-21 11:27:27,311 FATAL L256 erpolLogProxyWrapper]: Difference in depth: -120 [2020-09-21 11:27:27,311 FATAL L256 erpolLogProxyWrapper]: Difference in width: 120 [2020-09-21 11:27:27,311 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:27:27,311 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 343 [2020-09-21 11:27:27,312 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:27:27,312 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 64 [2020-09-21 11:27:27,312 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:27:27,313 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-21 11:27:27,313 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 126 [2020-09-21 11:27:27,313 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 202 [2020-09-21 11:27:27,314 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 11:27:27,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 11:27:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:27:27,422 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:27:27,422 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:27:27,423 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:27:27,423 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:27:27,423 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 11:27:27,423 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:27:27,423 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1 [2020-09-21 11:27:27,424 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:27:27,424 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 11:27:27,424 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 11:27:27,424 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 11:27:27,424 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:27:27,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 11:27:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:27:27,470 FATAL L256 erpolLogProxyWrapper]: Difference in size: 1 [2020-09-21 11:27:27,471 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:27:27,471 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:27:27,471 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:27:27,471 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 117 [2020-09-21 11:27:27,472 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:27:27,472 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 8 [2020-09-21 11:27:27,472 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:27:27,472 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 11:27:27,472 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 11:27:27,473 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 110 [2020-09-21 11:27:27,473 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:27:27,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-09-21 11:27:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:27:27,541 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:27:27,541 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:27:27,541 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:27:27,542 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:27:27,542 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 74 [2020-09-21 11:27:27,542 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:27:27,542 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4 [2020-09-21 11:27:27,542 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:27:27,543 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 11:27:27,543 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-21 11:27:27,543 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 73 [2020-09-21 11:27:27,543 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:27:27,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2020-09-21 11:27:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:27:27,629 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:27:27,629 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:27:27,630 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:27:27,630 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:27:27,630 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 127 [2020-09-21 11:27:27,630 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:27:27,631 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 13 [2020-09-21 11:27:27,631 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:27:27,631 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 11:27:27,631 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-21 11:27:27,631 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 126 [2020-09-21 11:27:27,632 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:27:27,971 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 208 proven. 71 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-09-21 11:27:27,972 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1724533014] [2020-09-21 11:27:27,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 11:27:27,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-21 11:27:27,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168723497] [2020-09-21 11:27:27,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-21 11:27:27,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 11:27:27,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-21 11:27:27,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-21 11:27:27,974 INFO L87 Difference]: Start difference. First operand 1210 states and 1580 transitions. Second operand 8 states. [2020-09-21 11:27:30,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 11:27:30,326 INFO L93 Difference]: Finished difference Result 3376 states and 4795 transitions. [2020-09-21 11:27:30,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-21 11:27:30,327 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 328 [2020-09-21 11:27:30,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 11:27:30,345 INFO L225 Difference]: With dead ends: 3376 [2020-09-21 11:27:30,345 INFO L226 Difference]: Without dead ends: 2172 [2020-09-21 11:27:30,350 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2020-09-21 11:27:30,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2020-09-21 11:27:30,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 2102. [2020-09-21 11:27:30,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2020-09-21 11:27:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 2669 transitions. [2020-09-21 11:27:30,428 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 2669 transitions. Word has length 328 [2020-09-21 11:27:30,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 11:27:30,428 INFO L479 AbstractCegarLoop]: Abstraction has 2102 states and 2669 transitions. [2020-09-21 11:27:30,429 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-21 11:27:30,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 2669 transitions. [2020-09-21 11:27:30,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2020-09-21 11:27:30,439 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 11:27:30,439 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-09-21 11:27:30,439 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-21 11:27:30,440 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 11:27:30,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 11:27:30,440 INFO L82 PathProgramCache]: Analyzing trace with hash -95771531, now seen corresponding path program 1 times [2020-09-21 11:27:30,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 11:27:30,441 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [465921306] [2020-09-21 11:27:30,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 11:27:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-21 11:27:30,589 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-21 11:27:30,589 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-21 11:27:30,596 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-21 11:27:30,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 11:27:30 BoogieIcfgContainer [2020-09-21 11:27:30,645 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-21 11:27:30,649 INFO L168 Benchmark]: Toolchain (without parser) took 18502.07 ms. Allocated memory was 139.5 MB in the beginning and 542.6 MB in the end (delta: 403.2 MB). Free memory was 99.8 MB in the beginning and 468.5 MB in the end (delta: -368.7 MB). Peak memory consumption was 333.8 MB. Max. memory is 7.1 GB. [2020-09-21 11:27:30,649 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-21 11:27:30,650 INFO L168 Benchmark]: CACSL2BoogieTranslator took 848.47 ms. Allocated memory was 139.5 MB in the beginning and 205.0 MB in the end (delta: 65.5 MB). Free memory was 99.2 MB in the beginning and 171.2 MB in the end (delta: -72.0 MB). Peak memory consumption was 33.4 MB. Max. memory is 7.1 GB. [2020-09-21 11:27:30,651 INFO L168 Benchmark]: Boogie Preprocessor took 132.32 ms. Allocated memory is still 205.0 MB. Free memory was 170.5 MB in the beginning and 166.3 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. [2020-09-21 11:27:30,652 INFO L168 Benchmark]: RCFGBuilder took 1501.96 ms. Allocated memory was 205.0 MB in the beginning and 237.5 MB in the end (delta: 32.5 MB). Free memory was 166.3 MB in the beginning and 182.9 MB in the end (delta: -16.5 MB). Peak memory consumption was 83.5 MB. Max. memory is 7.1 GB. [2020-09-21 11:27:30,653 INFO L168 Benchmark]: TraceAbstraction took 16006.71 ms. Allocated memory was 237.5 MB in the beginning and 542.6 MB in the end (delta: 305.1 MB). Free memory was 181.4 MB in the beginning and 468.5 MB in the end (delta: -287.1 MB). Peak memory consumption was 317.3 MB. Max. memory is 7.1 GB. [2020-09-21 11:27:30,657 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.23 ms. Allocated memory is still 139.5 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 848.47 ms. Allocated memory was 139.5 MB in the beginning and 205.0 MB in the end (delta: 65.5 MB). Free memory was 99.2 MB in the beginning and 171.2 MB in the end (delta: -72.0 MB). Peak memory consumption was 33.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 132.32 ms. Allocated memory is still 205.0 MB. Free memory was 170.5 MB in the beginning and 166.3 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1501.96 ms. Allocated memory was 205.0 MB in the beginning and 237.5 MB in the end (delta: 32.5 MB). Free memory was 166.3 MB in the beginning and 182.9 MB in the end (delta: -16.5 MB). Peak memory consumption was 83.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16006.71 ms. Allocated memory was 237.5 MB in the beginning and 542.6 MB in the end (delta: 305.1 MB). Free memory was 181.4 MB in the beginning and 468.5 MB in the end (delta: -287.1 MB). Peak memory consumption was 317.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 34]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L426] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L427] a10 = 1 [L429] return 25; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND TRUE ((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 ))) [L287] a1 = ((((((a1 % 89)+ 74) - -21) * 5) % 89)- -118) [L288] a19 = 10 [L290] return 25; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) [L460] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) [L465] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) [L471] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) [L476] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) [L481] COND TRUE (((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10)) [L482] a1 = ((((a1 * 10)/ -9) * 5) - 333686) [L483] a10 = 4 [L484] a19 = 6 [L486] return -1; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND TRUE (((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)) [L34] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 215 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.8s, OverallIterations: 7, TraceHistogramMax: 4, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 172 SDtfs, 2814 SDslu, 245 SDs, 0 SdLazy, 5714 SolverSat, 1034 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2102occurred 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.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 736 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1437 NumberOfCodeBlocks, 1437 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1090 ConstructedInterpolants, 0 QuantifiedInterpolants, 767092 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 458/534 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...