/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 --rcfgbuilder.size.of.a.code.block SingleStatement --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-c90d42b [2020-09-24 15:04:10,459 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-24 15:04:10,464 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-24 15:04:10,514 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-24 15:04:10,514 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-24 15:04:10,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-24 15:04:10,528 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-24 15:04:10,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-24 15:04:10,535 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-24 15:04:10,538 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-24 15:04:10,539 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-24 15:04:10,540 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-24 15:04:10,541 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-24 15:04:10,544 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-24 15:04:10,547 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-24 15:04:10,549 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-24 15:04:10,550 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-24 15:04:10,551 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-24 15:04:10,554 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-24 15:04:10,561 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-24 15:04:10,563 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-24 15:04:10,563 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-24 15:04:10,564 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-24 15:04:10,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-24 15:04:10,572 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-24 15:04:10,572 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-24 15:04:10,572 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-24 15:04:10,574 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-24 15:04:10,577 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-24 15:04:10,578 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-24 15:04:10,578 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-24 15:04:10,579 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-24 15:04:10,580 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-24 15:04:10,581 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-24 15:04:10,582 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-24 15:04:10,582 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-24 15:04:10,583 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-24 15:04:10,583 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-24 15:04:10,584 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-24 15:04:10,585 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-24 15:04:10,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-24 15:04:10,587 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-24 15:04:10,638 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-24 15:04:10,638 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-24 15:04:10,641 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-24 15:04:10,641 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-24 15:04:10,641 INFO L138 SettingsManager]: * Use SBE=true [2020-09-24 15:04:10,641 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-24 15:04:10,642 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-24 15:04:10,642 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-24 15:04:10,642 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-24 15:04:10,643 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-24 15:04:10,644 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-24 15:04:10,644 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-24 15:04:10,644 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-24 15:04:10,645 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-24 15:04:10,645 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-24 15:04:10,646 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-24 15:04:10,646 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-24 15:04:10,646 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-24 15:04:10,646 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-24 15:04:10,647 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-24 15:04:10,647 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-24 15:04:10,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-24 15:04:10,647 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-24 15:04:10,647 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-24 15:04:10,648 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-24 15:04:10,648 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-24 15:04:10,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-24 15:04:10,648 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-24 15:04:10,648 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-24 15:04:10,649 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.rcfgbuilder: Size of a code block -> SingleStatement Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> false [2020-09-24 15:04:11,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-24 15:04:11,131 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-24 15:04:11,136 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-24 15:04:11,138 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-24 15:04:11,139 INFO L275 PluginConnector]: CDTParser initialized [2020-09-24 15:04:11,140 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-09-24 15:04:11,246 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a69a001b3/a1984a7a2d0b4557893d202c9af90149/FLAG0edf1b4e2 [2020-09-24 15:04:11,956 INFO L306 CDTParser]: Found 1 translation units. [2020-09-24 15:04:11,957 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem11_label58.c [2020-09-24 15:04:11,972 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a69a001b3/a1984a7a2d0b4557893d202c9af90149/FLAG0edf1b4e2 [2020-09-24 15:04:12,130 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a69a001b3/a1984a7a2d0b4557893d202c9af90149 [2020-09-24 15:04:12,145 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-24 15:04:12,152 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-24 15:04:12,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-24 15:04:12,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-24 15:04:12,160 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-24 15:04:12,161 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 03:04:12" (1/1) ... [2020-09-24 15:04:12,165 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5957f606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:04:12, skipping insertion in model container [2020-09-24 15:04:12,165 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 03:04:12" (1/1) ... [2020-09-24 15:04:12,172 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-24 15:04:12,232 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-24 15:04:12,957 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-24 15:04:12,971 INFO L203 MainTranslator]: Completed pre-run [2020-09-24 15:04:13,312 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-24 15:04:13,341 INFO L208 MainTranslator]: Completed translation [2020-09-24 15:04:13,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:04:13 WrapperNode [2020-09-24 15:04:13,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-24 15:04:13,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-24 15:04:13,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-24 15:04:13,346 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-24 15:04:13,372 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:04:13" (1/1) ... [2020-09-24 15:04:13,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:04:13" (1/1) ... [2020-09-24 15:04:13,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:04:13" (1/1) ... [2020-09-24 15:04:13,426 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:04:13" (1/1) ... [2020-09-24 15:04:13,480 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:04:13" (1/1) ... [2020-09-24 15:04:13,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:04:13" (1/1) ... [2020-09-24 15:04:13,509 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:04:13" (1/1) ... [2020-09-24 15:04:13,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-24 15:04:13,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-24 15:04:13,532 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-24 15:04:13,533 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-24 15:04:13,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:04:13" (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-24 15:04:13,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-24 15:04:13,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-24 15:04:13,641 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-09-24 15:04:13,641 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-24 15:04:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-09-24 15:04:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-24 15:04:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-24 15:04:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-24 15:04:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-24 15:04:13,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-24 15:04:13,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-24 15:04:16,052 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-24 15:04:16,052 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-24 15:04:16,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 03:04:16 BoogieIcfgContainer [2020-09-24 15:04:16,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-24 15:04:16,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-24 15:04:16,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-24 15:04:16,077 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-24 15:04:16,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.09 03:04:12" (1/3) ... [2020-09-24 15:04:16,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@472ab7ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 03:04:16, skipping insertion in model container [2020-09-24 15:04:16,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:04:13" (2/3) ... [2020-09-24 15:04:16,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@472ab7ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 03:04:16, skipping insertion in model container [2020-09-24 15:04:16,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 03:04:16" (3/3) ... [2020-09-24 15:04:16,087 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label58.c [2020-09-24 15:04:16,099 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-24 15:04:16,119 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-24 15:04:16,143 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-24 15:04:16,189 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-24 15:04:16,191 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-24 15:04:16,191 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-24 15:04:16,191 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-24 15:04:16,191 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-24 15:04:16,191 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-24 15:04:16,192 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-24 15:04:16,192 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-24 15:04:16,241 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states. [2020-09-24 15:04:16,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-09-24 15:04:16,256 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:04:16,257 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 15:04:16,258 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:04:16,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:04:16,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1378965372, now seen corresponding path program 1 times [2020-09-24 15:04:16,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:04:16,282 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1302910441] [2020-09-24 15:04:16,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:04:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:16,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:04:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:16,719 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-24 15:04:16,720 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1302910441] [2020-09-24 15:04:16,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-24 15:04:16,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-24 15:04:16,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222830913] [2020-09-24 15:04:16,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-24 15:04:16,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:04:16,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-24 15:04:16,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-24 15:04:16,753 INFO L87 Difference]: Start difference. First operand 813 states. Second operand 5 states. [2020-09-24 15:04:21,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:04:21,990 INFO L93 Difference]: Finished difference Result 2361 states and 3156 transitions. [2020-09-24 15:04:21,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-24 15:04:21,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2020-09-24 15:04:21,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:04:22,041 INFO L225 Difference]: With dead ends: 2361 [2020-09-24 15:04:22,041 INFO L226 Difference]: Without dead ends: 1487 [2020-09-24 15:04:22,055 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-24 15:04:22,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2020-09-24 15:04:22,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1155. [2020-09-24 15:04:22,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1155 states. [2020-09-24 15:04:22,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1484 transitions. [2020-09-24 15:04:22,213 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1484 transitions. Word has length 39 [2020-09-24 15:04:22,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:04:22,214 INFO L479 AbstractCegarLoop]: Abstraction has 1155 states and 1484 transitions. [2020-09-24 15:04:22,215 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-24 15:04:22,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1484 transitions. [2020-09-24 15:04:22,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-09-24 15:04:22,237 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:04:22,237 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 15:04:22,238 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-24 15:04:22,238 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:04:22,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:04:22,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1767258319, now seen corresponding path program 1 times [2020-09-24 15:04:22,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:04:22,239 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1077487657] [2020-09-24 15:04:22,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:04:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:22,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:04:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:22,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-24 15:04:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:22,639 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 15:04:22,643 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1077487657] [2020-09-24 15:04:22,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-24 15:04:22,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-24 15:04:22,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022631614] [2020-09-24 15:04:22,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-24 15:04:22,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:04:22,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-24 15:04:22,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-24 15:04:22,647 INFO L87 Difference]: Start difference. First operand 1155 states and 1484 transitions. Second operand 7 states. [2020-09-24 15:04:27,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:04:27,340 INFO L93 Difference]: Finished difference Result 3082 states and 4163 transitions. [2020-09-24 15:04:27,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-24 15:04:27,341 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2020-09-24 15:04:27,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:04:27,358 INFO L225 Difference]: With dead ends: 3082 [2020-09-24 15:04:27,358 INFO L226 Difference]: Without dead ends: 1944 [2020-09-24 15:04:27,365 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-09-24 15:04:27,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2020-09-24 15:04:27,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1847. [2020-09-24 15:04:27,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1847 states. [2020-09-24 15:04:27,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2324 transitions. [2020-09-24 15:04:27,452 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2324 transitions. Word has length 120 [2020-09-24 15:04:27,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:04:27,455 INFO L479 AbstractCegarLoop]: Abstraction has 1847 states and 2324 transitions. [2020-09-24 15:04:27,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-24 15:04:27,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2324 transitions. [2020-09-24 15:04:27,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-09-24 15:04:27,463 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:04:27,465 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 15:04:27,465 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-24 15:04:27,465 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:04:27,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:04:27,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1373722232, now seen corresponding path program 1 times [2020-09-24 15:04:27,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:04:27,468 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1101683005] [2020-09-24 15:04:27,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:04:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:27,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:04:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:27,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-24 15:04:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:27,774 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 15:04:27,775 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1101683005] [2020-09-24 15:04:27,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-24 15:04:27,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-24 15:04:27,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882953800] [2020-09-24 15:04:27,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-24 15:04:27,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:04:27,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-24 15:04:27,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-24 15:04:27,777 INFO L87 Difference]: Start difference. First operand 1847 states and 2324 transitions. Second operand 7 states. [2020-09-24 15:04:32,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:04:32,525 INFO L93 Difference]: Finished difference Result 4824 states and 6321 transitions. [2020-09-24 15:04:32,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-24 15:04:32,527 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2020-09-24 15:04:32,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:04:32,543 INFO L225 Difference]: With dead ends: 4824 [2020-09-24 15:04:32,543 INFO L226 Difference]: Without dead ends: 2994 [2020-09-24 15:04:32,551 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-09-24 15:04:32,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2020-09-24 15:04:32,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2913. [2020-09-24 15:04:32,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2913 states. [2020-09-24 15:04:32,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2913 states to 2913 states and 3624 transitions. [2020-09-24 15:04:32,635 INFO L78 Accepts]: Start accepts. Automaton has 2913 states and 3624 transitions. Word has length 128 [2020-09-24 15:04:32,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:04:32,636 INFO L479 AbstractCegarLoop]: Abstraction has 2913 states and 3624 transitions. [2020-09-24 15:04:32,636 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-24 15:04:32,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2913 states and 3624 transitions. [2020-09-24 15:04:32,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2020-09-24 15:04:32,641 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:04:32,641 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-09-24 15:04:32,642 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-24 15:04:32,642 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:04:32,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:04:32,642 INFO L82 PathProgramCache]: Analyzing trace with hash 753028932, now seen corresponding path program 1 times [2020-09-24 15:04:32,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:04:32,643 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1670014104] [2020-09-24 15:04:32,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:04:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:32,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:04:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:32,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-24 15:04:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:32,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-24 15:04:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:33,054 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 42 proven. 65 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-09-24 15:04:33,055 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1670014104] [2020-09-24 15:04:33,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:04:33,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-24 15:04:33,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111138545] [2020-09-24 15:04:33,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-24 15:04:33,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:04:33,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-24 15:04:33,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-24 15:04:33,057 INFO L87 Difference]: Start difference. First operand 2913 states and 3624 transitions. Second operand 8 states. [2020-09-24 15:04:38,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:04:38,058 INFO L93 Difference]: Finished difference Result 5476 states and 6930 transitions. [2020-09-24 15:04:38,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-24 15:04:38,059 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 204 [2020-09-24 15:04:38,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:04:38,076 INFO L225 Difference]: With dead ends: 5476 [2020-09-24 15:04:38,076 INFO L226 Difference]: Without dead ends: 2974 [2020-09-24 15:04:38,084 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-09-24 15:04:38,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2020-09-24 15:04:38,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 2917. [2020-09-24 15:04:38,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2917 states. [2020-09-24 15:04:38,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2917 states to 2917 states and 3623 transitions. [2020-09-24 15:04:38,172 INFO L78 Accepts]: Start accepts. Automaton has 2917 states and 3623 transitions. Word has length 204 [2020-09-24 15:04:38,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:04:38,174 INFO L479 AbstractCegarLoop]: Abstraction has 2917 states and 3623 transitions. [2020-09-24 15:04:38,174 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-24 15:04:38,174 INFO L276 IsEmpty]: Start isEmpty. Operand 2917 states and 3623 transitions. [2020-09-24 15:04:38,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2020-09-24 15:04:38,178 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:04:38,179 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 15:04:38,179 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-24 15:04:38,179 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:04:38,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:04:38,180 INFO L82 PathProgramCache]: Analyzing trace with hash 283082810, now seen corresponding path program 1 times [2020-09-24 15:04:38,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:04:38,181 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1888647724] [2020-09-24 15:04:38,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:04:38,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:38,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:04:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:38,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-24 15:04:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:38,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2020-09-24 15:04:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:38,756 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2020-09-24 15:04:38,756 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1888647724] [2020-09-24 15:04:38,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:04:38,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-24 15:04:38,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048962443] [2020-09-24 15:04:38,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-24 15:04:38,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:04:38,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-24 15:04:38,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-09-24 15:04:38,759 INFO L87 Difference]: Start difference. First operand 2917 states and 3623 transitions. Second operand 9 states. [2020-09-24 15:04:46,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:04:46,649 INFO L93 Difference]: Finished difference Result 7538 states and 10126 transitions. [2020-09-24 15:04:46,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-24 15:04:46,650 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 253 [2020-09-24 15:04:46,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:04:46,682 INFO L225 Difference]: With dead ends: 7538 [2020-09-24 15:04:46,682 INFO L226 Difference]: Without dead ends: 5032 [2020-09-24 15:04:46,695 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2020-09-24 15:04:46,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5032 states. [2020-09-24 15:04:46,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5032 to 4833. [2020-09-24 15:04:46,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4833 states. [2020-09-24 15:04:46,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4833 states to 4833 states and 6065 transitions. [2020-09-24 15:04:46,859 INFO L78 Accepts]: Start accepts. Automaton has 4833 states and 6065 transitions. Word has length 253 [2020-09-24 15:04:46,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:04:46,862 INFO L479 AbstractCegarLoop]: Abstraction has 4833 states and 6065 transitions. [2020-09-24 15:04:46,862 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-24 15:04:46,862 INFO L276 IsEmpty]: Start isEmpty. Operand 4833 states and 6065 transitions. [2020-09-24 15:04:46,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2020-09-24 15:04:46,867 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:04:46,868 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 15:04:46,868 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-24 15:04:46,868 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:04:46,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:04:46,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1126462042, now seen corresponding path program 1 times [2020-09-24 15:04:46,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:04:46,870 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [939745067] [2020-09-24 15:04:46,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:04:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:47,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:04:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:47,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-24 15:04:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:47,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2020-09-24 15:04:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:47,279 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 45 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2020-09-24 15:04:47,280 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [939745067] [2020-09-24 15:04:47,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:04:47,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-24 15:04:47,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29316685] [2020-09-24 15:04:47,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-24 15:04:47,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:04:47,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-24 15:04:47,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-24 15:04:47,292 INFO L87 Difference]: Start difference. First operand 4833 states and 6065 transitions. Second operand 5 states. [2020-09-24 15:04:51,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:04:51,232 INFO L93 Difference]: Finished difference Result 12192 states and 15949 transitions. [2020-09-24 15:04:51,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-24 15:04:51,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 261 [2020-09-24 15:04:51,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:04:51,271 INFO L225 Difference]: With dead ends: 12192 [2020-09-24 15:04:51,272 INFO L226 Difference]: Without dead ends: 7770 [2020-09-24 15:04:51,288 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-24 15:04:51,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7770 states. [2020-09-24 15:04:51,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7770 to 7315. [2020-09-24 15:04:51,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7315 states. [2020-09-24 15:04:51,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7315 states to 7315 states and 9380 transitions. [2020-09-24 15:04:51,464 INFO L78 Accepts]: Start accepts. Automaton has 7315 states and 9380 transitions. Word has length 261 [2020-09-24 15:04:51,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:04:51,464 INFO L479 AbstractCegarLoop]: Abstraction has 7315 states and 9380 transitions. [2020-09-24 15:04:51,464 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-24 15:04:51,465 INFO L276 IsEmpty]: Start isEmpty. Operand 7315 states and 9380 transitions. [2020-09-24 15:04:51,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2020-09-24 15:04:51,471 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:04:51,472 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 15:04:51,472 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-24 15:04:51,472 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:04:51,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:04:51,473 INFO L82 PathProgramCache]: Analyzing trace with hash -999216387, now seen corresponding path program 1 times [2020-09-24 15:04:51,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:04:51,473 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [302075149] [2020-09-24 15:04:51,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:04:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:51,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:04:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:51,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-24 15:04:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:51,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2020-09-24 15:04:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:51,965 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 118 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-24 15:04:51,966 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [302075149] [2020-09-24 15:04:51,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:04:51,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-24 15:04:51,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804018521] [2020-09-24 15:04:51,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-24 15:04:51,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:04:51,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-24 15:04:51,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-09-24 15:04:51,969 INFO L87 Difference]: Start difference. First operand 7315 states and 9380 transitions. Second operand 9 states. [2020-09-24 15:05:01,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:05:01,197 INFO L93 Difference]: Finished difference Result 23350 states and 31388 transitions. [2020-09-24 15:05:01,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-24 15:05:01,198 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 269 [2020-09-24 15:05:01,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:05:01,259 INFO L225 Difference]: With dead ends: 23350 [2020-09-24 15:05:01,259 INFO L226 Difference]: Without dead ends: 16446 [2020-09-24 15:05:01,285 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2020-09-24 15:05:01,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16446 states. [2020-09-24 15:05:01,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16446 to 14808. [2020-09-24 15:05:01,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14808 states. [2020-09-24 15:05:01,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14808 states to 14808 states and 19163 transitions. [2020-09-24 15:05:01,665 INFO L78 Accepts]: Start accepts. Automaton has 14808 states and 19163 transitions. Word has length 269 [2020-09-24 15:05:01,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:05:01,665 INFO L479 AbstractCegarLoop]: Abstraction has 14808 states and 19163 transitions. [2020-09-24 15:05:01,665 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-24 15:05:01,666 INFO L276 IsEmpty]: Start isEmpty. Operand 14808 states and 19163 transitions. [2020-09-24 15:05:01,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2020-09-24 15:05:01,674 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:05:01,674 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-09-24 15:05:01,675 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-24 15:05:01,675 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:05:01,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:05:01,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1950798027, now seen corresponding path program 1 times [2020-09-24 15:05:01,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:05:01,676 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1902497463] [2020-09-24 15:05:01,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:05:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-24 15:05:01,847 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-24 15:05:01,847 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-24 15:05:01,858 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-24 15:05:01,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.09 03:05:01 BoogieIcfgContainer [2020-09-24 15:05:01,939 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-24 15:05:01,946 INFO L168 Benchmark]: Toolchain (without parser) took 49794.83 ms. Allocated memory was 148.9 MB in the beginning and 599.3 MB in the end (delta: 450.4 MB). Free memory was 100.8 MB in the beginning and 129.3 MB in the end (delta: -28.5 MB). Peak memory consumption was 421.9 MB. Max. memory is 7.1 GB. [2020-09-24 15:05:01,956 INFO L168 Benchmark]: CDTParser took 0.58 ms. Allocated memory is still 148.9 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-24 15:05:01,963 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1188.66 ms. Allocated memory was 148.9 MB in the beginning and 212.3 MB in the end (delta: 63.4 MB). Free memory was 100.1 MB in the beginning and 167.2 MB in the end (delta: -67.1 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. [2020-09-24 15:05:01,965 INFO L168 Benchmark]: Boogie Preprocessor took 184.94 ms. Allocated memory is still 212.3 MB. Free memory was 166.5 MB in the beginning and 158.8 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 7.1 GB. [2020-09-24 15:05:01,966 INFO L168 Benchmark]: RCFGBuilder took 2540.35 ms. Allocated memory was 212.3 MB in the beginning and 251.7 MB in the end (delta: 39.3 MB). Free memory was 158.8 MB in the beginning and 186.8 MB in the end (delta: -28.0 MB). Peak memory consumption was 100.6 MB. Max. memory is 7.1 GB. [2020-09-24 15:05:01,967 INFO L168 Benchmark]: TraceAbstraction took 45867.63 ms. Allocated memory was 251.7 MB in the beginning and 599.3 MB in the end (delta: 347.6 MB). Free memory was 186.8 MB in the beginning and 129.3 MB in the end (delta: 57.6 MB). Peak memory consumption was 405.2 MB. Max. memory is 7.1 GB. [2020-09-24 15:05:01,974 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.58 ms. Allocated memory is still 148.9 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1188.66 ms. Allocated memory was 148.9 MB in the beginning and 212.3 MB in the end (delta: 63.4 MB). Free memory was 100.1 MB in the beginning and 167.2 MB in the end (delta: -67.1 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 184.94 ms. Allocated memory is still 212.3 MB. Free memory was 166.5 MB in the beginning and 158.8 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2540.35 ms. Allocated memory was 212.3 MB in the beginning and 251.7 MB in the end (delta: 39.3 MB). Free memory was 158.8 MB in the beginning and 186.8 MB in the end (delta: -28.0 MB). Peak memory consumption was 100.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 45867.63 ms. Allocated memory was 251.7 MB in the beginning and 599.3 MB in the end (delta: 347.6 MB). Free memory was 186.8 MB in the beginning and 129.3 MB in the end (delta: 57.6 MB). Peak memory consumption was 405.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, 813 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 45.6s, OverallIterations: 8, TraceHistogramMax: 3, AutomataDifference: 41.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3315 SDtfs, 12466 SDslu, 7220 SDs, 0 SdLazy, 22029 SolverSat, 3482 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14808occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 2859 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1559 NumberOfCodeBlocks, 1559 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1267 ConstructedInterpolants, 0 QuantifiedInterpolants, 720767 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 411/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...