/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration false -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label15.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-eb0fd7c [2020-09-21 10:24:47,254 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-21 10:24:47,258 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-21 10:24:47,303 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-21 10:24:47,303 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-21 10:24:47,311 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-21 10:24:47,315 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-21 10:24:47,319 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-21 10:24:47,322 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-21 10:24:47,325 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-21 10:24:47,326 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-21 10:24:47,327 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-21 10:24:47,328 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-21 10:24:47,331 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-21 10:24:47,333 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-21 10:24:47,335 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-21 10:24:47,337 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-21 10:24:47,338 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-21 10:24:47,340 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-21 10:24:47,348 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-21 10:24:47,351 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-21 10:24:47,352 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-21 10:24:47,353 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-21 10:24:47,354 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-21 10:24:47,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-21 10:24:47,367 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-21 10:24:47,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-21 10:24:47,375 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-21 10:24:47,376 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-21 10:24:47,380 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-21 10:24:47,380 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-21 10:24:47,381 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-21 10:24:47,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-21 10:24:47,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-21 10:24:47,384 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-21 10:24:47,384 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-21 10:24:47,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-21 10:24:47,387 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-21 10:24:47,387 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-21 10:24:47,388 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-21 10:24:47,389 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-21 10:24:47,391 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-21 10:24:47,437 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-21 10:24:47,438 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-21 10:24:47,440 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-21 10:24:47,440 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-21 10:24:47,440 INFO L138 SettingsManager]: * Use SBE=true [2020-09-21 10:24:47,441 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-21 10:24:47,441 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-21 10:24:47,441 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-21 10:24:47,441 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-21 10:24:47,442 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-21 10:24:47,443 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-21 10:24:47,443 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-21 10:24:47,443 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-21 10:24:47,444 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-21 10:24:47,444 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-21 10:24:47,444 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-21 10:24:47,444 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-21 10:24:47,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-21 10:24:47,445 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-21 10:24:47,445 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-21 10:24:47,445 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-21 10:24:47,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 10:24:47,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-21 10:24:47,446 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-21 10:24:47,446 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-21 10:24:47,446 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-21 10:24:47,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-21 10:24:47,446 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-21 10:24:47,447 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-21 10:24:47,447 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> false [2020-09-21 10:24:47,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-21 10:24:47,885 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-21 10:24:47,890 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-21 10:24:47,894 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-21 10:24:47,895 INFO L275 PluginConnector]: CDTParser initialized [2020-09-21 10:24:47,896 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label15.c [2020-09-21 10:24:47,995 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/98e7bfd4c/882735b9471e4c21ba209f75c6f088fa/FLAG8b2231468 [2020-09-21 10:24:48,627 INFO L306 CDTParser]: Found 1 translation units. [2020-09-21 10:24:48,628 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label15.c [2020-09-21 10:24:48,643 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/98e7bfd4c/882735b9471e4c21ba209f75c6f088fa/FLAG8b2231468 [2020-09-21 10:24:48,890 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/98e7bfd4c/882735b9471e4c21ba209f75c6f088fa [2020-09-21 10:24:48,905 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-21 10:24:48,913 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-21 10:24:48,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-21 10:24:48,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-21 10:24:48,921 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-21 10:24:48,922 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:24:48" (1/1) ... [2020-09-21 10:24:48,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42dfe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:24:48, skipping insertion in model container [2020-09-21 10:24:48,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:24:48" (1/1) ... [2020-09-21 10:24:48,939 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-21 10:24:49,014 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-21 10:24:49,474 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:24:49,481 INFO L203 MainTranslator]: Completed pre-run [2020-09-21 10:24:49,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:24:49,711 INFO L208 MainTranslator]: Completed translation [2020-09-21 10:24:49,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:24:49 WrapperNode [2020-09-21 10:24:49,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-21 10:24:49,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-21 10:24:49,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-21 10:24:49,713 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-21 10:24:49,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:24:49" (1/1) ... [2020-09-21 10:24:49,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:24:49" (1/1) ... [2020-09-21 10:24:49,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:24:49" (1/1) ... [2020-09-21 10:24:49,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:24:49" (1/1) ... [2020-09-21 10:24:49,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:24:49" (1/1) ... [2020-09-21 10:24:49,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:24:49" (1/1) ... [2020-09-21 10:24:49,820 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:24:49" (1/1) ... [2020-09-21 10:24:49,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-21 10:24:49,837 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-21 10:24:49,837 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-21 10:24:49,837 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-21 10:24:49,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:24:49" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 10:24:49,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-21 10:24:49,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-21 10:24:49,945 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-09-21 10:24:49,945 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-21 10:24:49,946 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-09-21 10:24:49,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-21 10:24:49,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-21 10:24:49,947 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-21 10:24:49,947 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-21 10:24:49,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-21 10:24:49,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-21 10:24:51,321 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-21 10:24:51,322 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-21 10:24:51,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:24:51 BoogieIcfgContainer [2020-09-21 10:24:51,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-21 10:24:51,338 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-21 10:24:51,339 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-21 10:24:51,343 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-21 10:24:51,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 10:24:48" (1/3) ... [2020-09-21 10:24:51,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66dd96e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:24:51, skipping insertion in model container [2020-09-21 10:24:51,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:24:49" (2/3) ... [2020-09-21 10:24:51,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66dd96e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:24:51, skipping insertion in model container [2020-09-21 10:24:51,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:24:51" (3/3) ... [2020-09-21 10:24:51,351 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label15.c [2020-09-21 10:24:51,365 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-21 10:24:51,383 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-21 10:24:51,409 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-21 10:24:51,450 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-21 10:24:51,451 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-21 10:24:51,451 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-21 10:24:51,451 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-21 10:24:51,452 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-21 10:24:51,452 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-21 10:24:51,452 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-21 10:24:51,452 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-21 10:24:51,485 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2020-09-21 10:24:51,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-21 10:24:51,498 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:24:51,499 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:24:51,500 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:24:51,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:24:51,509 INFO L82 PathProgramCache]: Analyzing trace with hash -553937361, now seen corresponding path program 1 times [2020-09-21 10:24:51,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:24:51,522 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [258598473] [2020-09-21 10:24:51,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:24:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:24:51,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:24:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:24:51,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:24:51,850 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [258598473] [2020-09-21 10:24:51,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:24:51,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-21 10:24:51,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230822603] [2020-09-21 10:24:51,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:24:51,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:24:51,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:24:51,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:24:51,890 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 5 states. [2020-09-21 10:24:54,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:24:54,164 INFO L93 Difference]: Finished difference Result 730 states and 1301 transitions. [2020-09-21 10:24:54,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-21 10:24:54,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-21 10:24:54,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:24:54,220 INFO L225 Difference]: With dead ends: 730 [2020-09-21 10:24:54,220 INFO L226 Difference]: Without dead ends: 447 [2020-09-21 10:24:54,234 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:24:54,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2020-09-21 10:24:54,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 441. [2020-09-21 10:24:54,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2020-09-21 10:24:54,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 672 transitions. [2020-09-21 10:24:54,360 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 672 transitions. Word has length 16 [2020-09-21 10:24:54,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:24:54,360 INFO L479 AbstractCegarLoop]: Abstraction has 441 states and 672 transitions. [2020-09-21 10:24:54,361 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:24:54,361 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 672 transitions. [2020-09-21 10:24:54,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-09-21 10:24:54,369 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:24:54,370 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:24:54,370 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-21 10:24:54,370 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:24:54,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:24:54,371 INFO L82 PathProgramCache]: Analyzing trace with hash 829722045, now seen corresponding path program 1 times [2020-09-21 10:24:54,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:24:54,372 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [650406427] [2020-09-21 10:24:54,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:24:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:24:54,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:24:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:24:54,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 10:24:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:24:54,807 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:24:54,808 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [650406427] [2020-09-21 10:24:54,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:24:54,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-21 10:24:54,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169752959] [2020-09-21 10:24:54,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:24:54,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:24:54,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:24:54,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:24:54,813 INFO L87 Difference]: Start difference. First operand 441 states and 672 transitions. Second operand 5 states. [2020-09-21 10:24:56,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:24:56,355 INFO L93 Difference]: Finished difference Result 1172 states and 1811 transitions. [2020-09-21 10:24:56,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:24:56,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2020-09-21 10:24:56,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:24:56,364 INFO L225 Difference]: With dead ends: 1172 [2020-09-21 10:24:56,364 INFO L226 Difference]: Without dead ends: 737 [2020-09-21 10:24:56,367 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:24:56,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2020-09-21 10:24:56,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 588. [2020-09-21 10:24:56,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2020-09-21 10:24:56,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 841 transitions. [2020-09-21 10:24:56,415 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 841 transitions. Word has length 135 [2020-09-21 10:24:56,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:24:56,416 INFO L479 AbstractCegarLoop]: Abstraction has 588 states and 841 transitions. [2020-09-21 10:24:56,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:24:56,417 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 841 transitions. [2020-09-21 10:24:56,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-09-21 10:24:56,424 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:24:56,425 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:24:56,425 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-21 10:24:56,425 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:24:56,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:24:56,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1210877841, now seen corresponding path program 1 times [2020-09-21 10:24:56,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:24:56,427 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1855076274] [2020-09-21 10:24:56,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:24:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:24:56,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:24:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:24:56,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 10:24:56,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:24:56,824 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:24:56,825 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1855076274] [2020-09-21 10:24:56,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:24:56,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-21 10:24:56,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100345997] [2020-09-21 10:24:56,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-21 10:24:56,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:24:56,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-21 10:24:56,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:24:56,827 INFO L87 Difference]: Start difference. First operand 588 states and 841 transitions. Second operand 8 states. [2020-09-21 10:24:59,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:24:59,157 INFO L93 Difference]: Finished difference Result 1927 states and 2946 transitions. [2020-09-21 10:24:59,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-21 10:24:59,160 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 141 [2020-09-21 10:24:59,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:24:59,170 INFO L225 Difference]: With dead ends: 1927 [2020-09-21 10:24:59,170 INFO L226 Difference]: Without dead ends: 1345 [2020-09-21 10:24:59,173 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2020-09-21 10:24:59,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2020-09-21 10:24:59,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 896. [2020-09-21 10:24:59,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2020-09-21 10:24:59,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1204 transitions. [2020-09-21 10:24:59,241 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1204 transitions. Word has length 141 [2020-09-21 10:24:59,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:24:59,242 INFO L479 AbstractCegarLoop]: Abstraction has 896 states and 1204 transitions. [2020-09-21 10:24:59,242 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-21 10:24:59,243 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1204 transitions. [2020-09-21 10:24:59,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-09-21 10:24:59,253 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:24:59,253 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:24:59,253 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-21 10:24:59,254 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:24:59,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:24:59,254 INFO L82 PathProgramCache]: Analyzing trace with hash -2135877389, now seen corresponding path program 1 times [2020-09-21 10:24:59,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:24:59,255 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1074613669] [2020-09-21 10:24:59,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:24:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:24:59,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:24:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:24:59,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 10:24:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:24:59,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-09-21 10:24:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:24:59,774 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 22 proven. 74 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-21 10:24:59,775 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1074613669] [2020-09-21 10:24:59,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:24:59,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-21 10:24:59,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514513038] [2020-09-21 10:24:59,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-21 10:24:59,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:24:59,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-21 10:24:59,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:24:59,777 INFO L87 Difference]: Start difference. First operand 896 states and 1204 transitions. Second operand 10 states. [2020-09-21 10:25:04,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:25:04,767 INFO L93 Difference]: Finished difference Result 3093 states and 4822 transitions. [2020-09-21 10:25:04,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-21 10:25:04,767 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 220 [2020-09-21 10:25:04,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:25:04,792 INFO L225 Difference]: With dead ends: 3093 [2020-09-21 10:25:04,793 INFO L226 Difference]: Without dead ends: 2172 [2020-09-21 10:25:04,798 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2020-09-21 10:25:04,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2020-09-21 10:25:04,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 2162. [2020-09-21 10:25:04,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2162 states. [2020-09-21 10:25:04,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2162 states to 2162 states and 3334 transitions. [2020-09-21 10:25:04,935 INFO L78 Accepts]: Start accepts. Automaton has 2162 states and 3334 transitions. Word has length 220 [2020-09-21 10:25:04,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:25:04,935 INFO L479 AbstractCegarLoop]: Abstraction has 2162 states and 3334 transitions. [2020-09-21 10:25:04,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-21 10:25:04,936 INFO L276 IsEmpty]: Start isEmpty. Operand 2162 states and 3334 transitions. [2020-09-21 10:25:04,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2020-09-21 10:25:04,949 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:25:04,949 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:25:04,950 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-21 10:25:04,950 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:25:04,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:25:04,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1874245381, now seen corresponding path program 1 times [2020-09-21 10:25:04,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:25:04,951 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1116252562] [2020-09-21 10:25:04,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:25:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:25:05,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:25:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:25:05,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 10:25:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:25:05,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-09-21 10:25:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:25:05,495 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2020-09-21 10:25:05,496 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1116252562] [2020-09-21 10:25:05,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:25:05,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-21 10:25:05,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874374779] [2020-09-21 10:25:05,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-21 10:25:05,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:25:05,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-21 10:25:05,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-09-21 10:25:05,500 INFO L87 Difference]: Start difference. First operand 2162 states and 3334 transitions. Second operand 9 states. [2020-09-21 10:25:09,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:25:09,112 INFO L93 Difference]: Finished difference Result 5341 states and 10037 transitions. [2020-09-21 10:25:09,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-21 10:25:09,113 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 256 [2020-09-21 10:25:09,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:25:09,148 INFO L225 Difference]: With dead ends: 5341 [2020-09-21 10:25:09,148 INFO L226 Difference]: Without dead ends: 3185 [2020-09-21 10:25:09,163 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2020-09-21 10:25:09,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3185 states. [2020-09-21 10:25:09,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3185 to 2953. [2020-09-21 10:25:09,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2953 states. [2020-09-21 10:25:09,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 4582 transitions. [2020-09-21 10:25:09,361 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 4582 transitions. Word has length 256 [2020-09-21 10:25:09,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:25:09,362 INFO L479 AbstractCegarLoop]: Abstraction has 2953 states and 4582 transitions. [2020-09-21 10:25:09,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-21 10:25:09,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 4582 transitions. [2020-09-21 10:25:09,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2020-09-21 10:25:09,377 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:25:09,377 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:25:09,377 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-21 10:25:09,379 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:25:09,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:25:09,379 INFO L82 PathProgramCache]: Analyzing trace with hash -263744202, now seen corresponding path program 1 times [2020-09-21 10:25:09,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:25:09,380 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1036843560] [2020-09-21 10:25:09,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:25:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:25:09,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:25:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:25:09,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 10:25:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:25:09,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2020-09-21 10:25:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:25:09,733 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 18 proven. 117 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-21 10:25:09,735 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1036843560] [2020-09-21 10:25:09,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:25:09,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-21 10:25:09,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978786850] [2020-09-21 10:25:09,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-21 10:25:09,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:25:09,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-21 10:25:09,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:25:09,750 INFO L87 Difference]: Start difference. First operand 2953 states and 4582 transitions. Second operand 8 states. [2020-09-21 10:25:12,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:25:12,067 INFO L93 Difference]: Finished difference Result 5937 states and 8813 transitions. [2020-09-21 10:25:12,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-21 10:25:12,069 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 263 [2020-09-21 10:25:12,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:25:12,092 INFO L225 Difference]: With dead ends: 5937 [2020-09-21 10:25:12,092 INFO L226 Difference]: Without dead ends: 3038 [2020-09-21 10:25:12,109 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-09-21 10:25:12,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3038 states. [2020-09-21 10:25:12,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3038 to 2831. [2020-09-21 10:25:12,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2831 states. [2020-09-21 10:25:12,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 3750 transitions. [2020-09-21 10:25:12,228 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 3750 transitions. Word has length 263 [2020-09-21 10:25:12,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:25:12,228 INFO L479 AbstractCegarLoop]: Abstraction has 2831 states and 3750 transitions. [2020-09-21 10:25:12,229 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-21 10:25:12,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 3750 transitions. [2020-09-21 10:25:12,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2020-09-21 10:25:12,241 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:25:12,241 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:25:12,242 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-21 10:25:12,242 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:25:12,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:25:12,242 INFO L82 PathProgramCache]: Analyzing trace with hash -95771531, now seen corresponding path program 1 times [2020-09-21 10:25:12,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:25:12,243 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [274245332] [2020-09-21 10:25:12,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:25:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-21 10:25:12,401 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-21 10:25:12,401 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-21 10:25:12,412 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-21 10:25:12,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 10:25:12 BoogieIcfgContainer [2020-09-21 10:25:12,496 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-21 10:25:12,501 INFO L168 Benchmark]: Toolchain (without parser) took 23590.98 ms. Allocated memory was 139.5 MB in the beginning and 501.2 MB in the end (delta: 361.8 MB). Free memory was 101.0 MB in the beginning and 259.6 MB in the end (delta: -158.7 MB). Peak memory consumption was 203.1 MB. Max. memory is 7.1 GB. [2020-09-21 10:25:12,502 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-21 10:25:12,511 INFO L168 Benchmark]: CACSL2BoogieTranslator took 796.11 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 100.3 MB in the beginning and 168.9 MB in the end (delta: -68.6 MB). Peak memory consumption was 34.0 MB. Max. memory is 7.1 GB. [2020-09-21 10:25:12,512 INFO L168 Benchmark]: Boogie Preprocessor took 123.69 ms. Allocated memory is still 204.5 MB. Free memory was 168.9 MB in the beginning and 164.0 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2020-09-21 10:25:12,512 INFO L168 Benchmark]: RCFGBuilder took 1499.23 ms. Allocated memory was 204.5 MB in the beginning and 238.0 MB in the end (delta: 33.6 MB). Free memory was 164.0 MB in the beginning and 179.2 MB in the end (delta: -15.2 MB). Peak memory consumption was 80.6 MB. Max. memory is 7.1 GB. [2020-09-21 10:25:12,517 INFO L168 Benchmark]: TraceAbstraction took 21157.55 ms. Allocated memory was 238.0 MB in the beginning and 501.2 MB in the end (delta: 263.2 MB). Free memory was 179.2 MB in the beginning and 259.6 MB in the end (delta: -80.4 MB). Peak memory consumption was 182.8 MB. Max. memory is 7.1 GB. [2020-09-21 10:25:12,524 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 796.11 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 100.3 MB in the beginning and 168.9 MB in the end (delta: -68.6 MB). Peak memory consumption was 34.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 123.69 ms. Allocated memory is still 204.5 MB. Free memory was 168.9 MB in the beginning and 164.0 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1499.23 ms. Allocated memory was 204.5 MB in the beginning and 238.0 MB in the end (delta: 33.6 MB). Free memory was 164.0 MB in the beginning and 179.2 MB in the end (delta: -15.2 MB). Peak memory consumption was 80.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21157.55 ms. Allocated memory was 238.0 MB in the beginning and 501.2 MB in the end (delta: 263.2 MB). Free memory was 179.2 MB in the beginning and 259.6 MB in the end (delta: -80.4 MB). Peak memory consumption was 182.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 34]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L426] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L427] a10 = 1 [L429] return 25; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND TRUE ((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 ))) [L287] a1 = ((((((a1 % 89)+ 74) - -21) * 5) % 89)- -118) [L288] a19 = 10 [L290] return 25; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) [L460] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) [L465] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) [L471] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) [L476] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) [L481] COND TRUE (((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10)) [L482] a1 = ((((a1 * 10)/ -9) * 5) - 333686) [L483] a10 = 4 [L484] a19 = 6 [L486] return -1; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND TRUE (((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)) [L34] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 215 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 20.9s, OverallIterations: 7, TraceHistogramMax: 4, AutomataDifference: 17.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 222 SDtfs, 3708 SDslu, 405 SDs, 0 SdLazy, 8825 SolverSat, 1561 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2953occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 6 MinimizatonAttempts, 1053 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1372 NumberOfCodeBlocks, 1372 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1025 ConstructedInterpolants, 0 QuantifiedInterpolants, 616497 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 194/388 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...