/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 -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label55.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-86f66a4 [2020-07-07 13:52:17,448 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 13:52:17,451 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 13:52:17,467 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 13:52:17,468 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 13:52:17,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 13:52:17,471 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 13:52:17,472 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 13:52:17,474 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 13:52:17,475 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 13:52:17,476 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 13:52:17,477 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 13:52:17,477 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 13:52:17,478 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 13:52:17,479 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 13:52:17,481 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 13:52:17,481 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 13:52:17,482 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 13:52:17,484 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 13:52:17,486 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 13:52:17,488 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 13:52:17,489 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 13:52:17,490 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 13:52:17,491 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 13:52:17,493 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 13:52:17,494 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 13:52:17,494 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 13:52:17,495 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 13:52:17,495 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 13:52:17,496 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 13:52:17,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 13:52:17,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 13:52:17,498 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 13:52:17,499 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 13:52:17,500 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 13:52:17,500 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 13:52:17,501 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 13:52:17,501 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 13:52:17,501 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 13:52:17,502 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 13:52:17,503 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 13:52:17,507 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-07 13:52:17,517 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 13:52:17,517 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 13:52:17,518 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 13:52:17,519 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 13:52:17,519 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 13:52:17,519 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 13:52:17,519 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 13:52:17,519 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 13:52:17,520 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 13:52:17,520 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 13:52:17,520 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 13:52:17,520 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 13:52:17,520 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 13:52:17,521 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 13:52:17,521 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 13:52:17,521 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-07 13:52:17,521 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 13:52:17,521 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 13:52:17,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 13:52:17,522 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 13:52:17,522 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-07 13:52:17,522 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 13:52:17,522 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-07 13:52:17,822 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 13:52:17,836 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 13:52:17,839 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 13:52:17,841 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 13:52:17,841 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 13:52:17,842 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label55.c [2020-07-07 13:52:17,909 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12bf0da61/c53ab2e787ca43b2964f615f28f58e50/FLAGf113357bd [2020-07-07 13:52:18,453 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 13:52:18,455 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label55.c [2020-07-07 13:52:18,470 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12bf0da61/c53ab2e787ca43b2964f615f28f58e50/FLAGf113357bd [2020-07-07 13:52:18,733 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12bf0da61/c53ab2e787ca43b2964f615f28f58e50 [2020-07-07 13:52:18,744 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 13:52:18,746 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 13:52:18,747 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 13:52:18,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 13:52:18,750 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 13:52:18,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:52:18" (1/1) ... [2020-07-07 13:52:18,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d0c752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:52:18, skipping insertion in model container [2020-07-07 13:52:18,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:52:18" (1/1) ... [2020-07-07 13:52:18,762 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 13:52:18,815 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 13:52:19,220 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:52:19,230 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 13:52:19,463 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:52:19,478 INFO L208 MainTranslator]: Completed translation [2020-07-07 13:52:19,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:52:19 WrapperNode [2020-07-07 13:52:19,479 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 13:52:19,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 13:52:19,480 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 13:52:19,480 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 13:52:19,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:52:19" (1/1) ... [2020-07-07 13:52:19,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:52:19" (1/1) ... [2020-07-07 13:52:19,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:52:19" (1/1) ... [2020-07-07 13:52:19,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:52:19" (1/1) ... [2020-07-07 13:52:19,566 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:52:19" (1/1) ... [2020-07-07 13:52:19,586 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:52:19" (1/1) ... [2020-07-07 13:52:19,595 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:52:19" (1/1) ... [2020-07-07 13:52:19,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 13:52:19,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 13:52:19,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 13:52:19,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 13:52:19,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:52:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/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-07-07 13:52:19,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 13:52:19,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 13:52:19,690 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-07-07 13:52:19,690 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 13:52:19,690 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-07-07 13:52:19,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 13:52:19,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-07 13:52:19,691 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-07 13:52:19,691 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 13:52:19,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 13:52:19,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 13:52:21,115 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 13:52:21,116 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-07 13:52:21,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:52:21 BoogieIcfgContainer [2020-07-07 13:52:21,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 13:52:21,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 13:52:21,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 13:52:21,136 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 13:52:21,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 01:52:18" (1/3) ... [2020-07-07 13:52:21,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c38ebda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:52:21, skipping insertion in model container [2020-07-07 13:52:21,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:52:19" (2/3) ... [2020-07-07 13:52:21,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c38ebda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:52:21, skipping insertion in model container [2020-07-07 13:52:21,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:52:21" (3/3) ... [2020-07-07 13:52:21,146 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label55.c [2020-07-07 13:52:21,155 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-07 13:52:21,168 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-07 13:52:21,181 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-07 13:52:21,204 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 13:52:21,204 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 13:52:21,204 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-07 13:52:21,204 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 13:52:21,205 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 13:52:21,205 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 13:52:21,205 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 13:52:21,205 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 13:52:21,228 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states. [2020-07-07 13:52:21,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-07 13:52:21,239 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:52:21,240 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:52:21,241 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:52:21,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:52:21,247 INFO L82 PathProgramCache]: Analyzing trace with hash -18090369, now seen corresponding path program 1 times [2020-07-07 13:52:21,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:52:21,257 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1871633279] [2020-07-07 13:52:21,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:52:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:52:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:52:21,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:52:21,631 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:52:21,634 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1871633279] [2020-07-07 13:52:21,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:52:21,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 13:52:21,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238843024] [2020-07-07 13:52:21,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 13:52:21,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:52:21,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 13:52:21,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-07 13:52:21,665 INFO L87 Difference]: Start difference. First operand 456 states. Second operand 5 states. [2020-07-07 13:52:24,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:52:24,461 INFO L93 Difference]: Finished difference Result 1308 states and 1880 transitions. [2020-07-07 13:52:24,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-07 13:52:24,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-07-07 13:52:24,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:52:24,493 INFO L225 Difference]: With dead ends: 1308 [2020-07-07 13:52:24,493 INFO L226 Difference]: Without dead ends: 774 [2020-07-07 13:52:24,504 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-07 13:52:24,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2020-07-07 13:52:24,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 546. [2020-07-07 13:52:24,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2020-07-07 13:52:24,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 698 transitions. [2020-07-07 13:52:24,654 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 698 transitions. Word has length 37 [2020-07-07 13:52:24,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:52:24,655 INFO L479 AbstractCegarLoop]: Abstraction has 546 states and 698 transitions. [2020-07-07 13:52:24,655 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 13:52:24,656 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 698 transitions. [2020-07-07 13:52:24,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-07-07 13:52:24,663 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:52:24,663 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:52:24,664 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 13:52:24,664 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:52:24,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:52:24,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1996109808, now seen corresponding path program 1 times [2020-07-07 13:52:24,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:52:24,665 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [577280296] [2020-07-07 13:52:24,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:52:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:52:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:52:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:52:24,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:52:24,968 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:52:24,969 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [577280296] [2020-07-07 13:52:24,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:52:24,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-07 13:52:24,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648106295] [2020-07-07 13:52:24,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-07 13:52:24,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:52:24,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-07 13:52:24,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-07 13:52:24,972 INFO L87 Difference]: Start difference. First operand 546 states and 698 transitions. Second operand 6 states. [2020-07-07 13:52:26,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:52:26,965 INFO L93 Difference]: Finished difference Result 1168 states and 1661 transitions. [2020-07-07 13:52:26,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-07 13:52:26,965 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2020-07-07 13:52:26,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:52:26,976 INFO L225 Difference]: With dead ends: 1168 [2020-07-07 13:52:26,977 INFO L226 Difference]: Without dead ends: 1166 [2020-07-07 13:52:26,979 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-07 13:52:26,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-07-07 13:52:27,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 850. [2020-07-07 13:52:27,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2020-07-07 13:52:27,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1162 transitions. [2020-07-07 13:52:27,085 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1162 transitions. Word has length 116 [2020-07-07 13:52:27,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:52:27,086 INFO L479 AbstractCegarLoop]: Abstraction has 850 states and 1162 transitions. [2020-07-07 13:52:27,086 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-07 13:52:27,086 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1162 transitions. [2020-07-07 13:52:27,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2020-07-07 13:52:27,092 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:52:27,093 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-07 13:52:27,093 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 13:52:27,093 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:52:27,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:52:27,094 INFO L82 PathProgramCache]: Analyzing trace with hash -375587405, now seen corresponding path program 1 times [2020-07-07 13:52:27,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:52:27,094 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [455191825] [2020-07-07 13:52:27,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:52:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:52:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:52:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:52:27,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:52:27,667 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:52:27,671 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [455191825] [2020-07-07 13:52:27,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:52:27,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 13:52:27,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275373252] [2020-07-07 13:52:27,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 13:52:27,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:52:27,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 13:52:27,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-07 13:52:27,675 INFO L87 Difference]: Start difference. First operand 850 states and 1162 transitions. Second operand 9 states. [2020-07-07 13:52:30,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:52:30,492 INFO L93 Difference]: Finished difference Result 2675 states and 3932 transitions. [2020-07-07 13:52:30,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-07 13:52:30,492 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 183 [2020-07-07 13:52:30,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:52:30,518 INFO L225 Difference]: With dead ends: 2675 [2020-07-07 13:52:30,523 INFO L226 Difference]: Without dead ends: 1840 [2020-07-07 13:52:30,532 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2020-07-07 13:52:30,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2020-07-07 13:52:30,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1328. [2020-07-07 13:52:30,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1328 states. [2020-07-07 13:52:30,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1762 transitions. [2020-07-07 13:52:30,791 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1762 transitions. Word has length 183 [2020-07-07 13:52:30,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:52:30,793 INFO L479 AbstractCegarLoop]: Abstraction has 1328 states and 1762 transitions. [2020-07-07 13:52:30,793 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 13:52:30,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1762 transitions. [2020-07-07 13:52:30,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2020-07-07 13:52:30,804 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:52:30,804 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-07 13:52:30,805 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-07 13:52:30,805 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:52:30,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:52:30,805 INFO L82 PathProgramCache]: Analyzing trace with hash 569865638, now seen corresponding path program 1 times [2020-07-07 13:52:30,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:52:30,806 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2090971895] [2020-07-07 13:52:30,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:52:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:52:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:52:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:52:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:52:31,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:52:31,432 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:52:31,432 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2090971895] [2020-07-07 13:52:31,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:52:31,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-07 13:52:31,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98435036] [2020-07-07 13:52:31,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-07 13:52:31,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:52:31,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-07 13:52:31,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-07-07 13:52:31,435 INFO L87 Difference]: Start difference. First operand 1328 states and 1762 transitions. Second operand 12 states. [2020-07-07 13:52:35,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:52:35,746 INFO L93 Difference]: Finished difference Result 4603 states and 6548 transitions. [2020-07-07 13:52:35,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-07 13:52:35,747 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 272 [2020-07-07 13:52:35,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:52:35,774 INFO L225 Difference]: With dead ends: 4603 [2020-07-07 13:52:35,774 INFO L226 Difference]: Without dead ends: 2576 [2020-07-07 13:52:35,788 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2020-07-07 13:52:35,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2020-07-07 13:52:36,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 2382. [2020-07-07 13:52:36,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2382 states. [2020-07-07 13:52:36,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2382 states and 2966 transitions. [2020-07-07 13:52:36,115 INFO L78 Accepts]: Start accepts. Automaton has 2382 states and 2966 transitions. Word has length 272 [2020-07-07 13:52:36,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:52:36,116 INFO L479 AbstractCegarLoop]: Abstraction has 2382 states and 2966 transitions. [2020-07-07 13:52:36,116 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-07 13:52:36,116 INFO L276 IsEmpty]: Start isEmpty. Operand 2382 states and 2966 transitions. [2020-07-07 13:52:36,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2020-07-07 13:52:36,126 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:52:36,126 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-07-07 13:52:36,127 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-07 13:52:36,127 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:52:36,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:52:36,127 INFO L82 PathProgramCache]: Analyzing trace with hash -335062027, now seen corresponding path program 1 times [2020-07-07 13:52:36,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:52:36,128 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1346056992] [2020-07-07 13:52:36,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:52:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:52:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:52:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:52:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:52:36,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:52:36,580 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:52:36,580 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1346056992] [2020-07-07 13:52:36,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:52:36,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-07 13:52:36,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454464131] [2020-07-07 13:52:36,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-07 13:52:36,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:52:36,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-07 13:52:36,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-07 13:52:36,582 INFO L87 Difference]: Start difference. First operand 2382 states and 2966 transitions. Second operand 6 states. [2020-07-07 13:52:39,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:52:39,111 INFO L93 Difference]: Finished difference Result 5999 states and 7694 transitions. [2020-07-07 13:52:39,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-07 13:52:39,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 307 [2020-07-07 13:52:39,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:52:39,147 INFO L225 Difference]: With dead ends: 5999 [2020-07-07 13:52:39,147 INFO L226 Difference]: Without dead ends: 3626 [2020-07-07 13:52:39,159 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-07 13:52:39,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3626 states. [2020-07-07 13:52:39,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3626 to 3600. [2020-07-07 13:52:39,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3600 states. [2020-07-07 13:52:39,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3600 states to 3600 states and 4428 transitions. [2020-07-07 13:52:39,701 INFO L78 Accepts]: Start accepts. Automaton has 3600 states and 4428 transitions. Word has length 307 [2020-07-07 13:52:39,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:52:39,702 INFO L479 AbstractCegarLoop]: Abstraction has 3600 states and 4428 transitions. [2020-07-07 13:52:39,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-07 13:52:39,702 INFO L276 IsEmpty]: Start isEmpty. Operand 3600 states and 4428 transitions. [2020-07-07 13:52:39,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2020-07-07 13:52:39,715 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:52:39,715 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-07-07 13:52:39,715 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-07 13:52:39,716 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:52:39,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:52:39,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1920210634, now seen corresponding path program 1 times [2020-07-07 13:52:39,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:52:39,717 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1797240402] [2020-07-07 13:52:39,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:52:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 13:52:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 13:52:40,007 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:52:40,007 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-07 13:52:40,007 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-07 13:52:40,008 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-07 13:52:40,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.07 01:52:40 BoogieIcfgContainer [2020-07-07 13:52:40,057 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-07 13:52:40,060 INFO L168 Benchmark]: Toolchain (without parser) took 21313.28 ms. Allocated memory was 142.6 MB in the beginning and 592.4 MB in the end (delta: 449.8 MB). Free memory was 99.3 MB in the beginning and 272.3 MB in the end (delta: -173.0 MB). Peak memory consumption was 276.9 MB. Max. memory is 7.1 GB. [2020-07-07 13:52:40,061 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 142.6 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-07 13:52:40,062 INFO L168 Benchmark]: CACSL2BoogieTranslator took 732.74 ms. Allocated memory was 142.6 MB in the beginning and 202.9 MB in the end (delta: 60.3 MB). Free memory was 99.1 MB in the beginning and 169.2 MB in the end (delta: -70.1 MB). Peak memory consumption was 32.5 MB. Max. memory is 7.1 GB. [2020-07-07 13:52:40,063 INFO L168 Benchmark]: Boogie Preprocessor took 130.05 ms. Allocated memory is still 202.9 MB. Free memory was 169.2 MB in the beginning and 164.7 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 7.1 GB. [2020-07-07 13:52:40,063 INFO L168 Benchmark]: RCFGBuilder took 1520.61 ms. Allocated memory was 202.9 MB in the beginning and 230.7 MB in the end (delta: 27.8 MB). Free memory was 164.7 MB in the beginning and 162.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 88.7 MB. Max. memory is 7.1 GB. [2020-07-07 13:52:40,064 INFO L168 Benchmark]: TraceAbstraction took 18923.78 ms. Allocated memory was 230.7 MB in the beginning and 592.4 MB in the end (delta: 361.8 MB). Free memory was 162.8 MB in the beginning and 272.3 MB in the end (delta: -109.4 MB). Peak memory consumption was 252.3 MB. Max. memory is 7.1 GB. [2020-07-07 13:52:40,068 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.26 ms. Allocated memory is still 142.6 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 732.74 ms. Allocated memory was 142.6 MB in the beginning and 202.9 MB in the end (delta: 60.3 MB). Free memory was 99.1 MB in the beginning and 169.2 MB in the end (delta: -70.1 MB). Peak memory consumption was 32.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 130.05 ms. Allocated memory is still 202.9 MB. Free memory was 169.2 MB in the beginning and 164.7 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1520.61 ms. Allocated memory was 202.9 MB in the beginning and 230.7 MB in the end (delta: 27.8 MB). Free memory was 164.7 MB in the beginning and 162.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 88.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18923.78 ms. Allocated memory was 230.7 MB in the beginning and 592.4 MB in the end (delta: 361.8 MB). Free memory was 162.8 MB in the beginning and 272.3 MB in the end (delta: -109.4 MB). Peak memory consumption was 252.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 58]: 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 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 FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) [L487] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) [L493] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) [L499] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) [L504] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) [L509] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) [L514] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) [L517] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) [L523] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) [L526] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) [L529] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) [L534] COND FALSE !(((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0)))))) [L540] COND FALSE !(((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0)))) [L545] COND FALSE !(((a4==14) && (((a12==0) && ((a19==9) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a10==4)))) [L548] COND FALSE !(((((( ((38 < a1) && (218 >= a1)) && (input == 3)) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10))) [L554] COND FALSE !((((a4==14) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 4)) && (a12==0)) && (a19==9))) && (a10==2))) [L557] COND TRUE ((a12==0) && ((( 218 < a1 && ((a19==9) && (input == 5))) && (a10==1)) && (a4==14))) [L558] a1 = ((((a1 * 9)/ 10) + 58620) - 603783) [L559] a10 = 4 [L560] a19 = 8 [L562] 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 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 TRUE (((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)) [L58] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 456 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 18.8s, OverallIterations: 6, TraceHistogramMax: 3, AutomataDifference: 14.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1010 SDtfs, 6219 SDslu, 1662 SDs, 0 SdLazy, 8175 SolverSat, 1482 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3600occurred 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: 1.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 1276 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...