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_label37_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 12:54:04,936 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 12:54:04,939 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 12:54:04,955 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 12:54:04,956 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 12:54:04,957 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 12:54:04,959 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 12:54:04,961 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 12:54:04,964 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 12:54:04,965 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 12:54:04,967 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 12:54:04,967 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 12:54:04,968 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 12:54:04,969 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 12:54:04,970 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 12:54:04,979 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 12:54:04,981 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 12:54:04,982 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 12:54:04,986 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 12:54:04,988 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 12:54:04,990 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 12:54:04,992 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 12:54:04,994 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 12:54:04,995 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 12:54:04,995 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 12:54:04,996 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 12:54:04,997 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 12:54:04,998 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 12:54:04,999 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 12:54:05,001 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 12:54:05,002 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 12:54:05,004 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 12:54:05,004 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 12:54:05,005 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 12:54:05,006 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 12:54:05,006 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 12:54:05,007 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:54:05,022 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 12:54:05,023 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 12:54:05,024 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 12:54:05,024 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 12:54:05,024 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 12:54:05,024 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 12:54:05,024 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 12:54:05,025 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 12:54:05,025 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-19 12:54:05,025 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 12:54:05,025 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 12:54:05,025 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 12:54:05,026 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 12:54:05,026 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 12:54:05,026 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 12:54:05,027 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 12:54:05,027 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 12:54:05,027 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 12:54:05,027 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 12:54:05,027 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 12:54:05,028 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 12:54:05,028 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 12:54:05,028 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 12:54:05,028 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 12:54:05,028 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 12:54:05,028 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 12:54:05,029 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 12:54:05,029 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 12:54:05,029 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 12:54:05,029 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 12:54:05,029 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 12:54:05,030 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 12:54:05,030 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 12:54:05,030 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 12:54:05,088 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 12:54:05,103 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 12:54:05,112 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 12:54:05,114 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 12:54:05,115 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 12:54:05,115 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label37_true-unreach-call.c [2018-09-19 12:54:05,470 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8af4c4730/55aec29558f84ce18bf088ca67d969a0/FLAGbc508ff2f [2018-09-19 12:54:05,935 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 12:54:05,936 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label37_true-unreach-call.c [2018-09-19 12:54:05,966 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8af4c4730/55aec29558f84ce18bf088ca67d969a0/FLAGbc508ff2f [2018-09-19 12:54:05,983 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8af4c4730/55aec29558f84ce18bf088ca67d969a0 [2018-09-19 12:54:05,994 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 12:54:05,998 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 12:54:05,999 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 12:54:05,999 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 12:54:06,006 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 12:54:06,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 12:54:05" (1/1) ... [2018-09-19 12:54:06,011 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77eb0580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:54:06, skipping insertion in model container [2018-09-19 12:54:06,011 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 12:54:05" (1/1) ... [2018-09-19 12:54:06,024 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 12:54:07,569 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 12:54:07,589 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 12:54:08,299 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 12:54:08,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:54:08 WrapperNode [2018-09-19 12:54:08,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 12:54:08,670 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 12:54:08,670 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 12:54:08,670 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 12:54:08,680 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:54:08" (1/1) ... [2018-09-19 12:54:08,797 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:54:08" (1/1) ... [2018-09-19 12:54:08,984 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 12:54:08,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 12:54:08,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 12:54:08,985 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 12:54:09,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:54:08" (1/1) ... [2018-09-19 12:54:09,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:54:08" (1/1) ... [2018-09-19 12:54:09,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:54:08" (1/1) ... [2018-09-19 12:54:09,858 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:54:08" (1/1) ... [2018-09-19 12:54:10,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:54:08" (1/1) ... [2018-09-19 12:54:10,058 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:54:08" (1/1) ... [2018-09-19 12:54:10,121 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:54:08" (1/1) ... [2018-09-19 12:54:10,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 12:54:10,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 12:54:10,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 12:54:10,185 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 12:54:10,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:54:08" (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:54:10,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 12:54:10,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 12:54:10,258 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-09-19 12:54:10,258 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-09-19 12:54:10,258 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-09-19 12:54:10,258 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-09-19 12:54:10,259 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-09-19 12:54:10,259 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-09-19 12:54:10,259 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 12:54:10,259 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 12:54:10,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 12:54:10,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 12:54:10,260 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 12:54:10,260 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 12:54:20,454 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 12:54:20,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 12:54:20 BoogieIcfgContainer [2018-09-19 12:54:20,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 12:54:20,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 12:54:20,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 12:54:20,459 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 12:54:20,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 12:54:05" (1/3) ... [2018-09-19 12:54:20,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c0bced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 12:54:20, skipping insertion in model container [2018-09-19 12:54:20,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:54:08" (2/3) ... [2018-09-19 12:54:20,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c0bced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 12:54:20, skipping insertion in model container [2018-09-19 12:54:20,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 12:54:20" (3/3) ... [2018-09-19 12:54:20,463 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label37_true-unreach-call.c [2018-09-19 12:54:20,472 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 12:54:20,482 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 12:54:20,543 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 12:54:20,544 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 12:54:20,544 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 12:54:20,544 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 12:54:20,544 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 12:54:20,544 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 12:54:20,544 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 12:54:20,545 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 12:54:20,545 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 12:54:20,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-09-19 12:54:20,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-19 12:54:20,608 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:54:20,609 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, 1] [2018-09-19 12:54:20,610 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:54:20,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1389126997, now seen corresponding path program 1 times [2018-09-19 12:54:20,617 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:54:20,618 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-09-19 12:54:20,621 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], [3011], [3015], [3017], [4242], [4246], [4252], [4256], [4269], [4270], [4271], [4273] [2018-09-19 12:54:20,665 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:54:20,665 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:54:21,041 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:54:21,046 INFO L272 AbstractInterpreter]: Visited 60 different actions 60 times. Never merged. Never widened. Never found a fixpoint. Largest state had 25 variables. [2018-09-19 12:54:21,117 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:54:21,482 INFO L232 lantSequenceWeakener]: Weakened 58 states. On average, predicates are now at 73.16% of their original sizes. [2018-09-19 12:54:21,482 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:54:21,706 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:54:21,708 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:54:21,708 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 12:54:21,708 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:54:21,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 12:54:21,721 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 12:54:21,722 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 12:54:21,725 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 6 states. [2018-09-19 12:54:37,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:54:37,900 INFO L93 Difference]: Finished difference Result 3044 states and 5648 transitions. [2018-09-19 12:54:37,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 12:54:37,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-09-19 12:54:37,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:54:37,934 INFO L225 Difference]: With dead ends: 3044 [2018-09-19 12:54:37,934 INFO L226 Difference]: Without dead ends: 1922 [2018-09-19 12:54:37,947 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 60 GetRequests, 56 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:54:37,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2018-09-19 12:54:38,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1920. [2018-09-19 12:54:38,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1920 states. [2018-09-19 12:54:38,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1920 states and 2831 transitions. [2018-09-19 12:54:38,123 INFO L78 Accepts]: Start accepts. Automaton has 1920 states and 2831 transitions. Word has length 61 [2018-09-19 12:54:38,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:54:38,123 INFO L480 AbstractCegarLoop]: Abstraction has 1920 states and 2831 transitions. [2018-09-19 12:54:38,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 12:54:38,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 2831 transitions. [2018-09-19 12:54:38,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-09-19 12:54:38,138 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:54:38,139 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, 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] [2018-09-19 12:54:38,139 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:54:38,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1339211256, now seen corresponding path program 1 times [2018-09-19 12:54:38,139 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:54:38,140 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 163 with the following transitions: [2018-09-19 12:54:38,141 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], [3011], [3015], [3017], [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:54:38,151 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:54:38,151 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:54:38,654 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:54:38,654 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:54:38,690 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:54:39,007 INFO L232 lantSequenceWeakener]: Weakened 159 states. On average, predicates are now at 71.73% of their original sizes. [2018-09-19 12:54:39,008 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:54:39,540 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:54:39,540 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:54:39,540 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:54:39,540 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:54:39,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:54:39,542 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:54:39,542 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:54:39,543 INFO L87 Difference]: Start difference. First operand 1920 states and 2831 transitions. Second operand 10 states. [2018-09-19 12:54:53,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:54:53,987 INFO L93 Difference]: Finished difference Result 3841 states and 6447 transitions. [2018-09-19 12:54:53,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 12:54:53,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 162 [2018-09-19 12:54:53,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:54:54,004 INFO L225 Difference]: With dead ends: 3841 [2018-09-19 12:54:54,004 INFO L226 Difference]: Without dead ends: 2731 [2018-09-19 12:54:54,009 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 168 GetRequests, 153 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:54:54,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2731 states. [2018-09-19 12:54:54,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2731 to 2726. [2018-09-19 12:54:54,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2726 states. [2018-09-19 12:54:54,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2726 states and 3662 transitions. [2018-09-19 12:54:54,071 INFO L78 Accepts]: Start accepts. Automaton has 2726 states and 3662 transitions. Word has length 162 [2018-09-19 12:54:54,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:54:54,072 INFO L480 AbstractCegarLoop]: Abstraction has 2726 states and 3662 transitions. [2018-09-19 12:54:54,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:54:54,073 INFO L276 IsEmpty]: Start isEmpty. Operand 2726 states and 3662 transitions. [2018-09-19 12:54:54,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-09-19 12:54:54,077 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:54:54,078 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, 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] [2018-09-19 12:54:54,078 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:54:54,078 INFO L82 PathProgramCache]: Analyzing trace with hash 609976045, now seen corresponding path program 1 times [2018-09-19 12:54:54,078 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:54:54,079 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 192 with the following transitions: [2018-09-19 12:54:54,079 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], [3011], [3015], [3017], [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:54:54,085 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:54:54,085 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:54:54,253 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:54:54,619 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:54:54,619 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:54:54,646 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:54:55,106 INFO L232 lantSequenceWeakener]: Weakened 188 states. On average, predicates are now at 71.6% of their original sizes. [2018-09-19 12:54:55,107 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:54:55,865 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:54:55,865 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:54:55,866 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:54:55,866 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:54:55,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:54:55,867 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:54:55,867 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:54:55,867 INFO L87 Difference]: Start difference. First operand 2726 states and 3662 transitions. Second operand 10 states. [2018-09-19 12:55:07,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:55:07,725 INFO L93 Difference]: Finished difference Result 4658 states and 7291 transitions. [2018-09-19 12:55:07,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 12:55:07,727 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 191 [2018-09-19 12:55:07,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:55:07,746 INFO L225 Difference]: With dead ends: 4658 [2018-09-19 12:55:07,747 INFO L226 Difference]: Without dead ends: 3548 [2018-09-19 12:55:07,751 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 197 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:55:07,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3548 states. [2018-09-19 12:55:07,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3548 to 3542. [2018-09-19 12:55:07,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3542 states. [2018-09-19 12:55:07,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3542 states to 3542 states and 4500 transitions. [2018-09-19 12:55:07,836 INFO L78 Accepts]: Start accepts. Automaton has 3542 states and 4500 transitions. Word has length 191 [2018-09-19 12:55:07,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:55:07,837 INFO L480 AbstractCegarLoop]: Abstraction has 3542 states and 4500 transitions. [2018-09-19 12:55:07,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:55:07,837 INFO L276 IsEmpty]: Start isEmpty. Operand 3542 states and 4500 transitions. [2018-09-19 12:55:07,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-09-19 12:55:07,845 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:55:07,845 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:55:07,846 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:55:07,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1825456469, now seen corresponding path program 1 times [2018-09-19 12:55:07,846 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:55:07,847 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 257 with the following transitions: [2018-09-19 12:55:07,847 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], [3011], [3015], [3017], [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:55:07,852 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:55:07,852 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:55:08,013 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:55:08,199 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:55:08,199 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:55:08,230 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:55:08,621 INFO L232 lantSequenceWeakener]: Weakened 253 states. On average, predicates are now at 71.43% of their original sizes. [2018-09-19 12:55:08,622 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:55:09,093 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:55:09,094 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:55:09,094 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:55:09,094 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:55:09,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:55:09,095 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:55:09,095 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:55:09,096 INFO L87 Difference]: Start difference. First operand 3542 states and 4500 transitions. Second operand 10 states. [2018-09-19 12:55:26,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:55:26,828 INFO L93 Difference]: Finished difference Result 6286 states and 8969 transitions. [2018-09-19 12:55:26,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 12:55:26,830 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 256 [2018-09-19 12:55:26,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:55:26,848 INFO L225 Difference]: With dead ends: 6286 [2018-09-19 12:55:26,848 INFO L226 Difference]: Without dead ends: 4360 [2018-09-19 12:55:26,855 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 262 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:55:26,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4360 states. [2018-09-19 12:55:26,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4360 to 4349. [2018-09-19 12:55:26,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4349 states. [2018-09-19 12:55:26,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4349 states to 4349 states and 5346 transitions. [2018-09-19 12:55:26,964 INFO L78 Accepts]: Start accepts. Automaton has 4349 states and 5346 transitions. Word has length 256 [2018-09-19 12:55:26,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:55:26,965 INFO L480 AbstractCegarLoop]: Abstraction has 4349 states and 5346 transitions. [2018-09-19 12:55:26,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:55:26,965 INFO L276 IsEmpty]: Start isEmpty. Operand 4349 states and 5346 transitions. [2018-09-19 12:55:26,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-09-19 12:55:26,970 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:55:26,970 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:55:26,971 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:55:26,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1370509251, now seen corresponding path program 1 times [2018-09-19 12:55:26,971 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:55:26,971 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 269 with the following transitions: [2018-09-19 12:55:26,972 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], [3011], [3015], [3017], [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:55:26,977 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:55:26,978 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:55:27,165 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:55:27,430 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:55:27,430 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:55:27,470 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:55:27,896 INFO L232 lantSequenceWeakener]: Weakened 265 states. On average, predicates are now at 71.41% of their original sizes. [2018-09-19 12:55:27,896 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:55:28,161 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:55:28,162 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:55:28,162 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:55:28,162 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:55:28,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:55:28,163 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:55:28,163 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:55:28,164 INFO L87 Difference]: Start difference. First operand 4349 states and 5346 transitions. Second operand 10 states. [2018-09-19 12:55:44,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:55:44,377 INFO L93 Difference]: Finished difference Result 7115 states and 9845 transitions. [2018-09-19 12:55:44,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 12:55:44,381 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 268 [2018-09-19 12:55:44,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:55:44,402 INFO L225 Difference]: With dead ends: 7115 [2018-09-19 12:55:44,403 INFO L226 Difference]: Without dead ends: 5189 [2018-09-19 12:55:44,409 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 275 GetRequests, 259 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:44,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5189 states. [2018-09-19 12:55:44,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5189 to 5167. [2018-09-19 12:55:44,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5167 states. [2018-09-19 12:55:44,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5167 states to 5167 states and 6284 transitions. [2018-09-19 12:55:44,508 INFO L78 Accepts]: Start accepts. Automaton has 5167 states and 6284 transitions. Word has length 268 [2018-09-19 12:55:44,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:55:44,509 INFO L480 AbstractCegarLoop]: Abstraction has 5167 states and 6284 transitions. [2018-09-19 12:55:44,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:55:44,509 INFO L276 IsEmpty]: Start isEmpty. Operand 5167 states and 6284 transitions. [2018-09-19 12:55:44,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-09-19 12:55:44,514 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:55:44,515 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, 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] [2018-09-19 12:55:44,515 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:55:44,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1649113252, now seen corresponding path program 1 times [2018-09-19 12:55:44,515 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:55:44,516 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 285 with the following transitions: [2018-09-19 12:55:44,516 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], [3011], [3015], [3017], [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:55:44,526 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:55:44,527 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:55:44,772 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:55:45,221 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:55:45,221 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:55:45,253 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:55:45,911 INFO L232 lantSequenceWeakener]: Weakened 281 states. On average, predicates are now at 71.34% of their original sizes. [2018-09-19 12:55:45,911 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:55:46,079 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:55:46,080 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:55:46,080 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:55:46,080 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:55:46,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:55:46,081 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:55:46,081 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:55:46,082 INFO L87 Difference]: Start difference. First operand 5167 states and 6284 transitions. Second operand 10 states. [2018-09-19 12:55:58,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:55:58,720 INFO L93 Difference]: Finished difference Result 9545 states and 12511 transitions. [2018-09-19 12:55:58,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 12:55:58,720 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 284 [2018-09-19 12:55:58,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:55:58,743 INFO L225 Difference]: With dead ends: 9545 [2018-09-19 12:55:58,743 INFO L226 Difference]: Without dead ends: 6800 [2018-09-19 12:55:58,751 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 290 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:55:58,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6800 states. [2018-09-19 12:55:58,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6800 to 6794. [2018-09-19 12:55:58,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6794 states. [2018-09-19 12:55:58,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6794 states to 6794 states and 7947 transitions. [2018-09-19 12:55:58,866 INFO L78 Accepts]: Start accepts. Automaton has 6794 states and 7947 transitions. Word has length 284 [2018-09-19 12:55:58,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:55:58,866 INFO L480 AbstractCegarLoop]: Abstraction has 6794 states and 7947 transitions. [2018-09-19 12:55:58,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:55:58,867 INFO L276 IsEmpty]: Start isEmpty. Operand 6794 states and 7947 transitions. [2018-09-19 12:55:58,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-09-19 12:55:58,872 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:55:58,873 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:58,873 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:55:58,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1882272506, now seen corresponding path program 1 times [2018-09-19 12:55:58,873 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:55:58,874 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 293 with the following transitions: [2018-09-19 12:55:58,874 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], [3011], [3015], [3017], [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:55:58,877 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:55:58,877 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:55:58,998 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:55:59,430 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:55:59,431 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:55:59,468 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:55:59,820 INFO L232 lantSequenceWeakener]: Weakened 289 states. On average, predicates are now at 71.36% of their original sizes. [2018-09-19 12:55:59,820 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:55:59,934 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:55:59,935 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:55:59,935 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:55:59,935 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:55:59,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:55:59,936 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:55:59,936 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:55:59,936 INFO L87 Difference]: Start difference. First operand 6794 states and 7947 transitions. Second operand 10 states. [2018-09-19 12:56:12,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:56:12,244 INFO L93 Difference]: Finished difference Result 13654 states and 16856 transitions. [2018-09-19 12:56:12,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:56:12,244 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 292 [2018-09-19 12:56:12,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:56:12,270 INFO L225 Difference]: With dead ends: 13654 [2018-09-19 12:56:12,270 INFO L226 Difference]: Without dead ends: 9279 [2018-09-19 12:56:12,281 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 299 GetRequests, 283 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:56:12,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9279 states. [2018-09-19 12:56:12,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9279 to 9252. [2018-09-19 12:56:12,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9252 states. [2018-09-19 12:56:12,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9252 states to 9252 states and 10537 transitions. [2018-09-19 12:56:12,433 INFO L78 Accepts]: Start accepts. Automaton has 9252 states and 10537 transitions. Word has length 292 [2018-09-19 12:56:12,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:56:12,434 INFO L480 AbstractCegarLoop]: Abstraction has 9252 states and 10537 transitions. [2018-09-19 12:56:12,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:56:12,435 INFO L276 IsEmpty]: Start isEmpty. Operand 9252 states and 10537 transitions. [2018-09-19 12:56:12,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-09-19 12:56:12,442 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:56:12,442 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, 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, 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:56:12,443 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:56:12,443 INFO L82 PathProgramCache]: Analyzing trace with hash 867859262, now seen corresponding path program 1 times [2018-09-19 12:56:12,443 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:56:12,443 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 335 with the following transitions: [2018-09-19 12:56:12,444 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], [3011], [3015], [3017], [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:56:12,446 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:56:12,446 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:56:12,597 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:56:13,797 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:56:13,797 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:56:13,837 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:56:14,583 INFO L232 lantSequenceWeakener]: Weakened 331 states. On average, predicates are now at 71.32% of their original sizes. [2018-09-19 12:56:14,583 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:56:14,693 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:56:14,693 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:56:14,693 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:56:14,693 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:56:14,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:56:14,694 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:56:14,694 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:56:14,695 INFO L87 Difference]: Start difference. First operand 9252 states and 10537 transitions. Second operand 10 states. [2018-09-19 12:56:28,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:56:28,507 INFO L93 Difference]: Finished difference Result 15294 states and 18522 transitions. [2018-09-19 12:56:28,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 12:56:28,508 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 334 [2018-09-19 12:56:28,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:56:28,528 INFO L225 Difference]: With dead ends: 15294 [2018-09-19 12:56:28,528 INFO L226 Difference]: Without dead ends: 10085 [2018-09-19 12:56:28,537 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 340 GetRequests, 325 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:56:28,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10085 states. [2018-09-19 12:56:28,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10085 to 10061. [2018-09-19 12:56:28,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10061 states. [2018-09-19 12:56:28,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10061 states to 10061 states and 11413 transitions. [2018-09-19 12:56:28,665 INFO L78 Accepts]: Start accepts. Automaton has 10061 states and 11413 transitions. Word has length 334 [2018-09-19 12:56:28,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:56:28,665 INFO L480 AbstractCegarLoop]: Abstraction has 10061 states and 11413 transitions. [2018-09-19 12:56:28,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:56:28,666 INFO L276 IsEmpty]: Start isEmpty. Operand 10061 states and 11413 transitions. [2018-09-19 12:56:28,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-09-19 12:56:28,673 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:56:28,673 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, 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, 2, 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:56:28,674 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:56:28,674 INFO L82 PathProgramCache]: Analyzing trace with hash -426257070, now seen corresponding path program 1 times [2018-09-19 12:56:28,674 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:56:28,674 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 345 with the following transitions: [2018-09-19 12:56:28,675 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], [3011], [3015], [3017], [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:56:28,677 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:56:28,677 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:56:28,829 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:56:29,236 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:56:29,237 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:56:29,241 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:56:29,656 INFO L232 lantSequenceWeakener]: Weakened 341 states. On average, predicates are now at 71.3% of their original sizes. [2018-09-19 12:56:29,657 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:56:29,790 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:56:29,790 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:56:29,791 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:56:29,791 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:56:29,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:56:29,791 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:56:29,792 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:56:29,792 INFO L87 Difference]: Start difference. First operand 10061 states and 11413 transitions. Second operand 10 states. [2018-09-19 12:56:44,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:56:44,900 INFO L93 Difference]: Finished difference Result 17756 states and 21202 transitions. [2018-09-19 12:56:44,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:56:44,900 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 344 [2018-09-19 12:56:44,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:56:44,926 INFO L225 Difference]: With dead ends: 17756 [2018-09-19 12:56:44,926 INFO L226 Difference]: Without dead ends: 11734 [2018-09-19 12:56:44,939 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 351 GetRequests, 335 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:56:44,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11734 states. [2018-09-19 12:56:45,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11734 to 11704. [2018-09-19 12:56:45,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11704 states. [2018-09-19 12:56:45,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11704 states to 11704 states and 13240 transitions. [2018-09-19 12:56:45,104 INFO L78 Accepts]: Start accepts. Automaton has 11704 states and 13240 transitions. Word has length 344 [2018-09-19 12:56:45,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:56:45,104 INFO L480 AbstractCegarLoop]: Abstraction has 11704 states and 13240 transitions. [2018-09-19 12:56:45,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:56:45,105 INFO L276 IsEmpty]: Start isEmpty. Operand 11704 states and 13240 transitions. [2018-09-19 12:56:45,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-09-19 12:56:45,113 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:56:45,114 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, 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, 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:56:45,114 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:56:45,114 INFO L82 PathProgramCache]: Analyzing trace with hash -639686491, now seen corresponding path program 1 times [2018-09-19 12:56:45,114 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:56:45,115 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 360 with the following transitions: [2018-09-19 12:56:45,115 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], [3011], [3015], [3017], [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:56:45,117 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:56:45,118 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:56:45,257 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:56:45,630 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:56:45,630 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:56:45,670 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:56:46,181 INFO L232 lantSequenceWeakener]: Weakened 356 states. On average, predicates are now at 71.34% of their original sizes. [2018-09-19 12:56:46,181 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:56:46,364 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:56:46,364 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:56:46,365 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 12:56:46,365 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:56:46,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 12:56:46,366 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 12:56:46,366 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-09-19 12:56:46,366 INFO L87 Difference]: Start difference. First operand 11704 states and 13240 transitions. Second operand 12 states. [2018-09-19 12:57:32,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:57:32,587 INFO L93 Difference]: Finished difference Result 22751 states and 29077 transitions. [2018-09-19 12:57:32,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-19 12:57:32,588 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 359 [2018-09-19 12:57:32,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:57:32,619 INFO L225 Difference]: With dead ends: 22751 [2018-09-19 12:57:32,619 INFO L226 Difference]: Without dead ends: 15901 [2018-09-19 12:57:32,633 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 384 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=1186, Unknown=0, NotChecked=0, Total=1406 [2018-09-19 12:57:32,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15901 states. [2018-09-19 12:57:32,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15901 to 15812. [2018-09-19 12:57:32,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15812 states. [2018-09-19 12:57:32,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15812 states to 15812 states and 18058 transitions. [2018-09-19 12:57:32,842 INFO L78 Accepts]: Start accepts. Automaton has 15812 states and 18058 transitions. Word has length 359 [2018-09-19 12:57:32,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:57:32,843 INFO L480 AbstractCegarLoop]: Abstraction has 15812 states and 18058 transitions. [2018-09-19 12:57:32,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 12:57:32,844 INFO L276 IsEmpty]: Start isEmpty. Operand 15812 states and 18058 transitions. [2018-09-19 12:57:32,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-09-19 12:57:32,853 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:57:32,854 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:57:32,854 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:57:32,854 INFO L82 PathProgramCache]: Analyzing trace with hash 107512630, now seen corresponding path program 1 times [2018-09-19 12:57:32,854 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:57:32,855 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 363 with the following transitions: [2018-09-19 12:57:32,855 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], [3011], [3015], [3017], [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:57:32,857 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:57:32,857 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:57:32,983 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:57:33,245 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:57:33,245 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:57:33,256 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:57:33,623 INFO L232 lantSequenceWeakener]: Weakened 359 states. On average, predicates are now at 71.28% of their original sizes. [2018-09-19 12:57:33,623 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:57:33,740 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:57:33,741 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:57:33,741 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:57:33,741 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:57:33,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:57:33,742 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:57:33,742 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:57:33,742 INFO L87 Difference]: Start difference. First operand 15812 states and 18058 transitions. Second operand 10 states. [2018-09-19 12:57:46,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:57:46,745 INFO L93 Difference]: Finished difference Result 27654 states and 32817 transitions. [2018-09-19 12:57:46,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:57:46,746 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 362 [2018-09-19 12:57:46,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:57:46,777 INFO L225 Difference]: With dead ends: 27654 [2018-09-19 12:57:46,777 INFO L226 Difference]: Without dead ends: 16696 [2018-09-19 12:57:46,798 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 369 GetRequests, 353 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:57:46,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16696 states. [2018-09-19 12:57:46,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16696 to 16645. [2018-09-19 12:57:46,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16645 states. [2018-09-19 12:57:47,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16645 states to 16645 states and 19107 transitions. [2018-09-19 12:57:47,011 INFO L78 Accepts]: Start accepts. Automaton has 16645 states and 19107 transitions. Word has length 362 [2018-09-19 12:57:47,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:57:47,012 INFO L480 AbstractCegarLoop]: Abstraction has 16645 states and 19107 transitions. [2018-09-19 12:57:47,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:57:47,012 INFO L276 IsEmpty]: Start isEmpty. Operand 16645 states and 19107 transitions. [2018-09-19 12:57:47,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-09-19 12:57:47,018 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:57:47,018 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:57:47,019 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:57:47,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1301650950, now seen corresponding path program 1 times [2018-09-19 12:57:47,019 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:57:47,020 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 365 with the following transitions: [2018-09-19 12:57:47,020 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], [3011], [3015], [3017], [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:57:47,023 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:57:47,023 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:57:47,171 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:57:54,388 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 12:57:54,389 INFO L272 AbstractInterpreter]: Visited 116 different actions 677 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:57:54,396 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 12:57:54,443 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 12:57:54,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 12:57:54 BoogieIcfgContainer [2018-09-19 12:57:54,444 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 12:57:54,445 INFO L168 Benchmark]: Toolchain (without parser) took 228450.14 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-09-19 12:57:54,447 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 12:57:54,447 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2670.48 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 12:57:54,448 INFO L168 Benchmark]: Boogie Procedure Inliner took 314.42 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:57:54,449 INFO L168 Benchmark]: Boogie Preprocessor took 1199.35 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 995.6 MB). 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:57:54,450 INFO L168 Benchmark]: RCFGBuilder took 10270.83 ms. Allocated memory was 2.5 GB in the beginning and 2.7 GB in the end (delta: 159.4 MB). Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: -2.2 MB). Peak memory consumption was 750.9 MB. Max. memory is 7.1 GB. [2018-09-19 12:57:54,451 INFO L168 Benchmark]: TraceAbstraction took 213988.23 ms. Allocated memory was 2.7 GB in the beginning and 4.2 GB in the end (delta: 1.5 GB). Free memory was 2.3 GB in the beginning and 3.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-09-19 12:57:54,456 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2670.48 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 314.42 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 1199.35 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 995.6 MB). 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 10270.83 ms. Allocated memory was 2.5 GB in the beginning and 2.7 GB in the end (delta: 159.4 MB). Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: -2.2 MB). Peak memory consumption was 750.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 213988.23 ms. Allocated memory was 2.7 GB in the beginning and 4.2 GB in the end (delta: 1.5 GB). Free memory was 2.3 GB in the beginning and 3.3 GB in the end (delta: -1.0 GB). 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: 174]: 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 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 TRUE ((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1)) [L174] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 1120 locations, 1 error locations. UNKNOWN Result, 213.9s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 189.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13177 SDtfs, 32616 SDslu, 7306 SDs, 0 SdLazy, 113727 SolverSat, 9984 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 163.4s Time, PredicateUnifierStatistics: 22 DeclaredPredicates, 2995 GetRequests, 2816 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 3.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, 14.1s AbstIntTime, 12 AbstIntIterations, 11 AbstIntStrong, 0.997485891788773 AbsIntWeakeningRatio, 0.10130944176430048 AbsIntAvgWeakeningVarsNumRemoved, 23.502412129565815 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s 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_label37_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_12-57-54-473.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem13_label37_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_12-57-54-473.csv Received shutdown request...