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_CON-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label56_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 07:51:34,660 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 07:51:34,662 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 07:51:34,675 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 07:51:34,675 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 07:51:34,676 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 07:51:34,677 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 07:51:34,679 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 07:51:34,681 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 07:51:34,682 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 07:51:34,683 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 07:51:34,685 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 07:51:34,686 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 07:51:34,687 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 07:51:34,691 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 07:51:34,692 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 07:51:34,693 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 07:51:34,701 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 07:51:34,706 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 07:51:34,708 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 07:51:34,709 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 07:51:34,713 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 07:51:34,720 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 07:51:34,720 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 07:51:34,720 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 07:51:34,722 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 07:51:34,723 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 07:51:34,723 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 07:51:34,724 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 07:51:34,725 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 07:51:34,726 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 07:51:34,726 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 07:51:34,727 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 07:51:34,727 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 07:51:34,728 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 07:51:34,728 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 07:51:34,729 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf [2018-09-19 07:51:34,744 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 07:51:34,744 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 07:51:34,745 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 07:51:34,746 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 07:51:34,746 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 07:51:34,746 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 07:51:34,746 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 07:51:34,746 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 07:51:34,747 INFO L133 SettingsManager]: * Abstract domain=CongruenceDomain [2018-09-19 07:51:34,747 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 07:51:34,747 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 07:51:34,747 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 07:51:34,747 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-19 07:51:34,748 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 07:51:34,748 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 07:51:34,749 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 07:51:34,749 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 07:51:34,749 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 07:51:34,749 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 07:51:34,751 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 07:51:34,751 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 07:51:34,752 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 07:51:34,752 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 07:51:34,752 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 07:51:34,752 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 07:51:34,753 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 07:51:34,753 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 07:51:34,753 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 07:51:34,753 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 07:51:34,753 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 07:51:34,753 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 07:51:34,754 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 07:51:34,754 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 07:51:34,754 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 07:51:34,754 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 07:51:34,813 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 07:51:34,830 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 07:51:34,836 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 07:51:34,837 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 07:51:34,838 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 07:51:34,839 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label56_true-unreach-call.c [2018-09-19 07:51:35,202 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/242740964/d64fe097817849f8829c09529fcc7bce/FLAGabe10e381 [2018-09-19 07:51:35,693 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 07:51:35,694 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label56_true-unreach-call.c [2018-09-19 07:51:35,728 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/242740964/d64fe097817849f8829c09529fcc7bce/FLAGabe10e381 [2018-09-19 07:51:35,744 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/242740964/d64fe097817849f8829c09529fcc7bce [2018-09-19 07:51:35,756 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 07:51:35,760 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 07:51:35,761 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 07:51:35,761 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 07:51:35,769 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 07:51:35,770 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 07:51:35" (1/1) ... [2018-09-19 07:51:35,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56ecc5dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:51:35, skipping insertion in model container [2018-09-19 07:51:35,774 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 07:51:35" (1/1) ... [2018-09-19 07:51:35,786 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 07:51:37,316 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 07:51:37,336 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 07:51:38,203 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 07:51:38,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:51:38 WrapperNode [2018-09-19 07:51:38,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 07:51:38,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 07:51:38,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 07:51:38,526 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 07:51:38,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:51:38" (1/1) ... [2018-09-19 07:51:38,654 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:51:38" (1/1) ... [2018-09-19 07:51:38,847 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 07:51:38,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 07:51:38,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 07:51:38,848 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 07:51:39,657 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:51:38" (1/1) ... [2018-09-19 07:51:39,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:51:38" (1/1) ... [2018-09-19 07:51:39,700 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:51:38" (1/1) ... [2018-09-19 07:51:39,701 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:51:38" (1/1) ... [2018-09-19 07:51:39,938 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:51:38" (1/1) ... [2018-09-19 07:51:39,984 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:51:38" (1/1) ... [2018-09-19 07:51:40,090 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:51:38" (1/1) ... [2018-09-19 07:51:40,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 07:51:40,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 07:51:40,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 07:51:40,171 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 07:51:40,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:51:38" (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 07:51:40,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 07:51:40,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 07:51:40,233 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-09-19 07:51:40,233 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-09-19 07:51:40,233 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-09-19 07:51:40,233 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-09-19 07:51:40,233 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-09-19 07:51:40,234 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-09-19 07:51:40,234 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 07:51:40,234 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 07:51:40,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 07:51:40,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 07:51:40,235 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 07:51:40,235 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 07:51:50,539 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 07:51:50,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 07:51:50 BoogieIcfgContainer [2018-09-19 07:51:50,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 07:51:50,540 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 07:51:50,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 07:51:50,544 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 07:51:50,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 07:51:35" (1/3) ... [2018-09-19 07:51:50,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@389fff52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 07:51:50, skipping insertion in model container [2018-09-19 07:51:50,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:51:38" (2/3) ... [2018-09-19 07:51:50,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@389fff52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 07:51:50, skipping insertion in model container [2018-09-19 07:51:50,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 07:51:50" (3/3) ... [2018-09-19 07:51:50,548 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label56_true-unreach-call.c [2018-09-19 07:51:50,558 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 07:51:50,567 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 07:51:50,635 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 07:51:50,636 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 07:51:50,636 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 07:51:50,636 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 07:51:50,636 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 07:51:50,636 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 07:51:50,636 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 07:51:50,637 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 07:51:50,637 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 07:51:50,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-09-19 07:51:50,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-19 07:51:50,688 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 07:51:50,689 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 07:51:50,690 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 07:51:50,696 INFO L82 PathProgramCache]: Analyzing trace with hash -460452772, now seen corresponding path program 1 times [2018-09-19 07:51:50,699 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 07:51:50,700 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-09-19 07:51:50,703 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], [2875], [2883], [2891], [2899], [2907], [2915], [2923], [2931], [2939], [2947], [2955], [2963], [2971], [2979], [2987], [2995], [3003], [3007], [3009], [4242], [4246], [4252], [4256], [4269], [4270], [4271], [4273] [2018-09-19 07:51:50,736 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-19 07:51:50,736 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 07:51:50,934 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 07:51:50,936 INFO L272 AbstractInterpreter]: Visited 59 different actions 59 times. Never merged. Never widened. Never found a fixpoint. Largest state had 25 variables. [2018-09-19 07:51:50,982 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 07:51:51,151 INFO L232 lantSequenceWeakener]: Weakened 57 states. On average, predicates are now at 73.18% of their original sizes. [2018-09-19 07:51:51,151 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 07:51:51,300 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 07:51:51,302 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 07:51:51,302 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-19 07:51:51,302 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 07:51:51,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-19 07:51:51,326 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-19 07:51:51,326 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-19 07:51:51,332 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 5 states. [2018-09-19 07:52:09,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 07:52:09,056 INFO L93 Difference]: Finished difference Result 3044 states and 5648 transitions. [2018-09-19 07:52:09,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-19 07:52:09,062 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-09-19 07:52:09,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 07:52:09,094 INFO L225 Difference]: With dead ends: 3044 [2018-09-19 07:52:09,095 INFO L226 Difference]: Without dead ends: 1922 [2018-09-19 07:52:09,106 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-19 07:52:09,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2018-09-19 07:52:09,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1920. [2018-09-19 07:52:09,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1920 states. [2018-09-19 07:52:09,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1920 states and 2831 transitions. [2018-09-19 07:52:09,266 INFO L78 Accepts]: Start accepts. Automaton has 1920 states and 2831 transitions. Word has length 60 [2018-09-19 07:52:09,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 07:52:09,267 INFO L480 AbstractCegarLoop]: Abstraction has 1920 states and 2831 transitions. [2018-09-19 07:52:09,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-19 07:52:09,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 2831 transitions. [2018-09-19 07:52:09,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-09-19 07:52:09,276 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 07:52:09,276 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, 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] [2018-09-19 07:52:09,277 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 07:52:09,277 INFO L82 PathProgramCache]: Analyzing trace with hash 342702768, now seen corresponding path program 1 times [2018-09-19 07:52:09,277 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 07:52:09,277 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 162 with the following transitions: [2018-09-19 07:52:09,278 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], [2875], [2883], [2891], [2899], [2907], [2915], [2923], [2931], [2939], [2947], [2955], [2963], [2971], [2979], [2987], [2995], [3003], [3007], [3009], [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 07:52:09,282 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-19 07:52:09,283 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 07:52:09,405 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 07:52:09,405 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 07:52:09,444 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 07:52:09,579 INFO L232 lantSequenceWeakener]: Weakened 158 states. On average, predicates are now at 71.75% of their original sizes. [2018-09-19 07:52:09,580 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 07:52:10,041 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 07:52:10,042 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 07:52:10,042 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 07:52:10,042 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 07:52:10,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 07:52:10,043 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 07:52:10,043 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-19 07:52:10,044 INFO L87 Difference]: Start difference. First operand 1920 states and 2831 transitions. Second operand 9 states. [2018-09-19 07:52:31,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 07:52:31,410 INFO L93 Difference]: Finished difference Result 3847 states and 6458 transitions. [2018-09-19 07:52:31,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-19 07:52:31,414 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 161 [2018-09-19 07:52:31,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 07:52:31,428 INFO L225 Difference]: With dead ends: 3847 [2018-09-19 07:52:31,429 INFO L226 Difference]: Without dead ends: 2737 [2018-09-19 07:52:31,434 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 166 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-09-19 07:52:31,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2737 states. [2018-09-19 07:52:31,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2737 to 2728. [2018-09-19 07:52:31,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2728 states. [2018-09-19 07:52:31,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2728 states to 2728 states and 3700 transitions. [2018-09-19 07:52:31,495 INFO L78 Accepts]: Start accepts. Automaton has 2728 states and 3700 transitions. Word has length 161 [2018-09-19 07:52:31,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 07:52:31,497 INFO L480 AbstractCegarLoop]: Abstraction has 2728 states and 3700 transitions. [2018-09-19 07:52:31,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 07:52:31,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2728 states and 3700 transitions. [2018-09-19 07:52:31,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-09-19 07:52:31,502 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 07:52:31,502 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, 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] [2018-09-19 07:52:31,503 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 07:52:31,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1221387207, now seen corresponding path program 1 times [2018-09-19 07:52:31,503 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 07:52:31,503 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 191 with the following transitions: [2018-09-19 07:52:31,504 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], [2875], [2883], [2891], [2899], [2907], [2915], [2923], [2931], [2939], [2947], [2955], [2963], [2971], [2979], [2987], [2995], [3003], [3007], [3009], [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 07:52:31,508 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-19 07:52:31,508 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 07:52:31,646 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 07:52:31,646 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 07:52:31,683 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 07:52:31,848 INFO L232 lantSequenceWeakener]: Weakened 187 states. On average, predicates are now at 78.88% of their original sizes. [2018-09-19 07:52:31,849 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 07:52:32,231 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 07:52:32,232 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 07:52:32,232 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 07:52:32,232 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 07:52:32,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 07:52:32,234 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 07:52:32,234 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-19 07:52:32,234 INFO L87 Difference]: Start difference. First operand 2728 states and 3700 transitions. Second operand 9 states. [2018-09-19 07:52:51,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 07:52:51,523 INFO L93 Difference]: Finished difference Result 6811 states and 9921 transitions. [2018-09-19 07:52:51,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 07:52:51,525 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 190 [2018-09-19 07:52:51,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 07:52:51,546 INFO L225 Difference]: With dead ends: 6811 [2018-09-19 07:52:51,546 INFO L226 Difference]: Without dead ends: 4893 [2018-09-19 07:52:51,553 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 196 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-19 07:52:51,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4893 states. [2018-09-19 07:52:51,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4893 to 4873. [2018-09-19 07:52:51,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4873 states. [2018-09-19 07:52:51,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4873 states to 4873 states and 5988 transitions. [2018-09-19 07:52:51,661 INFO L78 Accepts]: Start accepts. Automaton has 4873 states and 5988 transitions. Word has length 190 [2018-09-19 07:52:51,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 07:52:51,662 INFO L480 AbstractCegarLoop]: Abstraction has 4873 states and 5988 transitions. [2018-09-19 07:52:51,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 07:52:51,662 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 5988 transitions. [2018-09-19 07:52:51,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-09-19 07:52:51,668 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 07:52:51,668 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 07:52:51,668 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 07:52:51,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1100432028, now seen corresponding path program 1 times [2018-09-19 07:52:51,669 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 07:52:51,669 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 240 with the following transitions: [2018-09-19 07:52:51,670 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], [2875], [2883], [2891], [2899], [2907], [2915], [2923], [2931], [2939], [2947], [2955], [2963], [2971], [2979], [2987], [2995], [3003], [3007], [3009], [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], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3265], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-09-19 07:52:51,672 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-19 07:52:51,673 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 07:52:51,873 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 07:52:51,873 INFO L272 AbstractInterpreter]: Visited 109 different actions 318 times. Merged at 7 different actions 13 times. Never widened. Found 3 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-19 07:52:51,909 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 07:52:52,153 INFO L232 lantSequenceWeakener]: Weakened 236 states. On average, predicates are now at 75.92% of their original sizes. [2018-09-19 07:52:52,153 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 07:52:52,737 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 07:52:52,737 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 07:52:52,737 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 07:52:52,738 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 07:52:52,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 07:52:52,738 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 07:52:52,739 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-19 07:52:52,739 INFO L87 Difference]: Start difference. First operand 4873 states and 5988 transitions. Second operand 9 states. [2018-09-19 07:53:11,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 07:53:11,886 INFO L93 Difference]: Finished difference Result 9047 states and 12146 transitions. [2018-09-19 07:53:11,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 07:53:11,887 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 239 [2018-09-19 07:53:11,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 07:53:11,919 INFO L225 Difference]: With dead ends: 9047 [2018-09-19 07:53:11,919 INFO L226 Difference]: Without dead ends: 6840 [2018-09-19 07:53:11,928 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 245 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-19 07:53:11,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6840 states. [2018-09-19 07:53:12,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6840 to 6810. [2018-09-19 07:53:12,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6810 states. [2018-09-19 07:53:12,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6810 states to 6810 states and 8212 transitions. [2018-09-19 07:53:12,072 INFO L78 Accepts]: Start accepts. Automaton has 6810 states and 8212 transitions. Word has length 239 [2018-09-19 07:53:12,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 07:53:12,073 INFO L480 AbstractCegarLoop]: Abstraction has 6810 states and 8212 transitions. [2018-09-19 07:53:12,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 07:53:12,073 INFO L276 IsEmpty]: Start isEmpty. Operand 6810 states and 8212 transitions. [2018-09-19 07:53:12,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-09-19 07:53:12,080 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 07:53:12,080 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 07:53:12,081 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 07:53:12,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1755316832, now seen corresponding path program 1 times [2018-09-19 07:53:12,081 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 07:53:12,081 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 270 with the following transitions: [2018-09-19 07:53:12,082 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], [2875], [2883], [2891], [2899], [2907], [2915], [2923], [2931], [2939], [2947], [2955], [2963], [2971], [2979], [2987], [2995], [3003], [3007], [3009], [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], [3293], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-09-19 07:53:12,085 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-19 07:53:12,085 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 07:53:12,208 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 07:53:12,208 INFO L272 AbstractInterpreter]: Visited 117 different actions 452 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 07:53:12,244 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 07:53:12,300 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 07:53:12,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 07:53:12 BoogieIcfgContainer [2018-09-19 07:53:12,301 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 07:53:12,302 INFO L168 Benchmark]: Toolchain (without parser) took 96545.08 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -621.8 MB). Peak memory consumption was 996.7 MB. Max. memory is 7.1 GB. [2018-09-19 07:53:12,305 INFO L168 Benchmark]: CDTParser took 0.19 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 07:53:12,305 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2764.09 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: 339.3 MB). Peak memory consumption was 339.3 MB. Max. memory is 7.1 GB. [2018-09-19 07:53:12,306 INFO L168 Benchmark]: Boogie Procedure Inliner took 321.94 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 07:53:12,308 INFO L168 Benchmark]: Boogie Preprocessor took 1322.71 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.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 174.3 MB. Max. memory is 7.1 GB. [2018-09-19 07:53:12,309 INFO L168 Benchmark]: RCFGBuilder took 10368.85 ms. Allocated memory was 2.5 GB in the beginning and 2.7 GB in the end (delta: 158.9 MB). Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: -18.6 MB). Peak memory consumption was 747.9 MB. Max. memory is 7.1 GB. [2018-09-19 07:53:12,311 INFO L168 Benchmark]: TraceAbstraction took 81760.60 ms. Allocated memory was 2.7 GB in the beginning and 3.2 GB in the end (delta: 451.4 MB). Free memory was 2.4 GB in the beginning and 2.0 GB in the end (delta: 319.6 MB). Peak memory consumption was 771.0 MB. Max. memory is 7.1 GB. [2018-09-19 07:53:12,318 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2764.09 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: 339.3 MB). Peak memory consumption was 339.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 321.94 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 1322.71 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.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 174.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 10368.85 ms. Allocated memory was 2.5 GB in the beginning and 2.7 GB in the end (delta: 158.9 MB). Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: -18.6 MB). Peak memory consumption was 747.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 81760.60 ms. Allocated memory was 2.7 GB in the beginning and 3.2 GB in the end (delta: 451.4 MB). Free memory was 2.4 GB in the beginning and 2.0 GB in the end (delta: 319.6 MB). Peak memory consumption was 771.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 171]: 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 FALSE !(( ((178 < a12) && (395 >= a12)) && ((a19==10) && ( ((264 < a23) && (476 >= a23)) && (((!(a13==1) && (input == 3)) && (a26==1)) && (a1==2)))))) [L476] COND FALSE !((((a1==3) && ( ((178 < a12) && (395 >= a12)) && ((a13==1) && ((a19==12) && ((input == 4) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )))))) && (a26==1))) [L480] COND TRUE ((a19==11) && ((!(a13==1) && ((a26==1) && (((input == 2) && ((178 < a12) && (395 >= a12)) ) && (a1==2)))) && a23 <= 95 )) [L481] a12 = (((((a12 % 22)+ 399) + -3) / 5) - -317) [L482] a23 = ((((((a23 % 105)- -369) - 292738) * 2) % 105)+ 381) [L483] a19 = 13 [L484] a13 = 1 [L486] RET return 26; [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 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 TRUE ((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1)) [L171] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 1120 locations, 1 error locations. UNKNOWN Result, 81.6s OverallTime, 5 OverallIterations, 3 TraceHistogramMax, 77.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4748 SDtfs, 8013 SDslu, 4944 SDs, 0 SdLazy, 47965 SolverSat, 3368 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 67.2s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 666 GetRequests, 622 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6810occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.0s AbstIntTime, 5 AbstIntIterations, 4 AbstIntStrong, 0.9971043598804505 AbsIntWeakeningRatio, 0.13003095975232198 AbsIntAvgWeakeningVarsNumRemoved, 15.386996904024768 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 4 MinimizatonAttempts, 61 StatesRemovedByMinimization, 4 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_label56_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_07-53-12-351.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem13_label56_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_07-53-12-351.csv Received shutdown request...