/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration false -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label58.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-177f698 [2020-08-21 13:23:41,218 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-21 13:23:41,221 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-21 13:23:41,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-21 13:23:41,264 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-21 13:23:41,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-21 13:23:41,278 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-21 13:23:41,281 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-21 13:23:41,285 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-21 13:23:41,287 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-21 13:23:41,290 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-21 13:23:41,293 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-21 13:23:41,293 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-21 13:23:41,296 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-21 13:23:41,299 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-21 13:23:41,301 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-21 13:23:41,303 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-21 13:23:41,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-21 13:23:41,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-21 13:23:41,313 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-21 13:23:41,317 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-21 13:23:41,319 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-21 13:23:41,320 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-21 13:23:41,321 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-21 13:23:41,326 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-21 13:23:41,327 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-21 13:23:41,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-21 13:23:41,330 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-21 13:23:41,331 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-21 13:23:41,333 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-21 13:23:41,333 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-21 13:23:41,334 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-21 13:23:41,335 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-21 13:23:41,335 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-21 13:23:41,337 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-21 13:23:41,337 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-21 13:23:41,338 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-21 13:23:41,338 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-21 13:23:41,338 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-21 13:23:41,339 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-21 13:23:41,341 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-21 13:23:41,342 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-21 13:23:41,387 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-21 13:23:41,387 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-21 13:23:41,390 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-21 13:23:41,390 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-21 13:23:41,391 INFO L138 SettingsManager]: * Use SBE=true [2020-08-21 13:23:41,391 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-21 13:23:41,391 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-21 13:23:41,392 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-21 13:23:41,392 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-21 13:23:41,392 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-21 13:23:41,393 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-21 13:23:41,394 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-21 13:23:41,394 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-21 13:23:41,394 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-21 13:23:41,395 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-21 13:23:41,395 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-21 13:23:41,395 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-21 13:23:41,395 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-21 13:23:41,395 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-21 13:23:41,396 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-21 13:23:41,396 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-21 13:23:41,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-21 13:23:41,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-21 13:23:41,397 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-21 13:23:41,397 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-21 13:23:41,397 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-21 13:23:41,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-21 13:23:41,397 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-21 13:23:41,398 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-21 13:23:41,398 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> false [2020-08-21 13:23:41,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-21 13:23:41,708 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-21 13:23:41,711 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-21 13:23:41,713 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-21 13:23:41,714 INFO L275 PluginConnector]: CDTParser initialized [2020-08-21 13:23:41,714 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label58.c [2020-08-21 13:23:41,793 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e513ca435/56a0bc15144a4c229c0c53fafaffa483/FLAGdcb10c729 [2020-08-21 13:23:42,486 INFO L306 CDTParser]: Found 1 translation units. [2020-08-21 13:23:42,487 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem11_label58.c [2020-08-21 13:23:42,501 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e513ca435/56a0bc15144a4c229c0c53fafaffa483/FLAGdcb10c729 [2020-08-21 13:23:42,666 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e513ca435/56a0bc15144a4c229c0c53fafaffa483 [2020-08-21 13:23:42,677 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-21 13:23:42,679 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-21 13:23:42,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-21 13:23:42,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-21 13:23:42,684 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-21 13:23:42,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 01:23:42" (1/1) ... [2020-08-21 13:23:42,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36345b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:23:42, skipping insertion in model container [2020-08-21 13:23:42,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 01:23:42" (1/1) ... [2020-08-21 13:23:42,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-21 13:23:42,751 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-21 13:23:43,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 13:23:43,415 INFO L203 MainTranslator]: Completed pre-run [2020-08-21 13:23:43,615 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 13:23:43,639 INFO L208 MainTranslator]: Completed translation [2020-08-21 13:23:43,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:23:43 WrapperNode [2020-08-21 13:23:43,640 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-21 13:23:43,640 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-21 13:23:43,641 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-21 13:23:43,641 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-21 13:23:43,663 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:23:43" (1/1) ... [2020-08-21 13:23:43,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:23:43" (1/1) ... [2020-08-21 13:23:43,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:23:43" (1/1) ... [2020-08-21 13:23:43,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:23:43" (1/1) ... [2020-08-21 13:23:43,742 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:23:43" (1/1) ... [2020-08-21 13:23:43,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:23:43" (1/1) ... [2020-08-21 13:23:43,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:23:43" (1/1) ... [2020-08-21 13:23:43,793 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-21 13:23:43,794 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-21 13:23:43,795 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-21 13:23:43,795 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-21 13:23:43,796 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:23:43" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-21 13:23:43,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-21 13:23:43,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-21 13:23:43,902 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-08-21 13:23:43,902 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-21 13:23:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-08-21 13:23:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-21 13:23:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-21 13:23:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-08-21 13:23:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-21 13:23:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-21 13:23:43,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-21 13:23:45,711 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-21 13:23:45,711 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-08-21 13:23:45,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 01:23:45 BoogieIcfgContainer [2020-08-21 13:23:45,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-21 13:23:45,719 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-21 13:23:45,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-21 13:23:45,722 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-21 13:23:45,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.08 01:23:42" (1/3) ... [2020-08-21 13:23:45,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57aeac6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 01:23:45, skipping insertion in model container [2020-08-21 13:23:45,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:23:43" (2/3) ... [2020-08-21 13:23:45,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57aeac6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 01:23:45, skipping insertion in model container [2020-08-21 13:23:45,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 01:23:45" (3/3) ... [2020-08-21 13:23:45,726 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label58.c [2020-08-21 13:23:45,736 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-21 13:23:45,749 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-21 13:23:45,763 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-21 13:23:45,790 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-21 13:23:45,790 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-21 13:23:45,790 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-21 13:23:45,790 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-21 13:23:45,791 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-21 13:23:45,791 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-21 13:23:45,791 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-21 13:23:45,791 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-21 13:23:45,814 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states. [2020-08-21 13:23:45,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-08-21 13:23:45,821 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:23:45,823 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 13:23:45,823 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:23:45,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:23:45,829 INFO L82 PathProgramCache]: Analyzing trace with hash -806848853, now seen corresponding path program 1 times [2020-08-21 13:23:45,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:23:45,838 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1198491736] [2020-08-21 13:23:45,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:23:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:23:46,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:23:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:23:46,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-08-21 13:23:46,183 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1198491736] [2020-08-21 13:23:46,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 13:23:46,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-08-21 13:23:46,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261586475] [2020-08-21 13:23:46,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-21 13:23:46,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:23:46,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-21 13:23:46,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-21 13:23:46,210 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 5 states. [2020-08-21 13:23:49,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:23:49,690 INFO L93 Difference]: Finished difference Result 998 states and 1793 transitions. [2020-08-21 13:23:49,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-21 13:23:49,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-08-21 13:23:49,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:23:49,726 INFO L225 Difference]: With dead ends: 998 [2020-08-21 13:23:49,726 INFO L226 Difference]: Without dead ends: 638 [2020-08-21 13:23:49,738 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-08-21 13:23:49,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-08-21 13:23:49,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 621. [2020-08-21 13:23:49,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2020-08-21 13:23:49,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 950 transitions. [2020-08-21 13:23:49,853 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 950 transitions. Word has length 24 [2020-08-21 13:23:49,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:23:49,854 INFO L479 AbstractCegarLoop]: Abstraction has 621 states and 950 transitions. [2020-08-21 13:23:49,854 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-21 13:23:49,854 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 950 transitions. [2020-08-21 13:23:49,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-08-21 13:23:49,859 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:23:49,859 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 13:23:49,860 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-21 13:23:49,860 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:23:49,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:23:49,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1993121934, now seen corresponding path program 1 times [2020-08-21 13:23:49,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:23:49,861 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [758097390] [2020-08-21 13:23:49,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:23:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:23:50,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:23:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:23:50,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 13:23:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:23:50,232 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 13:23:50,233 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [758097390] [2020-08-21 13:23:50,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 13:23:50,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-08-21 13:23:50,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180611962] [2020-08-21 13:23:50,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 13:23:50,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:23:50,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 13:23:50,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-21 13:23:50,236 INFO L87 Difference]: Start difference. First operand 621 states and 950 transitions. Second operand 7 states. [2020-08-21 13:23:53,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:23:53,097 INFO L93 Difference]: Finished difference Result 1865 states and 2955 transitions. [2020-08-21 13:23:53,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-21 13:23:53,101 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2020-08-21 13:23:53,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:23:53,111 INFO L225 Difference]: With dead ends: 1865 [2020-08-21 13:23:53,111 INFO L226 Difference]: Without dead ends: 1250 [2020-08-21 13:23:53,114 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-08-21 13:23:53,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2020-08-21 13:23:53,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1217. [2020-08-21 13:23:53,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2020-08-21 13:23:53,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1704 transitions. [2020-08-21 13:23:53,177 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1704 transitions. Word has length 94 [2020-08-21 13:23:53,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:23:53,177 INFO L479 AbstractCegarLoop]: Abstraction has 1217 states and 1704 transitions. [2020-08-21 13:23:53,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 13:23:53,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1704 transitions. [2020-08-21 13:23:53,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-08-21 13:23:53,180 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:23:53,181 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 13:23:53,181 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-21 13:23:53,181 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:23:53,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:23:53,182 INFO L82 PathProgramCache]: Analyzing trace with hash 611805402, now seen corresponding path program 1 times [2020-08-21 13:23:53,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:23:53,182 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1444550189] [2020-08-21 13:23:53,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:23:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:23:53,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:23:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:23:53,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 13:23:53,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:23:53,361 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 13:23:53,362 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1444550189] [2020-08-21 13:23:53,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 13:23:53,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-08-21 13:23:53,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86083489] [2020-08-21 13:23:53,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 13:23:53,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:23:53,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 13:23:53,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-21 13:23:53,364 INFO L87 Difference]: Start difference. First operand 1217 states and 1704 transitions. Second operand 7 states. [2020-08-21 13:23:56,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:23:56,487 INFO L93 Difference]: Finished difference Result 3652 states and 5269 transitions. [2020-08-21 13:23:56,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-21 13:23:56,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2020-08-21 13:23:56,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:23:56,505 INFO L225 Difference]: With dead ends: 3652 [2020-08-21 13:23:56,505 INFO L226 Difference]: Without dead ends: 2441 [2020-08-21 13:23:56,509 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-08-21 13:23:56,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2441 states. [2020-08-21 13:23:56,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2441 to 2216. [2020-08-21 13:23:56,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2020-08-21 13:23:56,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 2966 transitions. [2020-08-21 13:23:56,590 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 2966 transitions. Word has length 104 [2020-08-21 13:23:56,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:23:56,591 INFO L479 AbstractCegarLoop]: Abstraction has 2216 states and 2966 transitions. [2020-08-21 13:23:56,591 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 13:23:56,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 2966 transitions. [2020-08-21 13:23:56,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2020-08-21 13:23:56,598 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:23:56,598 INFO L422 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 13:23:56,599 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-21 13:23:56,599 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:23:56,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:23:56,600 INFO L82 PathProgramCache]: Analyzing trace with hash 978301792, now seen corresponding path program 1 times [2020-08-21 13:23:56,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:23:56,600 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [192438898] [2020-08-21 13:23:56,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:23:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:23:56,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:23:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:23:56,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 13:23:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:23:56,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-21 13:23:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:23:56,920 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 34 proven. 65 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-21 13:23:56,921 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [192438898] [2020-08-21 13:23:56,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 13:23:56,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 13:23:56,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566361347] [2020-08-21 13:23:56,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 13:23:56,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:23:56,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 13:23:56,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-21 13:23:56,923 INFO L87 Difference]: Start difference. First operand 2216 states and 2966 transitions. Second operand 7 states. [2020-08-21 13:23:59,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:23:59,374 INFO L93 Difference]: Finished difference Result 4487 states and 6072 transitions. [2020-08-21 13:23:59,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-21 13:23:59,375 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 167 [2020-08-21 13:23:59,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:23:59,393 INFO L225 Difference]: With dead ends: 4487 [2020-08-21 13:23:59,393 INFO L226 Difference]: Without dead ends: 2277 [2020-08-21 13:23:59,400 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-08-21 13:23:59,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2277 states. [2020-08-21 13:23:59,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2277 to 2218. [2020-08-21 13:23:59,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2218 states. [2020-08-21 13:23:59,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 2944 transitions. [2020-08-21 13:23:59,469 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 2944 transitions. Word has length 167 [2020-08-21 13:23:59,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:23:59,469 INFO L479 AbstractCegarLoop]: Abstraction has 2218 states and 2944 transitions. [2020-08-21 13:23:59,470 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 13:23:59,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 2944 transitions. [2020-08-21 13:23:59,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-08-21 13:23:59,475 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:23:59,475 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-08-21 13:23:59,475 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-21 13:23:59,475 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:23:59,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:23:59,476 INFO L82 PathProgramCache]: Analyzing trace with hash -2103883149, now seen corresponding path program 1 times [2020-08-21 13:23:59,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:23:59,477 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1470618002] [2020-08-21 13:23:59,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:23:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:23:59,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:23:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:23:59,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 13:23:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:23:59,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2020-08-21 13:23:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:23:59,865 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-08-21 13:23:59,866 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1470618002] [2020-08-21 13:23:59,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 13:23:59,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-08-21 13:23:59,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10363509] [2020-08-21 13:23:59,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-21 13:23:59,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:23:59,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-21 13:23:59,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-21 13:23:59,868 INFO L87 Difference]: Start difference. First operand 2218 states and 2944 transitions. Second operand 5 states. [2020-08-21 13:24:02,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:24:02,069 INFO L93 Difference]: Finished difference Result 5592 states and 7708 transitions. [2020-08-21 13:24:02,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 13:24:02,069 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 220 [2020-08-21 13:24:02,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:24:02,090 INFO L225 Difference]: With dead ends: 5592 [2020-08-21 13:24:02,090 INFO L226 Difference]: Without dead ends: 3380 [2020-08-21 13:24:02,097 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-08-21 13:24:02,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3380 states. [2020-08-21 13:24:02,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3380 to 3374. [2020-08-21 13:24:02,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3374 states. [2020-08-21 13:24:02,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3374 states to 3374 states and 4588 transitions. [2020-08-21 13:24:02,236 INFO L78 Accepts]: Start accepts. Automaton has 3374 states and 4588 transitions. Word has length 220 [2020-08-21 13:24:02,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:24:02,238 INFO L479 AbstractCegarLoop]: Abstraction has 3374 states and 4588 transitions. [2020-08-21 13:24:02,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-21 13:24:02,239 INFO L276 IsEmpty]: Start isEmpty. Operand 3374 states and 4588 transitions. [2020-08-21 13:24:02,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2020-08-21 13:24:02,246 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:24:02,246 INFO L422 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-08-21 13:24:02,247 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-21 13:24:02,247 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:24:02,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:24:02,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1090702368, now seen corresponding path program 1 times [2020-08-21 13:24:02,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:24:02,248 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1920050717] [2020-08-21 13:24:02,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:24:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-21 13:24:02,393 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-21 13:24:02,394 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-21 13:24:02,410 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-21 13:24:02,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 01:24:02 BoogieIcfgContainer [2020-08-21 13:24:02,495 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-21 13:24:02,502 INFO L168 Benchmark]: Toolchain (without parser) took 19820.61 ms. Allocated memory was 141.0 MB in the beginning and 461.4 MB in the end (delta: 320.3 MB). Free memory was 100.8 MB in the beginning and 369.6 MB in the end (delta: -268.8 MB). Peak memory consumption was 51.6 MB. Max. memory is 7.1 GB. [2020-08-21 13:24:02,504 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 141.0 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-08-21 13:24:02,507 INFO L168 Benchmark]: CACSL2BoogieTranslator took 960.04 ms. Allocated memory was 141.0 MB in the beginning and 205.0 MB in the end (delta: 64.0 MB). Free memory was 100.6 MB in the beginning and 145.3 MB in the end (delta: -44.6 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. [2020-08-21 13:24:02,512 INFO L168 Benchmark]: Boogie Preprocessor took 153.26 ms. Allocated memory is still 205.0 MB. Free memory was 145.3 MB in the beginning and 137.8 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 7.1 GB. [2020-08-21 13:24:02,513 INFO L168 Benchmark]: RCFGBuilder took 1923.58 ms. Allocated memory was 205.0 MB in the beginning and 248.5 MB in the end (delta: 43.5 MB). Free memory was 137.8 MB in the beginning and 209.0 MB in the end (delta: -71.2 MB). Peak memory consumption was 91.3 MB. Max. memory is 7.1 GB. [2020-08-21 13:24:02,513 INFO L168 Benchmark]: TraceAbstraction took 16778.09 ms. Allocated memory was 248.5 MB in the beginning and 461.4 MB in the end (delta: 212.9 MB). Free memory was 209.0 MB in the beginning and 369.6 MB in the end (delta: -160.6 MB). Peak memory consumption was 52.2 MB. Max. memory is 7.1 GB. [2020-08-21 13:24:02,524 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.14 ms. Allocated memory is still 141.0 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 960.04 ms. Allocated memory was 141.0 MB in the beginning and 205.0 MB in the end (delta: 64.0 MB). Free memory was 100.6 MB in the beginning and 145.3 MB in the end (delta: -44.6 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 153.26 ms. Allocated memory is still 205.0 MB. Free memory was 145.3 MB in the beginning and 137.8 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1923.58 ms. Allocated memory was 205.0 MB in the beginning and 248.5 MB in the end (delta: 43.5 MB). Free memory was 137.8 MB in the beginning and 209.0 MB in the end (delta: -71.2 MB). Peak memory consumption was 91.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16778.09 ms. Allocated memory was 248.5 MB in the beginning and 461.4 MB in the end (delta: 212.9 MB). Free memory was 209.0 MB in the beginning and 369.6 MB in the end (delta: -160.6 MB). Peak memory consumption was 52.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 60]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int inputA = 1; [L8] int inputD = 4; [L9] int inputB = 2; [L10] int inputE = 5; [L11] int inputF = 6; [L12] int inputC = 3; [L15] int a29 = 130; [L16] int a4 = 1; [L17] int a23 = 312; [L18] int a8 = 15; [L19] int a25 = 10; [L20] int a3 = 1; [L1031] int output = -1; [L1034] COND TRUE 1 [L1037] int input; [L1038] input = __VERIFIER_nondet_int() [L1039] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1042] CALL, EXPR calculate_output(input) [L23] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L26] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L29] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L32] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L35] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L38] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L41] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L44] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L47] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L50] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L53] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L56] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L59] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L62] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L65] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L68] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L71] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L74] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L77] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L80] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L83] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L86] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L89] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L92] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L95] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L98] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L101] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L104] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L107] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L110] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L113] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L116] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L119] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L122] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L125] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L128] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L131] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L134] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L137] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L140] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L143] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L146] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L149] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L152] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L155] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L158] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L161] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L164] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L167] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L170] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L173] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L176] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L179] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L182] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) [L185] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L188] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L191] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L194] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L197] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L200] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L203] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L207] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) [L214] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) [L221] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) [L227] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) [L233] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) [L240] COND FALSE !(((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1))) [L247] COND FALSE !((((a3==1) && (!(a4==1) && (( a29 <= 140 && ((input == 1) && ((a25==12) || ((a25==10) || (a25==11))))) && ((-43 < a23) && (138 >= a23)) ))) && (a8==15))) [L254] COND FALSE !(((( ((245 < a29) && (277 >= a29)) && (( a23 <= -43 && (!(a4==1) && (input == 1))) && (a25==11))) && (a8==15)) && (a3==1))) [L260] COND FALSE !(((((a4==1) && (((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && (a8==15))) && 306 < a23 ) && (a3==1))) [L265] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) [L268] COND FALSE !(( a29 <= 140 && ((((a8==15) && ((a3==1) && ((input == 1) && ((a25==12) || (a25==13))))) && !(a4==1)) && a23 <= -43 ))) [L275] COND FALSE !((((a4==1) && ((a8==15) && (((a3==1) && (((a25==9) || (a25==10)) && (input == 5))) && ((140 < a29) && (245 >= a29)) ))) && 306 < a23 )) [L280] COND FALSE !(((a3==1) && (((((input == 5) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9))))) && (a8==15)) && !(a4==1)) && a23 <= -43 ))) [L287] COND FALSE !(((a8==15) && ((((!(a4==1) && (((a25==12) || (a25==13)) && (input == 4))) && a23 <= -43 ) && a29 <= 140 ) && (a3==1)))) [L294] COND FALSE !(((a8==15) && (!(a4==1) && ( a23 <= -43 && ((a3==1) && ( 277 < a29 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 6)))))))) [L299] COND FALSE !(( 306 < a23 && (((a8==15) && ((a3==1) && ((a4==1) && (((a25==11) || (a25==12)) && (input == 6))))) && ((140 < a29) && (245 >= a29)) ))) [L305] COND FALSE !(((((a8==15) && ( a29 <= 140 && ( a23 <= -43 && ((input == 2) && ((a25==10) || (a25==11)))))) && !(a4==1)) && (a3==1))) [L310] COND FALSE !(((a3==1) && ( ((245 < a29) && (277 >= a29)) && (((a4==1) && ((a8==15) && ((((a25==11) || (a25==12)) || (a25==13)) && (input == 5)))) && 306 < a23 )))) [L317] COND FALSE !(((((a8==15) && (((a4==1) && ((input == 2) && ((a25==13) || ((a25==11) || (a25==12))))) && ((245 < a29) && (277 >= a29)) )) && 306 < a23 ) && (a3==1))) [L322] COND FALSE !((( 306 < a23 && ((a8==15) && ((((input == 6) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a4==1))) [L329] COND FALSE !(((((a8==15) && (((((a25==11) || (a25==12)) && (input == 4)) && 306 < a23 ) && (a3==1))) && (a4==1)) && ((140 < a29) && (245 >= a29)) )) [L334] COND FALSE !(( a23 <= -43 && ( ((140 < a29) && (245 >= a29)) && (((a8==15) && (((input == 4) && ((a25==11) || ((a25==9) || (a25==10)))) && !(a4==1))) && (a3==1))))) [L340] COND FALSE !((((((((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ( 277 < a29 && (a25==9))) && (input == 1)) && a23 <= -43 ) && (a8==15)) && !(a4==1)) && (a3==1))) [L346] COND FALSE !((!(a4==1) && ( a29 <= 140 && ((((((a25==12) || (a25==13)) && (input == 2)) && a23 <= -43 ) && (a3==1)) && (a8==15))))) [L353] COND FALSE !(((a8==15) && (( 306 < a23 && ((a3==1) && ((input == 4) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))))) && (a4==1)))) [L358] COND FALSE !(((((input == 3) && (( a23 <= -43 && ((!(a4==1) && a29 <= 140 ) && (a25==9))) || (( 306 < a23 && (( 277 < a29 && (a4==1)) && (a25==12))) || ((((a4==1) && 277 < a29 ) && (a25==13)) && 306 < a23 )))) && (a3==1)) && (a8==15))) [L365] COND FALSE !(( 306 < a23 && ((a4==1) && (((((((a25==11) || (a25==12)) || (a25==13)) && (input == 3)) && (a8==15)) && (a3==1)) && ((245 < a29) && (277 >= a29)) )))) [L370] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((!(a4==1) && (input == 6)) && (a3==1)) && (a25==11)) && (a8==15)) && a23 <= -43 ))) [L377] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && (((a8==15) && ((input == 2) && ((( a29 <= 140 && (a25==13)) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ((a25==10) && ((140 < a29) && (245 >= a29)) )))) && (a3==1))) && !(a4==1))) [L384] COND FALSE !(( a29 <= 140 && ((a8==15) && ((((((a25==10) || (a25==11)) && (input == 3)) && a23 <= -43 ) && (a3==1)) && !(a4==1))))) [L391] COND FALSE !((((((a8==15) && (((input == 3) && (((a25==10) || (a25==11)) || (a25==12))) && (a3==1))) && a23 <= -43 ) && !(a4==1)) && 277 < a29 )) [L398] COND FALSE !(((!(a4==1) && ((a25==9) && ((a8==15) && ((a3==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 1)))))) && a29 <= 140 )) [L411] COND FALSE !(((a8==15) && ((( 306 < a23 && (((((a25==11) || (a25==12)) || (a25==13)) && (input == 6)) && ((245 < a29) && (277 >= a29)) )) && (a4==1)) && (a3==1)))) [L417] COND FALSE !((((((!(a4==1) && ((a8==15) && (input == 2))) && (a3==1)) && ((140 < a29) && (245 >= a29)) ) && (a25==12)) && a23 <= -43 )) [L422] COND FALSE !(( a23 <= -43 && (( a29 <= 140 && ((a8==15) && (!(a4==1) && (((a25==12) || (a25==13)) && (input == 3))))) && (a3==1)))) [L429] COND FALSE !(((((((input == 6) && ((((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ( ((140 < a29) && (245 >= a29)) && (a25==10)))) && (a8==15)) && (a3==1)) && !(a4==1)) && ((-43 < a23) && (138 >= a23)) )) [L436] COND FALSE !(((!(a4==1) && (((((a3==1) && (input == 4)) && (a25==11)) && ((245 < a29) && (277 >= a29)) ) && a23 <= -43 )) && (a8==15))) [L443] COND FALSE !(((a3==1) && ( ((140 < a29) && (245 >= a29)) && ( a23 <= -43 && ((a8==15) && (!(a4==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 3)))))))) [L450] COND FALSE !(((((!(a4==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 4)) && 277 < a29 )) && a23 <= -43 ) && (a8==15)) && (a3==1))) [L456] COND FALSE !(( ((140 < a29) && (245 >= a29)) && ((a8==15) && (((a25==12) && (!(a4==1) && ( a23 <= -43 && (input == 4)))) && (a3==1))))) [L463] COND FALSE !(((a3==1) && ((((((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || (((a25==9) && (!(a4==1) && a29 <= 140 )) && a23 <= -43 )) && (input == 2)) && (a8==15)))) [L470] COND FALSE !(((((input == 5) && (((((a25==12) && ((a4==1) && 277 < a29 )) && 306 < a23 ) || ((( 277 < a29 && (a4==1)) && (a25==13)) && 306 < a23 )) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 ))) && (a8==15)) && (a3==1))) [L477] COND FALSE !(((a25==12) && (((a3==1) && ((((input == 1) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) ) && !(a4==1))) && (a8==15)))) [L487] COND FALSE !((((a8==15) && (( ((-43 < a23) && (138 >= a23)) && ((input == 1) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (((a25==13) && a29 <= 140 ) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))))) && (a3==1))) && !(a4==1))) [L500] COND FALSE !(((a3==1) && ((a8==15) && (((((( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 3)) && !(a4==1)) && a23 <= -43 )))) [L507] COND FALSE !((( a29 <= 140 && ( ((-43 < a23) && (138 >= a23)) && ((a3==1) && ((a8==15) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 2)))))) && !(a4==1))) [L514] COND FALSE !((((a4==1) && ( 306 < a23 && ((((input == 3) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a8==15))) [L526] COND FALSE !(((a4==1) && ((((a3==1) && ( 306 < a23 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 4)))) && a29 <= 140 ) && (a8==15)))) [L531] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 5)) && (a3==1))) && (a25==9)) && a29 <= 140 ) && (a8==15))) [L537] COND FALSE !(( 306 < a23 && (((a8==15) && ((((input == 1) && ((a25==11) || (a25==12))) && (a4==1)) && (a3==1))) && ((140 < a29) && (245 >= a29)) ))) [L542] COND FALSE !(((((a8==15) && ( a23 <= -43 && (((input == 1) && ((a25==10) || (a25==11))) && a29 <= 140 ))) && !(a4==1)) && (a3==1))) [L549] COND FALSE !(((( a23 <= -43 && (!(a4==1) && ((a3==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 5))))) && (a8==15)) && ((140 < a29) && (245 >= a29)) )) [L555] COND FALSE !(((a3==1) && ( ((-43 < a23) && (138 >= a23)) && ((a8==15) && ((((((a25==10) || (a25==11)) || (a25==12)) && (input == 5)) && a29 <= 140 ) && !(a4==1)))))) [L561] COND FALSE !(( 306 < a23 && (((a3==1) && ( 277 < a29 && (((input == 4) && (((a25==9) || (a25==10)) || (a25==11))) && (a8==15)))) && (a4==1)))) [L566] COND FALSE !((!(a4==1) && ( a23 <= -43 && ((a8==15) && (((((a25==12) || ((a25==10) || (a25==11))) && (input == 1)) && (a3==1)) && 277 < a29 ))))) [L572] COND FALSE !(( 277 < a29 && (((a25==13) && ( a23 <= -43 && (!(a4==1) && ((input == 1) && (a3==1))))) && (a8==15)))) [L575] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (((a25==9) && ((input == 4) && !(a4==1))) && a29 <= 140 )) && (a3==1)) && (a8==15))) [L581] COND TRUE ((a8==15) && ((((a3==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 3)) && (a4==1))) && 306 < a23 ) && a29 <= 140 )) [L582] a29 = (((((a29 - 0) % 15)+ 262) + 241270) + -241271) [L583] a25 = 12 [L585] return 24; [L1042] RET, EXPR calculate_output(input) [L1042] output = calculate_output(input) [L1034] COND TRUE 1 [L1037] int input; [L1038] input = __VERIFIER_nondet_int() [L1039] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1042] CALL, EXPR calculate_output(input) [L23] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L26] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L29] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L32] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L35] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L38] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L41] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L44] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L47] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L50] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L53] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L56] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L59] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L62] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L65] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L68] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L71] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L74] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L77] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L80] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L83] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L86] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L89] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L92] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L95] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L98] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L101] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L104] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L107] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L110] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L113] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L116] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L119] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L122] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L125] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L128] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L131] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L134] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L137] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L140] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L143] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L146] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L149] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L152] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L155] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L158] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L161] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L164] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L167] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L170] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L173] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L176] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L179] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L182] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) [L185] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L188] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L191] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L194] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L197] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L200] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L203] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L207] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) [L214] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) [L221] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) [L227] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) [L233] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) [L240] COND FALSE !(((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1))) [L247] COND FALSE !((((a3==1) && (!(a4==1) && (( a29 <= 140 && ((input == 1) && ((a25==12) || ((a25==10) || (a25==11))))) && ((-43 < a23) && (138 >= a23)) ))) && (a8==15))) [L254] COND FALSE !(((( ((245 < a29) && (277 >= a29)) && (( a23 <= -43 && (!(a4==1) && (input == 1))) && (a25==11))) && (a8==15)) && (a3==1))) [L260] COND FALSE !(((((a4==1) && (((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && (a8==15))) && 306 < a23 ) && (a3==1))) [L265] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) [L268] COND FALSE !(( a29 <= 140 && ((((a8==15) && ((a3==1) && ((input == 1) && ((a25==12) || (a25==13))))) && !(a4==1)) && a23 <= -43 ))) [L275] COND FALSE !((((a4==1) && ((a8==15) && (((a3==1) && (((a25==9) || (a25==10)) && (input == 5))) && ((140 < a29) && (245 >= a29)) ))) && 306 < a23 )) [L280] COND FALSE !(((a3==1) && (((((input == 5) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9))))) && (a8==15)) && !(a4==1)) && a23 <= -43 ))) [L287] COND FALSE !(((a8==15) && ((((!(a4==1) && (((a25==12) || (a25==13)) && (input == 4))) && a23 <= -43 ) && a29 <= 140 ) && (a3==1)))) [L294] COND FALSE !(((a8==15) && (!(a4==1) && ( a23 <= -43 && ((a3==1) && ( 277 < a29 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 6)))))))) [L299] COND FALSE !(( 306 < a23 && (((a8==15) && ((a3==1) && ((a4==1) && (((a25==11) || (a25==12)) && (input == 6))))) && ((140 < a29) && (245 >= a29)) ))) [L305] COND FALSE !(((((a8==15) && ( a29 <= 140 && ( a23 <= -43 && ((input == 2) && ((a25==10) || (a25==11)))))) && !(a4==1)) && (a3==1))) [L310] COND FALSE !(((a3==1) && ( ((245 < a29) && (277 >= a29)) && (((a4==1) && ((a8==15) && ((((a25==11) || (a25==12)) || (a25==13)) && (input == 5)))) && 306 < a23 )))) [L317] COND FALSE !(((((a8==15) && (((a4==1) && ((input == 2) && ((a25==13) || ((a25==11) || (a25==12))))) && ((245 < a29) && (277 >= a29)) )) && 306 < a23 ) && (a3==1))) [L322] COND FALSE !((( 306 < a23 && ((a8==15) && ((((input == 6) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a4==1))) [L329] COND FALSE !(((((a8==15) && (((((a25==11) || (a25==12)) && (input == 4)) && 306 < a23 ) && (a3==1))) && (a4==1)) && ((140 < a29) && (245 >= a29)) )) [L334] COND FALSE !(( a23 <= -43 && ( ((140 < a29) && (245 >= a29)) && (((a8==15) && (((input == 4) && ((a25==11) || ((a25==9) || (a25==10)))) && !(a4==1))) && (a3==1))))) [L340] COND FALSE !((((((((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ( 277 < a29 && (a25==9))) && (input == 1)) && a23 <= -43 ) && (a8==15)) && !(a4==1)) && (a3==1))) [L346] COND FALSE !((!(a4==1) && ( a29 <= 140 && ((((((a25==12) || (a25==13)) && (input == 2)) && a23 <= -43 ) && (a3==1)) && (a8==15))))) [L353] COND FALSE !(((a8==15) && (( 306 < a23 && ((a3==1) && ((input == 4) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))))) && (a4==1)))) [L358] COND FALSE !(((((input == 3) && (( a23 <= -43 && ((!(a4==1) && a29 <= 140 ) && (a25==9))) || (( 306 < a23 && (( 277 < a29 && (a4==1)) && (a25==12))) || ((((a4==1) && 277 < a29 ) && (a25==13)) && 306 < a23 )))) && (a3==1)) && (a8==15))) [L365] COND FALSE !(( 306 < a23 && ((a4==1) && (((((((a25==11) || (a25==12)) || (a25==13)) && (input == 3)) && (a8==15)) && (a3==1)) && ((245 < a29) && (277 >= a29)) )))) [L370] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((!(a4==1) && (input == 6)) && (a3==1)) && (a25==11)) && (a8==15)) && a23 <= -43 ))) [L377] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && (((a8==15) && ((input == 2) && ((( a29 <= 140 && (a25==13)) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ((a25==10) && ((140 < a29) && (245 >= a29)) )))) && (a3==1))) && !(a4==1))) [L384] COND FALSE !(( a29 <= 140 && ((a8==15) && ((((((a25==10) || (a25==11)) && (input == 3)) && a23 <= -43 ) && (a3==1)) && !(a4==1))))) [L391] COND FALSE !((((((a8==15) && (((input == 3) && (((a25==10) || (a25==11)) || (a25==12))) && (a3==1))) && a23 <= -43 ) && !(a4==1)) && 277 < a29 )) [L398] COND FALSE !(((!(a4==1) && ((a25==9) && ((a8==15) && ((a3==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 1)))))) && a29 <= 140 )) [L411] COND TRUE ((a8==15) && ((( 306 < a23 && (((((a25==11) || (a25==12)) || (a25==13)) && (input == 6)) && ((245 < a29) && (277 >= a29)) )) && (a4==1)) && (a3==1))) [L412] a29 = ((((a29 * 12)/ 10) / 5) + 99853) [L413] a23 = ((((a23 / 5) * 4) % 83)- -180) [L414] a25 = 13 [L416] return -1; [L1042] RET, EXPR calculate_output(input) [L1042] output = calculate_output(input) [L1034] COND TRUE 1 [L1037] int input; [L1038] input = __VERIFIER_nondet_int() [L1039] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1042] CALL calculate_output(input) [L23] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L26] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L29] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L32] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L35] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L38] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L41] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L44] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L47] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L50] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L53] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L56] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L59] COND TRUE ((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15)) [L60] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 292 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.6s, OverallIterations: 6, TraceHistogramMax: 3, AutomataDifference: 14.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 235 SDtfs, 3587 SDslu, 440 SDs, 0 SdLazy, 6689 SolverSat, 1215 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3374occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 5 MinimizatonAttempts, 340 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 860 NumberOfCodeBlocks, 860 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 604 ConstructedInterpolants, 0 QuantifiedInterpolants, 244823 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 185/252 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...