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/Problem17_label12_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-15 23:20:49,862 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-15 23:20:49,864 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-15 23:20:49,876 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-15 23:20:49,877 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-15 23:20:49,878 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-15 23:20:49,879 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-15 23:20:49,881 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-15 23:20:49,882 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-15 23:20:49,883 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-15 23:20:49,884 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-15 23:20:49,884 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-15 23:20:49,885 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-15 23:20:49,886 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-15 23:20:49,887 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-15 23:20:49,888 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-15 23:20:49,889 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-15 23:20:49,895 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-15 23:20:49,897 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-15 23:20:49,898 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-15 23:20:49,899 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-15 23:20:49,904 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-15 23:20:49,911 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-15 23:20:49,911 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-15 23:20:49,911 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-15 23:20:49,912 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-15 23:20:49,913 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-15 23:20:49,914 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-15 23:20:49,914 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-15 23:20:49,915 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-15 23:20:49,915 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-15 23:20:49,916 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-15 23:20:49,916 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-15 23:20:49,917 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-15 23:20:49,917 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-15 23:20:49,918 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-15 23:20:49,918 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-15 23:20:49,934 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-15 23:20:49,934 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-15 23:20:49,935 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-15 23:20:49,935 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-15 23:20:49,935 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-15 23:20:49,936 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-15 23:20:49,936 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-15 23:20:49,936 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-15 23:20:49,936 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-15 23:20:49,936 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-15 23:20:49,936 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-15 23:20:49,937 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-15 23:20:49,937 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-15 23:20:49,937 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-15 23:20:49,938 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-15 23:20:49,938 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-15 23:20:49,938 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-15 23:20:49,938 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-15 23:20:49,938 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-15 23:20:49,939 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-15 23:20:49,939 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-15 23:20:49,939 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-15 23:20:49,939 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-15 23:20:49,939 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-15 23:20:49,940 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-15 23:20:49,940 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-15 23:20:49,940 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-15 23:20:49,940 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-15 23:20:49,940 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-15 23:20:49,941 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-15 23:20:49,941 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-15 23:20:49,941 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-15 23:20:49,941 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-15 23:20:49,987 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-15 23:20:50,000 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-15 23:20:50,004 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-15 23:20:50,005 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-15 23:20:50,006 INFO L276 PluginConnector]: CDTParser initialized [2018-09-15 23:20:50,007 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label12_true-unreach-call.c [2018-09-15 23:20:50,346 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b1c99872/845af02df0264ef3aced1048a57f7196/FLAGa453df7bb [2018-09-15 23:20:50,757 INFO L277 CDTParser]: Found 1 translation units. [2018-09-15 23:20:50,758 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label12_true-unreach-call.c [2018-09-15 23:20:50,782 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b1c99872/845af02df0264ef3aced1048a57f7196/FLAGa453df7bb [2018-09-15 23:20:50,803 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b1c99872/845af02df0264ef3aced1048a57f7196 [2018-09-15 23:20:50,815 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-15 23:20:50,819 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-15 23:20:50,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-15 23:20:50,820 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-15 23:20:50,827 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-15 23:20:50,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 11:20:50" (1/1) ... [2018-09-15 23:20:50,831 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ddc0e27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:20:50, skipping insertion in model container [2018-09-15 23:20:50,831 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 11:20:50" (1/1) ... [2018-09-15 23:20:50,845 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-15 23:20:51,891 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 23:20:51,916 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-15 23:20:52,459 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 23:20:52,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:20:52 WrapperNode [2018-09-15 23:20:52,684 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-15 23:20:52,685 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-15 23:20:52,685 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-15 23:20:52,686 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-15 23:20:52,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:20:52" (1/1) ... [2018-09-15 23:20:52,786 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:20:52" (1/1) ... [2018-09-15 23:20:52,982 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-15 23:20:52,983 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-15 23:20:52,983 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-15 23:20:52,983 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-15 23:20:53,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:20:52" (1/1) ... [2018-09-15 23:20:53,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:20:52" (1/1) ... [2018-09-15 23:20:53,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:20:52" (1/1) ... [2018-09-15 23:20:53,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:20:52" (1/1) ... [2018-09-15 23:20:53,718 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:20:52" (1/1) ... [2018-09-15 23:20:53,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:20:52" (1/1) ... [2018-09-15 23:20:53,813 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:20:52" (1/1) ... [2018-09-15 23:20:53,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-15 23:20:53,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-15 23:20:53,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-15 23:20:53,884 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-15 23:20:53,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:20:52" (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-15 23:20:53,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-15 23:20:53,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-15 23:20:53,967 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-09-15 23:20:53,967 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-09-15 23:20:53,968 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-15 23:20:53,968 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-15 23:20:53,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-15 23:20:53,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-15 23:20:53,968 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-15 23:20:53,968 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-15 23:21:05,854 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-15 23:21:05,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 11:21:05 BoogieIcfgContainer [2018-09-15 23:21:05,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-15 23:21:05,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-15 23:21:05,858 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-15 23:21:05,862 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-15 23:21:05,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 11:20:50" (1/3) ... [2018-09-15 23:21:05,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1545c132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 11:21:05, skipping insertion in model container [2018-09-15 23:21:05,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:20:52" (2/3) ... [2018-09-15 23:21:05,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1545c132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 11:21:05, skipping insertion in model container [2018-09-15 23:21:05,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 11:21:05" (3/3) ... [2018-09-15 23:21:05,866 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label12_true-unreach-call.c [2018-09-15 23:21:05,876 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-15 23:21:05,887 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-15 23:21:05,951 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-15 23:21:05,952 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-15 23:21:05,952 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-15 23:21:05,952 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-15 23:21:05,952 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-15 23:21:05,952 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-15 23:21:05,952 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-15 23:21:05,953 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-15 23:21:05,953 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-15 23:21:05,991 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states. [2018-09-15 23:21:06,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-15 23:21:06,002 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 23:21:06,003 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] [2018-09-15 23:21:06,004 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 23:21:06,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1805373012, now seen corresponding path program 1 times [2018-09-15 23:21:06,011 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 23:21:06,012 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-09-15 23:21:06,015 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [930], [932], [2283], [2287], [2293], [2297], [2306], [2307], [2308], [2310] [2018-09-15 23:21:06,062 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-15 23:21:06,062 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 23:21:07,304 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 23:21:07,306 INFO L272 AbstractInterpreter]: Visited 39 different actions 39 times. Never merged. Never widened. Never found a fixpoint. Largest state had 25 variables. [2018-09-15 23:21:07,325 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 23:21:07,992 INFO L232 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 76.7% of their original sizes. [2018-09-15 23:21:07,992 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 23:21:08,161 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 23:21:08,163 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 23:21:08,163 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-15 23:21:08,163 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 23:21:08,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-15 23:21:08,176 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-15 23:21:08,177 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-15 23:21:08,179 INFO L87 Difference]: Start difference. First operand 604 states. Second operand 6 states. [2018-09-15 23:21:15,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 23:21:15,194 INFO L93 Difference]: Finished difference Result 1642 states and 3016 transitions. [2018-09-15 23:21:15,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-15 23:21:15,196 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-09-15 23:21:15,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 23:21:15,220 INFO L225 Difference]: With dead ends: 1642 [2018-09-15 23:21:15,220 INFO L226 Difference]: Without dead ends: 1036 [2018-09-15 23:21:15,231 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-15 23:21:15,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2018-09-15 23:21:15,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1034. [2018-09-15 23:21:15,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2018-09-15 23:21:15,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1511 transitions. [2018-09-15 23:21:15,370 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1511 transitions. Word has length 40 [2018-09-15 23:21:15,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 23:21:15,371 INFO L480 AbstractCegarLoop]: Abstraction has 1034 states and 1511 transitions. [2018-09-15 23:21:15,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-15 23:21:15,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1511 transitions. [2018-09-15 23:21:15,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-09-15 23:21:15,377 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 23:21:15,378 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:21:15,378 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 23:21:15,379 INFO L82 PathProgramCache]: Analyzing trace with hash -2053053534, now seen corresponding path program 1 times [2018-09-15 23:21:15,379 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 23:21:15,379 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2018-09-15 23:21:15,380 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [930], [932], [935], [943], [951], [959], [967], [975], [983], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1223], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-09-15 23:21:15,386 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-15 23:21:15,387 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 23:21:22,900 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 23:21:30,268 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 23:21:30,269 INFO L272 AbstractInterpreter]: Visited 82 different actions 157 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-15 23:21:30,309 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 23:21:36,880 INFO L232 lantSequenceWeakener]: Weakened 112 states. On average, predicates are now at 75.67% of their original sizes. [2018-09-15 23:21:36,881 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 23:21:37,141 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 23:21:37,142 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 23:21:37,142 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-15 23:21:37,142 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 23:21:37,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-15 23:21:37,143 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-15 23:21:37,144 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-09-15 23:21:37,144 INFO L87 Difference]: Start difference. First operand 1034 states and 1511 transitions. Second operand 11 states. [2018-09-15 23:21:56,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 23:21:56,025 INFO L93 Difference]: Finished difference Result 2502 states and 4301 transitions. [2018-09-15 23:21:56,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-15 23:21:56,031 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 115 [2018-09-15 23:21:56,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 23:21:56,042 INFO L225 Difference]: With dead ends: 2502 [2018-09-15 23:21:56,042 INFO L226 Difference]: Without dead ends: 1908 [2018-09-15 23:21:56,047 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 121 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-15 23:21:56,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states. [2018-09-15 23:21:56,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1905. [2018-09-15 23:21:56,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1905 states. [2018-09-15 23:21:56,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1905 states to 1905 states and 2402 transitions. [2018-09-15 23:21:56,105 INFO L78 Accepts]: Start accepts. Automaton has 1905 states and 2402 transitions. Word has length 115 [2018-09-15 23:21:56,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 23:21:56,106 INFO L480 AbstractCegarLoop]: Abstraction has 1905 states and 2402 transitions. [2018-09-15 23:21:56,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-15 23:21:56,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1905 states and 2402 transitions. [2018-09-15 23:21:56,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-15 23:21:56,110 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 23:21:56,110 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:21:56,110 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 23:21:56,111 INFO L82 PathProgramCache]: Analyzing trace with hash -806705350, now seen corresponding path program 1 times [2018-09-15 23:21:56,111 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 23:21:56,111 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 129 with the following transitions: [2018-09-15 23:21:56,112 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [930], [932], [935], [943], [951], [959], [967], [975], [983], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1224], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1282], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-09-15 23:21:56,116 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-15 23:21:56,116 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 23:22:00,196 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 23:22:09,459 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 23:22:09,459 INFO L272 AbstractInterpreter]: Visited 95 different actions 184 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-15 23:22:09,468 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 23:22:19,412 INFO L232 lantSequenceWeakener]: Weakened 125 states. On average, predicates are now at 75.6% of their original sizes. [2018-09-15 23:22:19,412 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 23:22:19,621 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 23:22:19,622 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 23:22:19,622 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-15 23:22:19,622 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 23:22:19,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-15 23:22:19,623 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-15 23:22:19,623 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-15 23:22:19,624 INFO L87 Difference]: Start difference. First operand 1905 states and 2402 transitions. Second operand 11 states. [2018-09-15 23:22:27,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 23:22:27,931 INFO L93 Difference]: Finished difference Result 2938 states and 4330 transitions. [2018-09-15 23:22:27,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-15 23:22:27,935 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 128 [2018-09-15 23:22:27,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 23:22:27,955 INFO L225 Difference]: With dead ends: 2938 [2018-09-15 23:22:27,956 INFO L226 Difference]: Without dead ends: 2344 [2018-09-15 23:22:27,960 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 135 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-09-15 23:22:27,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2344 states. [2018-09-15 23:22:28,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2344 to 2341. [2018-09-15 23:22:28,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2341 states. [2018-09-15 23:22:28,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2341 states to 2341 states and 2853 transitions. [2018-09-15 23:22:28,030 INFO L78 Accepts]: Start accepts. Automaton has 2341 states and 2853 transitions. Word has length 128 [2018-09-15 23:22:28,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 23:22:28,031 INFO L480 AbstractCegarLoop]: Abstraction has 2341 states and 2853 transitions. [2018-09-15 23:22:28,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-15 23:22:28,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2341 states and 2853 transitions. [2018-09-15 23:22:28,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-09-15 23:22:28,039 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 23:22:28,039 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-15 23:22:28,040 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 23:22:28,041 INFO L82 PathProgramCache]: Analyzing trace with hash 970172208, now seen corresponding path program 1 times [2018-09-15 23:22:28,041 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 23:22:28,041 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 204 with the following transitions: [2018-09-15 23:22:28,042 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [930], [932], [935], [943], [951], [959], [967], [975], [983], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1223], [1224], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1282], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-09-15 23:22:28,047 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-15 23:22:28,047 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 23:22:33,521 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 23:23:07,112 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-15 23:23:07,112 INFO L272 AbstractInterpreter]: Visited 97 different actions 468 times. Merged at 7 different actions 29 times. Never widened. Found 6 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-15 23:23:07,122 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-15 23:23:07,155 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-15 23:23:07,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 11:23:07 BoogieIcfgContainer [2018-09-15 23:23:07,155 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-15 23:23:07,156 INFO L168 Benchmark]: Toolchain (without parser) took 136340.39 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -123.2 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-09-15 23:23:07,158 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-15 23:23:07,159 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1864.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 7.1 GB. [2018-09-15 23:23:07,160 INFO L168 Benchmark]: Boogie Procedure Inliner took 297.15 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-15 23:23:07,161 INFO L168 Benchmark]: Boogie Preprocessor took 900.28 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 909.6 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 123.6 MB. Max. memory is 7.1 GB. [2018-09-15 23:23:07,162 INFO L168 Benchmark]: RCFGBuilder took 11972.21 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 1.8 GB in the end (delta: 457.8 MB). Peak memory consumption was 457.8 MB. Max. memory is 7.1 GB. [2018-09-15 23:23:07,163 INFO L168 Benchmark]: TraceAbstraction took 121299.25 ms. Allocated memory was 2.4 GB in the beginning and 4.1 GB in the end (delta: 1.7 GB). Free memory was 1.8 GB in the beginning and 1.5 GB in the end (delta: 317.9 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-09-15 23:23:07,168 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1864.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 297.15 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 900.28 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 909.6 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 123.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11972.21 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 1.8 GB in the end (delta: 457.8 MB). Peak memory consumption was 457.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 121299.25 ms. Allocated memory was 2.4 GB in the beginning and 4.1 GB in the end (delta: 1.7 GB). Free memory was 1.8 GB in the beginning and 1.5 GB in the end (delta: 317.9 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 107]: 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: [L8] int inputA = 1; [L9] int inputB = 2; [L10] int inputC = 3; [L11] int inputE = 5; [L12] int inputD = 4; [L13] int inputF = 6; [L16] int a24 = 1; [L17] int a21 = 124; [L18] int a26 = 222; [L19] int a14 = -79; [L20] int a28 = 111; [L2577] int output = -1; [L2580] COND TRUE 1 [L2583] int input; [L2584] input = __VERIFIER_nondet_int() [L2585] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2588] CALL, EXPR calculate_output(input) [L25] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L28] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L31] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L34] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L37] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L40] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L43] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L46] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L49] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L52] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L55] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L58] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L61] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L64] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L67] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L70] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L73] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L76] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L79] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L82] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L85] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L88] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L91] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L94] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L97] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L100] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L103] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L106] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L109] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L112] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L115] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L118] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L121] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L124] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L127] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L130] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L133] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L136] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L139] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L142] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L145] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L148] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L151] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L154] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L157] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L160] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L163] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L166] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L169] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L172] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L175] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L178] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L181] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L184] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L187] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L190] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L193] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L196] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L199] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L202] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L205] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L209] COND FALSE !((( a21 <= 127 && (( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 3))) && a14 <= -182 )) && (a24==3))) [L215] COND FALSE !((((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))) && a21 <= 127 )) [L222] COND FALSE !(( -84 < a14 && ( a21 <= 127 && ( a26 <= -68 && ((a24==2) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) [L228] COND FALSE !((((a24==2) && ((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) && a14 <= -182 )) [L231] COND FALSE !(((a24==3) && ((( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1))) && a14 <= -182 ) && ((-68 < a26) && (124 >= a26)) ))) [L238] COND TRUE (((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4)) && 217 < a26 ) && a21 <= 127 ) && -84 < a14 ) && (a24==1)) [L239] a14 = ((((a14 % 299909)- 300090) + 0) - 0) [L240] a26 = (((a26 + -600088) / 5) - 377912) [L241] a28 = (((a28 + -600036) / 5) / 5) [L242] RET return -1; [L2588] EXPR calculate_output(input) [L2588] output = calculate_output(input) [L2580] COND TRUE 1 [L2583] int input; [L2584] input = __VERIFIER_nondet_int() [L2585] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2588] CALL, EXPR calculate_output(input) [L25] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L28] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L31] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L34] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L37] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L40] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L43] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L46] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L49] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L52] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L55] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L58] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L61] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L64] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L67] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L70] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L73] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L76] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L79] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L82] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L85] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L88] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L91] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L94] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L97] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L100] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L103] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L106] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L109] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L112] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L115] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L118] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L121] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L124] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L127] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L130] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L133] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L136] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L139] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L142] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L145] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L148] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L151] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L154] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L157] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L160] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L163] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L166] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L169] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L172] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L175] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L178] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L181] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L184] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L187] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L190] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L193] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L196] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L199] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L202] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L205] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L209] COND FALSE !((( a21 <= 127 && (( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 3))) && a14 <= -182 )) && (a24==3))) [L215] COND FALSE !((((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))) && a21 <= 127 )) [L222] COND FALSE !(( -84 < a14 && ( a21 <= 127 && ( a26 <= -68 && ((a24==2) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) [L228] COND FALSE !((((a24==2) && ((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) && a14 <= -182 )) [L231] COND FALSE !(((a24==3) && ((( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1))) && a14 <= -182 ) && ((-68 < a26) && (124 >= a26)) ))) [L238] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4)) && 217 < a26 ) && a21 <= 127 ) && -84 < a14 ) && (a24==1))) [L243] COND FALSE !(( a21 <= 127 && ((((input == 5) && (( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && 217 < a26 ) && (a24==2)))) [L249] COND FALSE !((((((input == 1) && ((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) ))) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 )) [L256] COND FALSE !(((( ((-182 < a14) && (-114 >= a14)) && ( a28 <= 37 && ((a24==3) && (input == 5)))) && a26 <= -68 ) && a21 <= 127 )) [L262] COND FALSE !(( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (( a21 <= 127 && ((input == 2) && (a24==2))) && a14 <= -182 )))) [L266] COND FALSE !((((((( ((-68 < a26) && (124 >= a26)) && -84 < a14 ) && 300 < a28 ) || (( ((124 < a26) && (217 >= a26)) && a14 <= -182 ) && a28 <= 37 )) && (input == 2)) && a21 <= 127 ) && (a24==3))) [L273] COND FALSE !((( a28 <= 37 && ( a21 <= 127 && ((a24==3) && ( ((-114 < a14) && (-84 >= a14)) && (input == 3))))) && ((124 < a26) && (217 >= a26)) )) [L287] COND FALSE !(((( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 ))) && (input == 3))) && (a24==2)) && ((124 < a26) && (217 >= a26)) )) [L294] COND FALSE !((((a24==3) && ( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 2))))) && ((124 < a26) && (217 >= a26)) )) [L301] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( a14 <= -182 && ((((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 4)) && (a24==2)) && a21 <= 127 )))) [L306] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a21 <= 127 ))) && ((124 < a26) && (217 >= a26)) )) [L313] COND FALSE !(( ((124 < a26) && (217 >= a26)) && (( a21 <= 127 && (((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 6)) && a14 <= -182 )) && (a24==3)))) [L319] COND FALSE !(( a26 <= -68 && (( a21 <= 127 && ((a24==2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 6)))) && a14 <= -182 ))) [L323] COND TRUE ( 217 < a26 && (( a21 <= 127 && ((a24==1) && ((input == 6) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && -84 < a14 )) [L324] a14 = ((((a14 % 299909)- 300090) + 0) + -1) [L325] a26 = ((((a26 * 9)/ 10) - 554854) * 1) [L326] a28 = ((((a28 * 9)/ 10) * 1) - 589002) [L327] a24 = 2 [L329] RET return 25; [L2588] EXPR calculate_output(input) [L2588] output = calculate_output(input) [L2580] COND TRUE 1 [L2583] int input; [L2584] input = __VERIFIER_nondet_int() [L2585] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2588] CALL calculate_output(input) [L25] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L28] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L31] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L34] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L37] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L40] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L43] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L46] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L49] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L52] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L55] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L58] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L61] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L64] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L67] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L70] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L73] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L76] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L79] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L82] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L85] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L88] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L91] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L94] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L97] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L100] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L103] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L106] COND TRUE (((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 ) [L107] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 604 locations, 1 error locations. UNKNOWN Result, 121.2s OverallTime, 4 OverallIterations, 3 TraceHistogramMax, 34.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1944 SDtfs, 5317 SDslu, 1079 SDs, 0 SdLazy, 12504 SolverSat, 1693 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.2s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 295 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2341occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 68.6s AbstIntTime, 4 AbstIntIterations, 3 AbstIntStrong, 0.9963729766610202 AbsIntWeakeningRatio, 0.20357142857142857 AbsIntAvgWeakeningVarsNumRemoved, 6.739285714285714 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 3 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 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/Problem17_label12_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-15_23-23-07-182.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem17_label12_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-15_23-23-07-182.csv Received shutdown request...