java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label15_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 12:51:12,468 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 12:51:12,470 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 12:51:12,483 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 12:51:12,483 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 12:51:12,484 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 12:51:12,485 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 12:51:12,487 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 12:51:12,489 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 12:51:12,490 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 12:51:12,491 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 12:51:12,491 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 12:51:12,492 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 12:51:12,495 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 12:51:12,496 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 12:51:12,497 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 12:51:12,498 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 12:51:12,504 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 12:51:12,506 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 12:51:12,508 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 12:51:12,509 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 12:51:12,510 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 12:51:12,512 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 12:51:12,513 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 12:51:12,513 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 12:51:12,514 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 12:51:12,515 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 12:51:12,516 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 12:51:12,516 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 12:51:12,518 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 12:51:12,518 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 12:51:12,519 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 12:51:12,519 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 12:51:12,519 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 12:51:12,520 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 12:51:12,521 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 12:51:12,521 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf [2018-09-19 12:51:12,545 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 12:51:12,545 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 12:51:12,546 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 12:51:12,546 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 12:51:12,549 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 12:51:12,550 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 12:51:12,550 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 12:51:12,550 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 12:51:12,550 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-19 12:51:12,551 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 12:51:12,551 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 12:51:12,551 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 12:51:12,552 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 12:51:12,552 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 12:51:12,552 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 12:51:12,553 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 12:51:12,554 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 12:51:12,554 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 12:51:12,554 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 12:51:12,554 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 12:51:12,554 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 12:51:12,555 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 12:51:12,555 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 12:51:12,555 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 12:51:12,556 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 12:51:12,557 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 12:51:12,557 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 12:51:12,557 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 12:51:12,557 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 12:51:12,558 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 12:51:12,558 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 12:51:12,558 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 12:51:12,558 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 12:51:12,559 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 12:51:12,624 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 12:51:12,639 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 12:51:12,645 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 12:51:12,647 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 12:51:12,648 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 12:51:12,648 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label15_true-unreach-call.c [2018-09-19 12:51:13,041 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23392db3d/9c97f27298bc4abda60a9d398e2e4be1/FLAGb6c06fd13 [2018-09-19 12:51:13,576 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 12:51:13,577 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label15_true-unreach-call.c [2018-09-19 12:51:13,616 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23392db3d/9c97f27298bc4abda60a9d398e2e4be1/FLAGb6c06fd13 [2018-09-19 12:51:13,642 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23392db3d/9c97f27298bc4abda60a9d398e2e4be1 [2018-09-19 12:51:13,655 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 12:51:13,660 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 12:51:13,662 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 12:51:13,662 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 12:51:13,672 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 12:51:13,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 12:51:13" (1/1) ... [2018-09-19 12:51:13,678 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74ded99e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:51:13, skipping insertion in model container [2018-09-19 12:51:13,678 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 12:51:13" (1/1) ... [2018-09-19 12:51:13,691 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 12:51:15,249 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 12:51:15,267 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 12:51:16,025 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 12:51:16,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:51:16 WrapperNode [2018-09-19 12:51:16,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 12:51:16,351 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 12:51:16,351 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 12:51:16,351 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 12:51:16,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:51:16" (1/1) ... [2018-09-19 12:51:16,477 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:51:16" (1/1) ... [2018-09-19 12:51:16,680 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 12:51:16,681 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 12:51:16,681 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 12:51:16,681 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 12:51:17,478 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:51:16" (1/1) ... [2018-09-19 12:51:17,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:51:16" (1/1) ... [2018-09-19 12:51:17,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:51:16" (1/1) ... [2018-09-19 12:51:17,551 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:51:16" (1/1) ... [2018-09-19 12:51:17,686 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:51:16" (1/1) ... [2018-09-19 12:51:17,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:51:16" (1/1) ... [2018-09-19 12:51:17,787 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:51:16" (1/1) ... [2018-09-19 12:51:17,844 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 12:51:17,845 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 12:51:17,845 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 12:51:17,845 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 12:51:17,846 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:51:16" (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 [2018-09-19 12:51:17,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 12:51:17,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 12:51:17,920 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-09-19 12:51:17,921 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-09-19 12:51:17,921 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-09-19 12:51:17,921 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-09-19 12:51:17,921 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-09-19 12:51:17,921 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-09-19 12:51:17,922 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 12:51:17,922 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 12:51:17,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 12:51:17,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 12:51:17,922 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 12:51:17,923 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 12:51:28,120 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 12:51:28,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 12:51:28 BoogieIcfgContainer [2018-09-19 12:51:28,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 12:51:28,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 12:51:28,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 12:51:28,128 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 12:51:28,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 12:51:13" (1/3) ... [2018-09-19 12:51:28,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61bc6be9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 12:51:28, skipping insertion in model container [2018-09-19 12:51:28,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:51:16" (2/3) ... [2018-09-19 12:51:28,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61bc6be9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 12:51:28, skipping insertion in model container [2018-09-19 12:51:28,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 12:51:28" (3/3) ... [2018-09-19 12:51:28,132 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label15_true-unreach-call.c [2018-09-19 12:51:28,143 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 12:51:28,154 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 12:51:28,231 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 12:51:28,232 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 12:51:28,232 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 12:51:28,232 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 12:51:28,232 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 12:51:28,233 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 12:51:28,233 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 12:51:28,233 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 12:51:28,233 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 12:51:28,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-09-19 12:51:28,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-19 12:51:28,288 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:51:28,289 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:51:28,290 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:51:28,296 INFO L82 PathProgramCache]: Analyzing trace with hash 801605187, now seen corresponding path program 1 times [2018-09-19 12:51:28,299 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:51:28,300 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-09-19 12:51:28,303 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2871], [2873], [4242], [4246], [4252], [4256], [4269], [4270], [4271], [4273] [2018-09-19 12:51:28,354 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:51:28,354 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:51:28,658 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:51:28,660 INFO L272 AbstractInterpreter]: Visited 42 different actions 42 times. Never merged. Never widened. Never found a fixpoint. Largest state had 25 variables. [2018-09-19 12:51:28,712 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:51:28,938 INFO L232 lantSequenceWeakener]: Weakened 40 states. On average, predicates are now at 72.33% of their original sizes. [2018-09-19 12:51:28,939 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:51:29,202 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:51:29,203 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:51:29,204 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 12:51:29,204 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:51:29,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 12:51:29,226 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 12:51:29,227 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 12:51:29,230 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 6 states. [2018-09-19 12:51:44,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:51:44,978 INFO L93 Difference]: Finished difference Result 3044 states and 5648 transitions. [2018-09-19 12:51:44,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 12:51:44,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-09-19 12:51:44,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:51:45,012 INFO L225 Difference]: With dead ends: 3044 [2018-09-19 12:51:45,012 INFO L226 Difference]: Without dead ends: 1922 [2018-09-19 12:51:45,025 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 12:51:45,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2018-09-19 12:51:45,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1920. [2018-09-19 12:51:45,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1920 states. [2018-09-19 12:51:45,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1920 states and 2831 transitions. [2018-09-19 12:51:45,171 INFO L78 Accepts]: Start accepts. Automaton has 1920 states and 2831 transitions. Word has length 43 [2018-09-19 12:51:45,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:51:45,172 INFO L480 AbstractCegarLoop]: Abstraction has 1920 states and 2831 transitions. [2018-09-19 12:51:45,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 12:51:45,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 2831 transitions. [2018-09-19 12:51:45,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-19 12:51:45,183 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:51:45,184 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 12:51:45,185 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:51:45,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1896342960, now seen corresponding path program 1 times [2018-09-19 12:51:45,185 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:51:45,186 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 145 with the following transitions: [2018-09-19 12:51:45,186 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2871], [2873], [2876], [2884], [2892], [2900], [2908], [2916], [2924], [2932], [2940], [2948], [2956], [2964], [2972], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3265], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-09-19 12:51:45,197 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:51:45,197 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:51:45,778 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:51:45,778 INFO L272 AbstractInterpreter]: Visited 108 different actions 311 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-19 12:51:45,816 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:51:46,176 INFO L232 lantSequenceWeakener]: Weakened 141 states. On average, predicates are now at 71.32% of their original sizes. [2018-09-19 12:51:46,178 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:51:46,950 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:51:46,950 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:51:46,950 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:51:46,950 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:51:46,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:51:46,953 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:51:46,953 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:51:46,954 INFO L87 Difference]: Start difference. First operand 1920 states and 2831 transitions. Second operand 10 states. [2018-09-19 12:52:04,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:52:04,248 INFO L93 Difference]: Finished difference Result 3841 states and 6447 transitions. [2018-09-19 12:52:04,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 12:52:04,249 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 144 [2018-09-19 12:52:04,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:52:04,262 INFO L225 Difference]: With dead ends: 3841 [2018-09-19 12:52:04,262 INFO L226 Difference]: Without dead ends: 2731 [2018-09-19 12:52:04,267 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 150 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:52:04,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2731 states. [2018-09-19 12:52:04,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2731 to 2726. [2018-09-19 12:52:04,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2726 states. [2018-09-19 12:52:04,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2726 states and 3662 transitions. [2018-09-19 12:52:04,333 INFO L78 Accepts]: Start accepts. Automaton has 2726 states and 3662 transitions. Word has length 144 [2018-09-19 12:52:04,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:52:04,334 INFO L480 AbstractCegarLoop]: Abstraction has 2726 states and 3662 transitions. [2018-09-19 12:52:04,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:52:04,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2726 states and 3662 transitions. [2018-09-19 12:52:04,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-09-19 12:52:04,341 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:52:04,346 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:52:04,346 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:52:04,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1871622181, now seen corresponding path program 1 times [2018-09-19 12:52:04,347 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:52:04,347 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 174 with the following transitions: [2018-09-19 12:52:04,348 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2871], [2873], [2876], [2884], [2892], [2900], [2908], [2916], [2924], [2932], [2940], [2948], [2956], [2964], [2972], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3266], [3270], [3274], [3278], [3282], [3286], [3290], [3294], [3305], [3309], [3313], [3317], [3321], [3325], [3329], [3333], [3344], [3355], [3366], [3370], [3374], [3378], [3382], [3386], [3390], [3394], [3398], [3402], [3406], [3409], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-09-19 12:52:04,359 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:52:04,359 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:52:04,552 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:52:04,849 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:52:04,849 INFO L272 AbstractInterpreter]: Visited 137 different actions 398 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-19 12:52:04,887 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:52:05,229 INFO L232 lantSequenceWeakener]: Weakened 170 states. On average, predicates are now at 71.23% of their original sizes. [2018-09-19 12:52:05,230 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:52:06,044 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:52:06,044 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:52:06,045 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:52:06,045 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:52:06,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:52:06,046 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:52:06,046 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:52:06,047 INFO L87 Difference]: Start difference. First operand 2726 states and 3662 transitions. Second operand 10 states. [2018-09-19 12:52:21,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:52:21,124 INFO L93 Difference]: Finished difference Result 4658 states and 7291 transitions. [2018-09-19 12:52:21,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 12:52:21,129 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 173 [2018-09-19 12:52:21,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:52:21,154 INFO L225 Difference]: With dead ends: 4658 [2018-09-19 12:52:21,154 INFO L226 Difference]: Without dead ends: 3548 [2018-09-19 12:52:21,158 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 179 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:52:21,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3548 states. [2018-09-19 12:52:21,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3548 to 3542. [2018-09-19 12:52:21,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3542 states. [2018-09-19 12:52:21,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3542 states to 3542 states and 4500 transitions. [2018-09-19 12:52:21,251 INFO L78 Accepts]: Start accepts. Automaton has 3542 states and 4500 transitions. Word has length 173 [2018-09-19 12:52:21,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:52:21,252 INFO L480 AbstractCegarLoop]: Abstraction has 3542 states and 4500 transitions. [2018-09-19 12:52:21,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:52:21,253 INFO L276 IsEmpty]: Start isEmpty. Operand 3542 states and 4500 transitions. [2018-09-19 12:52:21,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-09-19 12:52:21,259 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:52:21,261 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 12:52:21,261 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:52:21,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1945165379, now seen corresponding path program 1 times [2018-09-19 12:52:21,262 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:52:21,262 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 239 with the following transitions: [2018-09-19 12:52:21,262 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2871], [2873], [2876], [2884], [2892], [2900], [2908], [2916], [2924], [2932], [2940], [2948], [2956], [2964], [2972], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3237], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3265], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-09-19 12:52:21,268 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:52:21,268 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:52:21,436 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:52:21,592 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:52:21,592 INFO L272 AbstractInterpreter]: Visited 109 different actions 423 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-19 12:52:21,629 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:52:21,985 INFO L232 lantSequenceWeakener]: Weakened 235 states. On average, predicates are now at 71.16% of their original sizes. [2018-09-19 12:52:21,986 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:52:22,530 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:52:22,531 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:52:22,531 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:52:22,531 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:52:22,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:52:22,532 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:52:22,532 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:52:22,533 INFO L87 Difference]: Start difference. First operand 3542 states and 4500 transitions. Second operand 10 states. [2018-09-19 12:52:34,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:52:34,927 INFO L93 Difference]: Finished difference Result 6286 states and 8969 transitions. [2018-09-19 12:52:34,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 12:52:34,928 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 238 [2018-09-19 12:52:34,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:52:34,949 INFO L225 Difference]: With dead ends: 6286 [2018-09-19 12:52:34,950 INFO L226 Difference]: Without dead ends: 4360 [2018-09-19 12:52:34,957 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 244 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:52:34,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4360 states. [2018-09-19 12:52:35,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4360 to 4349. [2018-09-19 12:52:35,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4349 states. [2018-09-19 12:52:35,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4349 states to 4349 states and 5346 transitions. [2018-09-19 12:52:35,082 INFO L78 Accepts]: Start accepts. Automaton has 4349 states and 5346 transitions. Word has length 238 [2018-09-19 12:52:35,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:52:35,083 INFO L480 AbstractCegarLoop]: Abstraction has 4349 states and 5346 transitions. [2018-09-19 12:52:35,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:52:35,083 INFO L276 IsEmpty]: Start isEmpty. Operand 4349 states and 5346 transitions. [2018-09-19 12:52:35,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-09-19 12:52:35,089 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:52:35,089 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 12:52:35,089 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:52:35,089 INFO L82 PathProgramCache]: Analyzing trace with hash 2049181019, now seen corresponding path program 1 times [2018-09-19 12:52:35,090 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:52:35,090 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 251 with the following transitions: [2018-09-19 12:52:35,091 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2871], [2873], [2876], [2884], [2892], [2900], [2908], [2916], [2924], [2932], [2940], [2948], [2956], [2964], [2972], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3265], [3266], [3270], [3274], [3278], [3282], [3285], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-09-19 12:52:35,098 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:52:35,098 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:52:35,424 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:52:35,683 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:52:35,684 INFO L272 AbstractInterpreter]: Visited 114 different actions 554 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 26 variables. [2018-09-19 12:52:35,720 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:52:36,104 INFO L232 lantSequenceWeakener]: Weakened 247 states. On average, predicates are now at 71.14% of their original sizes. [2018-09-19 12:52:36,104 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:52:36,359 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:52:36,359 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:52:36,359 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:52:36,360 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:52:36,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:52:36,360 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:52:36,360 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:52:36,361 INFO L87 Difference]: Start difference. First operand 4349 states and 5346 transitions. Second operand 10 states. [2018-09-19 12:52:55,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:52:55,983 INFO L93 Difference]: Finished difference Result 7115 states and 9845 transitions. [2018-09-19 12:52:55,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 12:52:55,984 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 250 [2018-09-19 12:52:55,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:52:56,001 INFO L225 Difference]: With dead ends: 7115 [2018-09-19 12:52:56,001 INFO L226 Difference]: Without dead ends: 5189 [2018-09-19 12:52:56,006 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 257 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:52:56,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5189 states. [2018-09-19 12:52:56,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5189 to 5167. [2018-09-19 12:52:56,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5167 states. [2018-09-19 12:52:56,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5167 states to 5167 states and 6284 transitions. [2018-09-19 12:52:56,109 INFO L78 Accepts]: Start accepts. Automaton has 5167 states and 6284 transitions. Word has length 250 [2018-09-19 12:52:56,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:52:56,111 INFO L480 AbstractCegarLoop]: Abstraction has 5167 states and 6284 transitions. [2018-09-19 12:52:56,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:52:56,111 INFO L276 IsEmpty]: Start isEmpty. Operand 5167 states and 6284 transitions. [2018-09-19 12:52:56,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-09-19 12:52:56,115 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:52:56,116 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:52:56,116 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:52:56,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1313987420, now seen corresponding path program 1 times [2018-09-19 12:52:56,117 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:52:56,117 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 267 with the following transitions: [2018-09-19 12:52:56,117 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2871], [2873], [2876], [2884], [2892], [2900], [2908], [2916], [2924], [2932], [2940], [2948], [2956], [2964], [2972], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3266], [3270], [3274], [3278], [3282], [3286], [3290], [3294], [3305], [3309], [3313], [3317], [3321], [3325], [3329], [3333], [3344], [3355], [3366], [3370], [3374], [3378], [3382], [3386], [3390], [3394], [3398], [3402], [3406], [3410], [3414], [3425], [3429], [3440], [3451], [3455], [3459], [3463], [3467], [3471], [3475], [3479], [3483], [3487], [3498], [3502], [3506], [3517], [3521], [3525], [3529], [3533], [3537], [3541], [3545], [3556], [3560], [3564], [3568], [3572], [3576], [3580], [3591], [3595], [3599], [3603], [3614], [3618], [3622], [3626], [3630], [3634], [3638], [3642], [3646], [3650], [3654], [3658], [3662], [3666], [3670], [3674], [3678], [3682], [3686], [3690], [3694], [3698], [3709], [3713], [3717], [3721], [3725], [3729], [3733], [3737], [3741], [3745], [3749], [3753], [3757], [3768], [3772], [3776], [3780], [3784], [3788], [3792], [3796], [3800], [3804], [3815], [3819], [3823], [3827], [3831], [3835], [3839], [3843], [3847], [3851], [3862], [3865], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-09-19 12:52:56,122 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:52:56,123 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:52:56,343 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:52:56,803 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:52:56,804 INFO L272 AbstractInterpreter]: Visited 230 different actions 677 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-19 12:52:56,844 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:52:57,408 INFO L232 lantSequenceWeakener]: Weakened 263 states. On average, predicates are now at 71.09% of their original sizes. [2018-09-19 12:52:57,408 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:52:57,669 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:52:57,669 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:52:57,670 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:52:57,670 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:52:57,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:52:57,670 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:52:57,670 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:52:57,672 INFO L87 Difference]: Start difference. First operand 5167 states and 6284 transitions. Second operand 10 states. [2018-09-19 12:53:17,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:53:17,159 INFO L93 Difference]: Finished difference Result 9545 states and 12511 transitions. [2018-09-19 12:53:17,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 12:53:17,160 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 266 [2018-09-19 12:53:17,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:53:17,195 INFO L225 Difference]: With dead ends: 9545 [2018-09-19 12:53:17,196 INFO L226 Difference]: Without dead ends: 6800 [2018-09-19 12:53:17,203 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 272 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:53:17,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6800 states. [2018-09-19 12:53:17,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6800 to 6794. [2018-09-19 12:53:17,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6794 states. [2018-09-19 12:53:17,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6794 states to 6794 states and 7947 transitions. [2018-09-19 12:53:17,336 INFO L78 Accepts]: Start accepts. Automaton has 6794 states and 7947 transitions. Word has length 266 [2018-09-19 12:53:17,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:53:17,337 INFO L480 AbstractCegarLoop]: Abstraction has 6794 states and 7947 transitions. [2018-09-19 12:53:17,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:53:17,337 INFO L276 IsEmpty]: Start isEmpty. Operand 6794 states and 7947 transitions. [2018-09-19 12:53:17,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-09-19 12:53:17,342 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:53:17,342 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 12:53:17,342 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:53:17,343 INFO L82 PathProgramCache]: Analyzing trace with hash -817555374, now seen corresponding path program 1 times [2018-09-19 12:53:17,343 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:53:17,343 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 275 with the following transitions: [2018-09-19 12:53:17,343 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2871], [2873], [2876], [2884], [2892], [2900], [2908], [2916], [2924], [2932], [2940], [2948], [2956], [2964], [2972], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3265], [3266], [3270], [3274], [3278], [3282], [3286], [3290], [3294], [3305], [3309], [3313], [3317], [3321], [3325], [3329], [3333], [3344], [3355], [3366], [3370], [3374], [3378], [3382], [3386], [3390], [3394], [3398], [3402], [3406], [3409], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-09-19 12:53:17,346 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:53:17,347 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:53:17,464 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:53:17,895 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:53:17,895 INFO L272 AbstractInterpreter]: Visited 138 different actions 675 times. Merged at 7 different actions 29 times. Never widened. Found 6 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-19 12:53:17,928 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:53:18,312 INFO L232 lantSequenceWeakener]: Weakened 271 states. On average, predicates are now at 71.12% of their original sizes. [2018-09-19 12:53:18,313 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:53:18,502 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:53:18,502 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:53:18,503 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:53:18,503 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:53:18,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:53:18,503 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:53:18,503 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:53:18,504 INFO L87 Difference]: Start difference. First operand 6794 states and 7947 transitions. Second operand 10 states. [2018-09-19 12:53:41,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:53:41,561 INFO L93 Difference]: Finished difference Result 13654 states and 16856 transitions. [2018-09-19 12:53:41,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:53:41,562 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 274 [2018-09-19 12:53:41,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:53:41,593 INFO L225 Difference]: With dead ends: 13654 [2018-09-19 12:53:41,593 INFO L226 Difference]: Without dead ends: 9279 [2018-09-19 12:53:41,602 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 281 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:53:41,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9279 states. [2018-09-19 12:53:41,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9279 to 9252. [2018-09-19 12:53:41,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9252 states. [2018-09-19 12:53:41,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9252 states to 9252 states and 10537 transitions. [2018-09-19 12:53:41,773 INFO L78 Accepts]: Start accepts. Automaton has 9252 states and 10537 transitions. Word has length 274 [2018-09-19 12:53:41,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:53:41,774 INFO L480 AbstractCegarLoop]: Abstraction has 9252 states and 10537 transitions. [2018-09-19 12:53:41,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:53:41,774 INFO L276 IsEmpty]: Start isEmpty. Operand 9252 states and 10537 transitions. [2018-09-19 12:53:41,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-09-19 12:53:41,781 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:53:41,781 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-09-19 12:53:41,781 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:53:41,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1294773578, now seen corresponding path program 1 times [2018-09-19 12:53:41,782 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:53:41,782 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 317 with the following transitions: [2018-09-19 12:53:41,783 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2871], [2873], [2876], [2884], [2892], [2900], [2908], [2916], [2924], [2932], [2940], [2948], [2956], [2964], [2972], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3159], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3237], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3265], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-09-19 12:53:41,785 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:53:41,785 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:53:41,937 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:53:43,024 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:53:43,025 INFO L272 AbstractInterpreter]: Visited 110 different actions 647 times. Merged at 8 different actions 42 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-19 12:53:43,039 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:53:43,553 INFO L232 lantSequenceWeakener]: Weakened 313 states. On average, predicates are now at 71.1% of their original sizes. [2018-09-19 12:53:43,553 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:53:43,661 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:53:43,661 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:53:43,661 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:53:43,662 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:53:43,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:53:43,662 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:53:43,663 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:53:43,663 INFO L87 Difference]: Start difference. First operand 9252 states and 10537 transitions. Second operand 10 states. [2018-09-19 12:53:56,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:53:56,906 INFO L93 Difference]: Finished difference Result 15294 states and 18522 transitions. [2018-09-19 12:53:56,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 12:53:56,907 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 316 [2018-09-19 12:53:56,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:53:56,930 INFO L225 Difference]: With dead ends: 15294 [2018-09-19 12:53:56,930 INFO L226 Difference]: Without dead ends: 10085 [2018-09-19 12:53:56,942 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 322 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:53:56,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10085 states. [2018-09-19 12:53:57,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10085 to 10061. [2018-09-19 12:53:57,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10061 states. [2018-09-19 12:53:57,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10061 states to 10061 states and 11413 transitions. [2018-09-19 12:53:57,089 INFO L78 Accepts]: Start accepts. Automaton has 10061 states and 11413 transitions. Word has length 316 [2018-09-19 12:53:57,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:53:57,090 INFO L480 AbstractCegarLoop]: Abstraction has 10061 states and 11413 transitions. [2018-09-19 12:53:57,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:53:57,090 INFO L276 IsEmpty]: Start isEmpty. Operand 10061 states and 11413 transitions. [2018-09-19 12:53:57,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-09-19 12:53:57,097 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:53:57,097 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 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] [2018-09-19 12:53:57,098 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:53:57,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1051225654, now seen corresponding path program 1 times [2018-09-19 12:53:57,098 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:53:57,098 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 327 with the following transitions: [2018-09-19 12:53:57,099 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2871], [2873], [2876], [2884], [2892], [2900], [2908], [2916], [2924], [2932], [2940], [2948], [2956], [2964], [2972], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3151], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3265], [3266], [3270], [3274], [3278], [3282], [3285], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-09-19 12:53:57,101 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:53:57,101 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:53:57,251 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:53:57,902 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:53:57,903 INFO L272 AbstractInterpreter]: Visited 115 different actions 675 times. Merged at 8 different actions 40 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-19 12:53:57,940 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:53:58,373 INFO L232 lantSequenceWeakener]: Weakened 323 states. On average, predicates are now at 71.1% of their original sizes. [2018-09-19 12:53:58,374 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:53:58,477 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:53:58,477 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:53:58,477 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:53:58,478 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:53:58,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:53:58,478 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:53:58,478 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:53:58,479 INFO L87 Difference]: Start difference. First operand 10061 states and 11413 transitions. Second operand 10 states. [2018-09-19 12:54:11,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:54:11,570 INFO L93 Difference]: Finished difference Result 17756 states and 21202 transitions. [2018-09-19 12:54:11,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:54:11,570 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 326 [2018-09-19 12:54:11,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:54:11,597 INFO L225 Difference]: With dead ends: 17756 [2018-09-19 12:54:11,598 INFO L226 Difference]: Without dead ends: 11734 [2018-09-19 12:54:11,611 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 333 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:54:11,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11734 states. [2018-09-19 12:54:11,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11734 to 11704. [2018-09-19 12:54:11,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11704 states. [2018-09-19 12:54:11,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11704 states to 11704 states and 13240 transitions. [2018-09-19 12:54:11,818 INFO L78 Accepts]: Start accepts. Automaton has 11704 states and 13240 transitions. Word has length 326 [2018-09-19 12:54:11,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:54:11,818 INFO L480 AbstractCegarLoop]: Abstraction has 11704 states and 13240 transitions. [2018-09-19 12:54:11,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:54:11,819 INFO L276 IsEmpty]: Start isEmpty. Operand 11704 states and 13240 transitions. [2018-09-19 12:54:11,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-09-19 12:54:11,827 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:54:11,827 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-09-19 12:54:11,827 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:54:11,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1858079331, now seen corresponding path program 1 times [2018-09-19 12:54:11,828 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:54:11,828 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 342 with the following transitions: [2018-09-19 12:54:11,828 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2871], [2873], [2876], [2884], [2892], [2900], [2908], [2916], [2924], [2932], [2940], [2948], [2956], [2964], [2972], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3210], [3213], [3217], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3265], [3266], [3270], [3274], [3278], [3282], [3285], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-09-19 12:54:11,831 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:54:11,831 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:54:12,194 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:54:12,537 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:54:12,537 INFO L272 AbstractInterpreter]: Visited 117 different actions 679 times. Merged at 8 different actions 40 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 2 different actions. Largest state had 26 variables. [2018-09-19 12:54:12,572 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:54:13,073 INFO L232 lantSequenceWeakener]: Weakened 338 states. On average, predicates are now at 71.15% of their original sizes. [2018-09-19 12:54:13,073 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:54:13,985 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:54:13,986 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:54:13,986 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 12:54:13,986 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:54:13,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 12:54:13,986 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 12:54:13,987 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-09-19 12:54:13,987 INFO L87 Difference]: Start difference. First operand 11704 states and 13240 transitions. Second operand 12 states. [2018-09-19 12:54:52,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:54:52,327 INFO L93 Difference]: Finished difference Result 22751 states and 29077 transitions. [2018-09-19 12:54:52,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-19 12:54:52,328 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 341 [2018-09-19 12:54:52,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:54:52,380 INFO L225 Difference]: With dead ends: 22751 [2018-09-19 12:54:52,380 INFO L226 Difference]: Without dead ends: 15901 [2018-09-19 12:54:52,394 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 366 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=220, Invalid=1186, Unknown=0, NotChecked=0, Total=1406 [2018-09-19 12:54:52,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15901 states. [2018-09-19 12:54:52,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15901 to 15812. [2018-09-19 12:54:52,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15812 states. [2018-09-19 12:54:52,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15812 states to 15812 states and 18058 transitions. [2018-09-19 12:54:52,614 INFO L78 Accepts]: Start accepts. Automaton has 15812 states and 18058 transitions. Word has length 341 [2018-09-19 12:54:52,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:54:52,615 INFO L480 AbstractCegarLoop]: Abstraction has 15812 states and 18058 transitions. [2018-09-19 12:54:52,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 12:54:52,616 INFO L276 IsEmpty]: Start isEmpty. Operand 15812 states and 18058 transitions. [2018-09-19 12:54:52,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-09-19 12:54:52,624 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:54:52,624 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:54:52,624 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:54:52,625 INFO L82 PathProgramCache]: Analyzing trace with hash 750889134, now seen corresponding path program 1 times [2018-09-19 12:54:52,625 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:54:52,625 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 345 with the following transitions: [2018-09-19 12:54:52,625 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2871], [2873], [2876], [2884], [2892], [2900], [2908], [2916], [2924], [2932], [2940], [2948], [2956], [2964], [2972], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3237], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3265], [3266], [3270], [3274], [3278], [3282], [3285], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-09-19 12:54:52,628 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:54:52,628 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:54:52,760 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:54:53,115 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:54:53,116 INFO L272 AbstractInterpreter]: Visited 115 different actions 680 times. Merged at 8 different actions 45 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 2 different actions. Largest state had 26 variables. [2018-09-19 12:54:53,165 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:54:53,680 INFO L232 lantSequenceWeakener]: Weakened 341 states. On average, predicates are now at 71.08% of their original sizes. [2018-09-19 12:54:53,681 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:54:53,977 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:54:53,977 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:54:53,977 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:54:53,978 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:54:53,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:54:53,979 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:54:53,979 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:54:53,979 INFO L87 Difference]: Start difference. First operand 15812 states and 18058 transitions. Second operand 10 states. [2018-09-19 12:55:07,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:55:07,337 INFO L93 Difference]: Finished difference Result 27654 states and 32817 transitions. [2018-09-19 12:55:07,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:55:07,338 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 344 [2018-09-19 12:55:07,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:55:07,365 INFO L225 Difference]: With dead ends: 27654 [2018-09-19 12:55:07,365 INFO L226 Difference]: Without dead ends: 16696 [2018-09-19 12:55:07,385 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 351 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:55:07,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16696 states. [2018-09-19 12:55:07,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16696 to 16645. [2018-09-19 12:55:07,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16645 states. [2018-09-19 12:55:07,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16645 states to 16645 states and 19107 transitions. [2018-09-19 12:55:07,604 INFO L78 Accepts]: Start accepts. Automaton has 16645 states and 19107 transitions. Word has length 344 [2018-09-19 12:55:07,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:55:07,605 INFO L480 AbstractCegarLoop]: Abstraction has 16645 states and 19107 transitions. [2018-09-19 12:55:07,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:55:07,605 INFO L276 IsEmpty]: Start isEmpty. Operand 16645 states and 19107 transitions. [2018-09-19 12:55:07,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-09-19 12:55:07,613 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:55:07,614 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:55:07,614 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:55:07,614 INFO L82 PathProgramCache]: Analyzing trace with hash 622962802, now seen corresponding path program 1 times [2018-09-19 12:55:07,614 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:55:07,615 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 347 with the following transitions: [2018-09-19 12:55:07,615 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2871], [2873], [2876], [2884], [2892], [2900], [2908], [2916], [2924], [2932], [2940], [2948], [2956], [2964], [2972], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3245], [3246], [3250], [3254], [3258], [3262], [3265], [3266], [3270], [3274], [3278], [3282], [3285], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-09-19 12:55:07,617 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:55:07,617 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:55:07,751 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-09-19 12:55:11,125 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-19 12:55:11,126 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-19 12:55:11,127 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 12:55:11,177 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 12:55:11,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 12:55:11 BoogieIcfgContainer [2018-09-19 12:55:11,177 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 12:55:11,178 INFO L168 Benchmark]: Toolchain (without parser) took 237523.28 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 3.2 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-09-19 12:55:11,180 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 12:55:11,181 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2688.31 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 338.2 MB). Peak memory consumption was 338.2 MB. Max. memory is 7.1 GB. [2018-09-19 12:55:11,181 INFO L168 Benchmark]: Boogie Procedure Inliner took 329.74 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-19 12:55:11,182 INFO L168 Benchmark]: Boogie Preprocessor took 1163.52 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 1.0 GB). Free memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 174.3 MB. Max. memory is 7.1 GB. [2018-09-19 12:55:11,183 INFO L168 Benchmark]: RCFGBuilder took 10279.42 ms. Allocated memory was 2.5 GB in the beginning and 2.7 GB in the end (delta: 159.9 MB). Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: -2.6 MB). Peak memory consumption was 749.4 MB. Max. memory is 7.1 GB. [2018-09-19 12:55:11,184 INFO L168 Benchmark]: TraceAbstraction took 223052.86 ms. Allocated memory was 2.7 GB in the beginning and 4.0 GB in the end (delta: 1.3 GB). Free memory was 2.3 GB in the beginning and 3.2 GB in the end (delta: -810.4 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-09-19 12:55:11,189 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2688.31 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 338.2 MB). Peak memory consumption was 338.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 329.74 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 1163.52 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 1.0 GB). Free memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 174.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 10279.42 ms. Allocated memory was 2.5 GB in the beginning and 2.7 GB in the end (delta: 159.9 MB). Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: -2.6 MB). Peak memory consumption was 749.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 223052.86 ms. Allocated memory was 2.7 GB in the beginning and 4.0 GB in the end (delta: 1.3 GB). Free memory was 2.3 GB in the beginning and 3.2 GB in the end (delta: -810.4 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 120]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L10] int inputB = 2; [L11] int inputE = 5; [L12] int inputC = 3; [L13] int inputD = 4; [L14] int inputF = 6; [L17] int a26 = 1; [L18] int a13 = 0; [L19] int a19 = 9; [L20] int a23 = 158; [L21] int a12 = 286; [L22] int a1 = 2; [L5803] int output = -1; [L5806] COND TRUE 1 [L5809] int input; [L5810] input = __VERIFIER_nondet_int() [L5811] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L5814] CALL, EXPR calculate_output(input) [L29] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L32] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L35] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L38] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L41] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L44] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L47] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L50] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L53] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L56] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L59] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L62] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L65] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L68] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L71] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L74] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L77] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L80] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L83] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L86] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L89] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L92] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L95] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L98] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L101] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L104] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L107] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L110] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L113] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L116] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L119] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L122] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L125] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L128] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L131] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L134] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L137] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L140] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L143] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L146] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L149] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L152] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L155] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L158] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L161] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L164] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L167] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L170] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L173] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L176] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L179] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L182] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L185] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L188] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L191] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L194] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L197] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L200] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L203] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L206] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L209] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L213] COND FALSE !(((a26==1) && (((((input == 5) && ((( ((264 < a23) && (476 >= a23)) && (a19==10)) || ( 476 < a23 && (a19==10))) || ( a23 <= 95 && (a19==11)))) && ((178 < a12) && (395 >= a12)) ) && (a1==3)) && (a13==1)))) [L221] COND FALSE !(((a19==13) && ( ((395 < a12) && (441 >= a12)) && ((a1==3) && ((a26==1) && (((input == 4) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a13==1))))))) [L229] COND FALSE !(((((a1==2) && (((input == 2) && (((a19==12) && a23 <= 95 ) || (((a19==11) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==11))))) && !(a13==1))) && 441 < a12 ) && (a26==1))) [L236] COND FALSE !((((a26==1) && (((a13==1) && ((input == 2) && (( a23 <= 95 && (a19==13)) || (((a19==12) && ((264 < a23) && (476 >= a23)) ) || ((a19==12) && 476 < a23 ))))) && a12 <= 178 )) && (a1==3))) [L243] COND FALSE !(((((a26==1) && (((a19==11) && ((a1==2) && (input == 6))) && 441 < a12 )) && (a13==1)) && ((95 < a23) && (264 >= a23)) )) [L251] COND FALSE !(( a12 <= 178 && (!(a13==1) && ((a26==1) && (((input == 2) && (((a19==13) && a23 <= 95 ) || (( ((264 < a23) && (476 >= a23)) && (a19==12)) || ((a19==12) && 476 < a23 )))) && (a1==3)))))) [L262] COND FALSE !((((((a1==2) && (((( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 )) || ( ((95 < a23) && (264 >= a23)) && (a19==11))) && (input == 3))) && ((395 < a12) && (441 >= a12)) ) && (a26==1)) && !(a13==1))) [L269] COND FALSE !(( ((178 < a12) && (395 >= a12)) && ((a26==1) && (((a19==9) && (((input == 6) && (a13==1)) && (a1==3))) && 476 < a23 )))) [L275] COND FALSE !((( ((95 < a23) && (264 >= a23)) && ((!(a13==1) && ((a19==11) && ((a26==1) && (input == 4)))) && ((178 < a12) && (395 >= a12)) )) && (a1==2))) [L279] COND FALSE !(((a26==1) && (((((a19==13) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 6))) && a12 <= 178 ) && !(a13==1)) && (a1==3)))) [L285] COND FALSE !(((((a26==1) && (( 441 < a12 && (!(a13==1) && (input == 2))) && ((95 < a23) && (264 >= a23)) )) && (a1==3)) && (a19==13))) [L292] COND FALSE !(((a19==13) && ((((a1==3) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3)) && 441 < a12 )) && (a26==1)) && !(a13==1)))) [L308] COND FALSE !(((a19==11) && ((a26==1) && (( 476 < a23 && ( ((395 < a12) && (441 >= a12)) && ((a1==3) && (input == 2)))) && !(a13==1))))) [L315] COND FALSE !(((a1==3) && ((a26==1) && ((((a19==13) && ((input == 3) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) ))) && ((178 < a12) && (395 >= a12)) ) && !(a13==1))))) [L321] COND FALSE !(((a26==1) && (((((((a19==11) && ((95 < a23) && (264 >= a23)) ) || (( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 ))) && (input == 6)) && !(a13==1)) && ((395 < a12) && (441 >= a12)) ) && (a1==3)))) [L327] COND FALSE !((((a19==10) && (((((input == 2) && ((178 < a12) && (395 >= a12)) ) && a23 <= 95 ) && (a13==1)) && (a1==3))) && (a26==1))) [L330] COND FALSE !(((((a1==2) && (((a26==1) && ((input == 2) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 ))) && 441 < a12 )) && (a13==1)) && (a19==13))) [L337] COND FALSE !(((((((a1==2) && (!(a13==1) && (input == 6))) && (a19==12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && ((178 < a12) && (395 >= a12)) )) [L342] COND FALSE !(((a26==1) && (((( ((395 < a12) && (441 >= a12)) && ((input == 5) && (a19==11))) && (a13==1)) && (a1==3)) && ((264 < a23) && (476 >= a23)) ))) [L350] COND FALSE !(((a13==1) && ((( 441 < a12 && ((input == 6) && ((( 476 < a23 && (a19==9)) || ( a23 <= 95 && (a19==10))) || ( ((95 < a23) && (264 >= a23)) && (a19==10))))) && (a26==1)) && (a1==2)))) [L365] COND FALSE !(( ((264 < a23) && (476 >= a23)) && ((a26==1) && ((!(a13==1) && ((a1==3) && ((input == 3) && (a19==10)))) && a12 <= 178 )))) [L372] COND FALSE !(((((a1==3) && ((((( ((264 < a23) && (476 >= a23)) && (a19==13)) && (a13==1)) || ((a13==1) && ( 476 < a23 && (a19==13)))) || (((a19==9) && a23 <= 95 ) && !(a13==1))) && (input == 2))) && ((395 < a12) && (441 >= a12)) ) && (a26==1))) [L379] COND FALSE !(((a19==13) && (((a13==1) && ((a1==2) && ((a26==1) && (( ((264 < a23) && (476 >= a23)) || ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (input == 5))))) && ((395 < a12) && (441 >= a12)) ))) [L387] COND FALSE !(((a26==1) && (((((a19==13) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 4))) && (a13==1)) && (a1==3)) && ((178 < a12) && (395 >= a12)) ))) [L393] COND FALSE !((!(a13==1) && ((a26==1) && (( ((178 < a12) && (395 >= a12)) && ((((a19==10) && ((95 < a23) && (264 >= a23)) ) || (((a19==9) && 476 < a23 ) || ( a23 <= 95 && (a19==10)))) && (input == 3))) && (a1==2))))) [L398] COND FALSE !((( 441 < a12 && ((a1==3) && ((a19==12) && (((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && (a13==1))))) && (a26==1))) [L404] COND FALSE !(((a13==1) && ((( ((395 < a12) && (441 >= a12)) && (((( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9))) || ((a19==10) && a23 <= 95 )) && (input == 5))) && (a26==1)) && (a1==2)))) [L411] COND FALSE !((((a1==3) && ((a19==9) && ( ((395 < a12) && (441 >= a12)) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 5)) && !(a13==1))))) && (a26==1))) [L417] COND FALSE !((( ((395 < a12) && (441 >= a12)) && ((a19==11) && ((a13==1) && (((input == 5) && (a1==3)) && 476 < a23 )))) && (a26==1))) [L423] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((!(a13==1) && (((((a19==12) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==12))) || ( a23 <= 95 && (a19==13))) && (input == 4))) && (a1==2)) && (a26==1)))) [L430] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((a26==1) && ((a1==2) && (!(a13==1) && ((a19==10) && ((input == 2) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )))))))) [L436] COND TRUE ((a26==1) && ((((((input == 6) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && !(a13==1)) && (a19==9)) && (a1==2)) && ((178 < a12) && (395 >= a12)) )) [L437] a23 = (((a23 + 74530) * 5) * 1) [L438] a19 = 10 [L440] RET return 22; [L5814] EXPR calculate_output(input) [L5814] output = calculate_output(input) [L5806] COND TRUE 1 [L5809] int input; [L5810] input = __VERIFIER_nondet_int() [L5811] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L5814] CALL, EXPR calculate_output(input) [L29] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L32] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L35] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L38] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L41] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L44] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L47] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L50] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L53] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L56] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L59] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L62] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L65] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L68] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L71] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L74] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L77] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L80] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L83] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L86] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L89] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L92] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L95] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L98] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L101] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L104] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L107] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L110] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L113] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L116] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L119] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L122] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L125] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L128] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L131] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L134] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L137] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L140] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L143] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L146] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L149] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L152] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L155] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L158] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L161] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L164] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L167] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L170] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L173] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L176] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L179] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L182] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L185] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L188] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L191] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L194] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L197] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L200] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L203] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L206] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L209] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L213] COND FALSE !(((a26==1) && (((((input == 5) && ((( ((264 < a23) && (476 >= a23)) && (a19==10)) || ( 476 < a23 && (a19==10))) || ( a23 <= 95 && (a19==11)))) && ((178 < a12) && (395 >= a12)) ) && (a1==3)) && (a13==1)))) [L221] COND FALSE !(((a19==13) && ( ((395 < a12) && (441 >= a12)) && ((a1==3) && ((a26==1) && (((input == 4) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a13==1))))))) [L229] COND FALSE !(((((a1==2) && (((input == 2) && (((a19==12) && a23 <= 95 ) || (((a19==11) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==11))))) && !(a13==1))) && 441 < a12 ) && (a26==1))) [L236] COND FALSE !((((a26==1) && (((a13==1) && ((input == 2) && (( a23 <= 95 && (a19==13)) || (((a19==12) && ((264 < a23) && (476 >= a23)) ) || ((a19==12) && 476 < a23 ))))) && a12 <= 178 )) && (a1==3))) [L243] COND FALSE !(((((a26==1) && (((a19==11) && ((a1==2) && (input == 6))) && 441 < a12 )) && (a13==1)) && ((95 < a23) && (264 >= a23)) )) [L251] COND FALSE !(( a12 <= 178 && (!(a13==1) && ((a26==1) && (((input == 2) && (((a19==13) && a23 <= 95 ) || (( ((264 < a23) && (476 >= a23)) && (a19==12)) || ((a19==12) && 476 < a23 )))) && (a1==3)))))) [L262] COND FALSE !((((((a1==2) && (((( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 )) || ( ((95 < a23) && (264 >= a23)) && (a19==11))) && (input == 3))) && ((395 < a12) && (441 >= a12)) ) && (a26==1)) && !(a13==1))) [L269] COND FALSE !(( ((178 < a12) && (395 >= a12)) && ((a26==1) && (((a19==9) && (((input == 6) && (a13==1)) && (a1==3))) && 476 < a23 )))) [L275] COND FALSE !((( ((95 < a23) && (264 >= a23)) && ((!(a13==1) && ((a19==11) && ((a26==1) && (input == 4)))) && ((178 < a12) && (395 >= a12)) )) && (a1==2))) [L279] COND FALSE !(((a26==1) && (((((a19==13) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 6))) && a12 <= 178 ) && !(a13==1)) && (a1==3)))) [L285] COND FALSE !(((((a26==1) && (( 441 < a12 && (!(a13==1) && (input == 2))) && ((95 < a23) && (264 >= a23)) )) && (a1==3)) && (a19==13))) [L292] COND FALSE !(((a19==13) && ((((a1==3) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3)) && 441 < a12 )) && (a26==1)) && !(a13==1)))) [L308] COND FALSE !(((a19==11) && ((a26==1) && (( 476 < a23 && ( ((395 < a12) && (441 >= a12)) && ((a1==3) && (input == 2)))) && !(a13==1))))) [L315] COND FALSE !(((a1==3) && ((a26==1) && ((((a19==13) && ((input == 3) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) ))) && ((178 < a12) && (395 >= a12)) ) && !(a13==1))))) [L321] COND FALSE !(((a26==1) && (((((((a19==11) && ((95 < a23) && (264 >= a23)) ) || (( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 ))) && (input == 6)) && !(a13==1)) && ((395 < a12) && (441 >= a12)) ) && (a1==3)))) [L327] COND FALSE !((((a19==10) && (((((input == 2) && ((178 < a12) && (395 >= a12)) ) && a23 <= 95 ) && (a13==1)) && (a1==3))) && (a26==1))) [L330] COND FALSE !(((((a1==2) && (((a26==1) && ((input == 2) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 ))) && 441 < a12 )) && (a13==1)) && (a19==13))) [L337] COND FALSE !(((((((a1==2) && (!(a13==1) && (input == 6))) && (a19==12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && ((178 < a12) && (395 >= a12)) )) [L342] COND FALSE !(((a26==1) && (((( ((395 < a12) && (441 >= a12)) && ((input == 5) && (a19==11))) && (a13==1)) && (a1==3)) && ((264 < a23) && (476 >= a23)) ))) [L350] COND FALSE !(((a13==1) && ((( 441 < a12 && ((input == 6) && ((( 476 < a23 && (a19==9)) || ( a23 <= 95 && (a19==10))) || ( ((95 < a23) && (264 >= a23)) && (a19==10))))) && (a26==1)) && (a1==2)))) [L365] COND FALSE !(( ((264 < a23) && (476 >= a23)) && ((a26==1) && ((!(a13==1) && ((a1==3) && ((input == 3) && (a19==10)))) && a12 <= 178 )))) [L372] COND FALSE !(((((a1==3) && ((((( ((264 < a23) && (476 >= a23)) && (a19==13)) && (a13==1)) || ((a13==1) && ( 476 < a23 && (a19==13)))) || (((a19==9) && a23 <= 95 ) && !(a13==1))) && (input == 2))) && ((395 < a12) && (441 >= a12)) ) && (a26==1))) [L379] COND FALSE !(((a19==13) && (((a13==1) && ((a1==2) && ((a26==1) && (( ((264 < a23) && (476 >= a23)) || ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (input == 5))))) && ((395 < a12) && (441 >= a12)) ))) [L387] COND FALSE !(((a26==1) && (((((a19==13) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 4))) && (a13==1)) && (a1==3)) && ((178 < a12) && (395 >= a12)) ))) [L393] COND FALSE !((!(a13==1) && ((a26==1) && (( ((178 < a12) && (395 >= a12)) && ((((a19==10) && ((95 < a23) && (264 >= a23)) ) || (((a19==9) && 476 < a23 ) || ( a23 <= 95 && (a19==10)))) && (input == 3))) && (a1==2))))) [L398] COND FALSE !((( 441 < a12 && ((a1==3) && ((a19==12) && (((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && (a13==1))))) && (a26==1))) [L404] COND FALSE !(((a13==1) && ((( ((395 < a12) && (441 >= a12)) && (((( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9))) || ((a19==10) && a23 <= 95 )) && (input == 5))) && (a26==1)) && (a1==2)))) [L411] COND FALSE !((((a1==3) && ((a19==9) && ( ((395 < a12) && (441 >= a12)) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 5)) && !(a13==1))))) && (a26==1))) [L417] COND FALSE !((( ((395 < a12) && (441 >= a12)) && ((a19==11) && ((a13==1) && (((input == 5) && (a1==3)) && 476 < a23 )))) && (a26==1))) [L423] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((!(a13==1) && (((((a19==12) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==12))) || ( a23 <= 95 && (a19==13))) && (input == 4))) && (a1==2)) && (a26==1)))) [L430] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((a26==1) && ((a1==2) && (!(a13==1) && ((a19==10) && ((input == 2) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )))))))) [L436] COND FALSE !(((a26==1) && ((((((input == 6) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && !(a13==1)) && (a19==9)) && (a1==2)) && ((178 < a12) && (395 >= a12)) ))) [L441] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((a1==2) && ((a26==1) && ((input == 4) && ((( 476 < a23 && (a19==10)) || ( a23 <= 95 && (a19==11))) || ( ((95 < a23) && (264 >= a23)) && (a19==11)))))) && !(a13==1)))) [L448] COND FALSE !(((a26==1) && (((((a1==2) && ((input == 2) && ((395 < a12) && (441 >= a12)) )) && (a19==13)) && !(a13==1)) && ((95 < a23) && (264 >= a23)) ))) [L455] COND FALSE !(( 441 < a12 && ((a13==1) && ((a26==1) && (( ((95 < a23) && (264 >= a23)) && ((input == 2) && (a19==11))) && (a1==2)))))) [L462] COND FALSE !(((((((a13==1) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 6))) && (a1==2)) && (a19==9)) && 441 < a12 ) && (a26==1))) [L469] COND TRUE ( ((178 < a12) && (395 >= a12)) && ((a19==10) && ( ((264 < a23) && (476 >= a23)) && (((!(a13==1) && (input == 3)) && (a26==1)) && (a1==2))))) [L470] a12 = (((a12 + 17844) / 5) + -3206) [L471] a23 = ((((a23 / -5) - 10205) + 138848) * -4) [L472] a19 = 9 [L473] a13 = 1 [L475] RET return 24; [L5814] EXPR calculate_output(input) [L5814] output = calculate_output(input) [L5806] COND TRUE 1 [L5809] int input; [L5810] input = __VERIFIER_nondet_int() [L5811] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L5814] CALL, EXPR calculate_output(input) [L29] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L32] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L35] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L38] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L41] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L44] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L47] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L50] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L53] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L56] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L59] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L62] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L65] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L68] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L71] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L74] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L77] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L80] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L83] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L86] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L89] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L92] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L95] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L98] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L101] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L104] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L107] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L110] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L113] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L116] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L119] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L122] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L125] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L128] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L131] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L134] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L137] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L140] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L143] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L146] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L149] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L152] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L155] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L158] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L161] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L164] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L167] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L170] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L173] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L176] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L179] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L182] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L185] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L188] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L191] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L194] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L197] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L200] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L203] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L206] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L209] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L213] COND FALSE !(((a26==1) && (((((input == 5) && ((( ((264 < a23) && (476 >= a23)) && (a19==10)) || ( 476 < a23 && (a19==10))) || ( a23 <= 95 && (a19==11)))) && ((178 < a12) && (395 >= a12)) ) && (a1==3)) && (a13==1)))) [L221] COND FALSE !(((a19==13) && ( ((395 < a12) && (441 >= a12)) && ((a1==3) && ((a26==1) && (((input == 4) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a13==1))))))) [L229] COND FALSE !(((((a1==2) && (((input == 2) && (((a19==12) && a23 <= 95 ) || (((a19==11) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==11))))) && !(a13==1))) && 441 < a12 ) && (a26==1))) [L236] COND FALSE !((((a26==1) && (((a13==1) && ((input == 2) && (( a23 <= 95 && (a19==13)) || (((a19==12) && ((264 < a23) && (476 >= a23)) ) || ((a19==12) && 476 < a23 ))))) && a12 <= 178 )) && (a1==3))) [L243] COND FALSE !(((((a26==1) && (((a19==11) && ((a1==2) && (input == 6))) && 441 < a12 )) && (a13==1)) && ((95 < a23) && (264 >= a23)) )) [L251] COND FALSE !(( a12 <= 178 && (!(a13==1) && ((a26==1) && (((input == 2) && (((a19==13) && a23 <= 95 ) || (( ((264 < a23) && (476 >= a23)) && (a19==12)) || ((a19==12) && 476 < a23 )))) && (a1==3)))))) [L262] COND FALSE !((((((a1==2) && (((( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 )) || ( ((95 < a23) && (264 >= a23)) && (a19==11))) && (input == 3))) && ((395 < a12) && (441 >= a12)) ) && (a26==1)) && !(a13==1))) [L269] COND FALSE !(( ((178 < a12) && (395 >= a12)) && ((a26==1) && (((a19==9) && (((input == 6) && (a13==1)) && (a1==3))) && 476 < a23 )))) [L275] COND FALSE !((( ((95 < a23) && (264 >= a23)) && ((!(a13==1) && ((a19==11) && ((a26==1) && (input == 4)))) && ((178 < a12) && (395 >= a12)) )) && (a1==2))) [L279] COND FALSE !(((a26==1) && (((((a19==13) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 6))) && a12 <= 178 ) && !(a13==1)) && (a1==3)))) [L285] COND FALSE !(((((a26==1) && (( 441 < a12 && (!(a13==1) && (input == 2))) && ((95 < a23) && (264 >= a23)) )) && (a1==3)) && (a19==13))) [L292] COND FALSE !(((a19==13) && ((((a1==3) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3)) && 441 < a12 )) && (a26==1)) && !(a13==1)))) [L308] COND FALSE !(((a19==11) && ((a26==1) && (( 476 < a23 && ( ((395 < a12) && (441 >= a12)) && ((a1==3) && (input == 2)))) && !(a13==1))))) [L315] COND FALSE !(((a1==3) && ((a26==1) && ((((a19==13) && ((input == 3) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) ))) && ((178 < a12) && (395 >= a12)) ) && !(a13==1))))) [L321] COND FALSE !(((a26==1) && (((((((a19==11) && ((95 < a23) && (264 >= a23)) ) || (( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 ))) && (input == 6)) && !(a13==1)) && ((395 < a12) && (441 >= a12)) ) && (a1==3)))) [L327] COND FALSE !((((a19==10) && (((((input == 2) && ((178 < a12) && (395 >= a12)) ) && a23 <= 95 ) && (a13==1)) && (a1==3))) && (a26==1))) [L330] COND FALSE !(((((a1==2) && (((a26==1) && ((input == 2) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 ))) && 441 < a12 )) && (a13==1)) && (a19==13))) [L337] COND FALSE !(((((((a1==2) && (!(a13==1) && (input == 6))) && (a19==12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && ((178 < a12) && (395 >= a12)) )) [L342] COND FALSE !(((a26==1) && (((( ((395 < a12) && (441 >= a12)) && ((input == 5) && (a19==11))) && (a13==1)) && (a1==3)) && ((264 < a23) && (476 >= a23)) ))) [L350] COND FALSE !(((a13==1) && ((( 441 < a12 && ((input == 6) && ((( 476 < a23 && (a19==9)) || ( a23 <= 95 && (a19==10))) || ( ((95 < a23) && (264 >= a23)) && (a19==10))))) && (a26==1)) && (a1==2)))) [L365] COND FALSE !(( ((264 < a23) && (476 >= a23)) && ((a26==1) && ((!(a13==1) && ((a1==3) && ((input == 3) && (a19==10)))) && a12 <= 178 )))) [L372] COND FALSE !(((((a1==3) && ((((( ((264 < a23) && (476 >= a23)) && (a19==13)) && (a13==1)) || ((a13==1) && ( 476 < a23 && (a19==13)))) || (((a19==9) && a23 <= 95 ) && !(a13==1))) && (input == 2))) && ((395 < a12) && (441 >= a12)) ) && (a26==1))) [L379] COND FALSE !(((a19==13) && (((a13==1) && ((a1==2) && ((a26==1) && (( ((264 < a23) && (476 >= a23)) || ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (input == 5))))) && ((395 < a12) && (441 >= a12)) ))) [L387] COND FALSE !(((a26==1) && (((((a19==13) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 4))) && (a13==1)) && (a1==3)) && ((178 < a12) && (395 >= a12)) ))) [L393] COND FALSE !((!(a13==1) && ((a26==1) && (( ((178 < a12) && (395 >= a12)) && ((((a19==10) && ((95 < a23) && (264 >= a23)) ) || (((a19==9) && 476 < a23 ) || ( a23 <= 95 && (a19==10)))) && (input == 3))) && (a1==2))))) [L398] COND FALSE !((( 441 < a12 && ((a1==3) && ((a19==12) && (((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && (a13==1))))) && (a26==1))) [L404] COND TRUE ((a13==1) && ((( ((395 < a12) && (441 >= a12)) && (((( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9))) || ((a19==10) && a23 <= 95 )) && (input == 5))) && (a26==1)) && (a1==2))) [L405] a12 = (((a12 / 5) - 387260) / 5) [L406] a23 = (((((((a23 * 9)/ 10) % 84)+ 179) * 5) % 84)- -100) [L407] a1 = 3 [L408] a19 = 13 [L410] RET return 24; [L5814] EXPR calculate_output(input) [L5814] output = calculate_output(input) [L5806] COND TRUE 1 [L5809] int input; [L5810] input = __VERIFIER_nondet_int() [L5811] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L5814] CALL calculate_output(input) [L29] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L32] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L35] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L38] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L41] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L44] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L47] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L50] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L53] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L56] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L59] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L62] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L65] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L68] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L71] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L74] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L77] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L80] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L83] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L86] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L89] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L92] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L95] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L98] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L101] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L104] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L107] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L110] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L113] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L116] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L119] COND TRUE ((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1)) [L120] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 1120 locations, 1 error locations. UNKNOWN Result, 222.9s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 201.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13177 SDtfs, 32556 SDslu, 8175 SDs, 0 SdLazy, 117780 SolverSat, 10003 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 173.0s Time, PredicateUnifierStatistics: 22 DeclaredPredicates, 2797 GetRequests, 2618 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16645occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 10.7s AbstIntTime, 12 AbstIntIterations, 11 AbstIntStrong, 0.9973017965869152 AbsIntWeakeningRatio, 0.10872781065088757 AbsIntAvgWeakeningVarsNumRemoved, 23.312869822485208 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 273 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: No data available, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem13_label15_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_12-55-11-205.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem13_label15_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_12-55-11-205.csv Completed graceful shutdown