java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label20_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-15 16:59:31,069 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-15 16:59:31,071 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-15 16:59:31,085 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-15 16:59:31,085 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-15 16:59:31,086 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-15 16:59:31,087 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-15 16:59:31,089 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-15 16:59:31,091 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-15 16:59:31,092 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-15 16:59:31,092 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-15 16:59:31,093 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-15 16:59:31,094 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-15 16:59:31,095 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-15 16:59:31,096 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-15 16:59:31,097 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-15 16:59:31,098 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-15 16:59:31,099 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-15 16:59:31,102 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-15 16:59:31,103 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-15 16:59:31,104 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-15 16:59:31,105 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-15 16:59:31,108 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-15 16:59:31,108 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-15 16:59:31,109 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-15 16:59:31,109 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-15 16:59:31,110 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-15 16:59:31,111 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-15 16:59:31,112 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-15 16:59:31,113 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-15 16:59:31,114 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-15 16:59:31,114 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-15 16:59:31,115 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-15 16:59:31,115 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-15 16:59:31,116 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-15 16:59:31,117 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-15 16:59:31,117 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf [2018-09-15 16:59:31,135 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-15 16:59:31,135 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-15 16:59:31,136 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-15 16:59:31,137 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-15 16:59:31,137 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-15 16:59:31,137 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-15 16:59:31,137 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-15 16:59:31,137 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-15 16:59:31,138 INFO L133 SettingsManager]: * Abstract domain=CongruenceDomain [2018-09-15 16:59:31,138 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-15 16:59:31,138 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-15 16:59:31,138 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-15 16:59:31,139 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-15 16:59:31,139 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-15 16:59:31,139 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-15 16:59:31,139 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-15 16:59:31,140 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-15 16:59:31,140 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-15 16:59:31,140 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-15 16:59:31,140 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-15 16:59:31,141 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-15 16:59:31,141 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-15 16:59:31,141 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-15 16:59:31,141 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-15 16:59:31,141 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-15 16:59:31,142 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-15 16:59:31,142 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-15 16:59:31,142 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-15 16:59:31,142 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-15 16:59:31,142 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-15 16:59:31,142 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-15 16:59:31,143 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-15 16:59:31,143 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-15 16:59:31,143 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-15 16:59:31,193 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-15 16:59:31,208 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-15 16:59:31,214 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-15 16:59:31,216 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-15 16:59:31,216 INFO L276 PluginConnector]: CDTParser initialized [2018-09-15 16:59:31,217 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label20_true-unreach-call_false-termination.c [2018-09-15 16:59:31,558 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/582176dee/a76c656a08684cf49155e6b4416c9cc3/FLAGd0074ad26 [2018-09-15 16:59:31,881 INFO L277 CDTParser]: Found 1 translation units. [2018-09-15 16:59:31,885 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label20_true-unreach-call_false-termination.c [2018-09-15 16:59:31,913 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/582176dee/a76c656a08684cf49155e6b4416c9cc3/FLAGd0074ad26 [2018-09-15 16:59:31,936 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/582176dee/a76c656a08684cf49155e6b4416c9cc3 [2018-09-15 16:59:31,949 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-15 16:59:31,956 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-15 16:59:31,957 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-15 16:59:31,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-15 16:59:31,968 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-15 16:59:31,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 04:59:31" (1/1) ... [2018-09-15 16:59:31,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23cf82e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:59:31, skipping insertion in model container [2018-09-15 16:59:31,973 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 04:59:31" (1/1) ... [2018-09-15 16:59:31,986 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-15 16:59:32,512 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 16:59:32,535 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-15 16:59:32,674 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 16:59:32,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:59:32 WrapperNode [2018-09-15 16:59:32,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-15 16:59:32,727 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-15 16:59:32,727 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-15 16:59:32,727 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-15 16:59:32,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:59:32" (1/1) ... [2018-09-15 16:59:32,763 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:59:32" (1/1) ... [2018-09-15 16:59:32,860 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-15 16:59:32,861 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-15 16:59:32,861 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-15 16:59:32,861 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-15 16:59:33,035 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:59:32" (1/1) ... [2018-09-15 16:59:33,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:59:32" (1/1) ... [2018-09-15 16:59:33,046 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:59:32" (1/1) ... [2018-09-15 16:59:33,046 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:59:32" (1/1) ... [2018-09-15 16:59:33,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:59:32" (1/1) ... [2018-09-15 16:59:33,116 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:59:32" (1/1) ... [2018-09-15 16:59:33,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:59:32" (1/1) ... [2018-09-15 16:59:33,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-15 16:59:33,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-15 16:59:33,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-15 16:59:33,147 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-15 16:59:33,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:59:32" (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 16:59:33,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-15 16:59:33,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-15 16:59:33,221 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-15 16:59:33,222 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-15 16:59:33,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-15 16:59:33,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-15 16:59:33,222 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-15 16:59:33,223 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-15 16:59:37,128 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-15 16:59:37,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 04:59:37 BoogieIcfgContainer [2018-09-15 16:59:37,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-15 16:59:37,130 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-15 16:59:37,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-15 16:59:37,134 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-15 16:59:37,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 04:59:31" (1/3) ... [2018-09-15 16:59:37,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1558fb54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 04:59:37, skipping insertion in model container [2018-09-15 16:59:37,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:59:32" (2/3) ... [2018-09-15 16:59:37,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1558fb54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 04:59:37, skipping insertion in model container [2018-09-15 16:59:37,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 04:59:37" (3/3) ... [2018-09-15 16:59:37,138 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label20_true-unreach-call_false-termination.c [2018-09-15 16:59:37,151 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-15 16:59:37,161 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-15 16:59:37,237 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-15 16:59:37,238 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-15 16:59:37,239 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-15 16:59:37,239 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-15 16:59:37,239 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-15 16:59:37,239 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-15 16:59:37,239 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-15 16:59:37,240 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-15 16:59:37,240 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-15 16:59:37,272 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-09-15 16:59:37,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-15 16:59:37,283 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 16:59:37,284 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, 1, 1, 1, 1, 1, 1] [2018-09-15 16:59:37,286 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 16:59:37,291 INFO L82 PathProgramCache]: Analyzing trace with hash 182252129, now seen corresponding path program 1 times [2018-09-15 16:59:37,293 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 16:59:37,294 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 68 with the following transitions: [2018-09-15 16:59:37,297 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [437], [439], [952], [956], [962], [966], [973], [974], [975], [977] [2018-09-15 16:59:37,327 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 16:59:37,327 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 16:59:37,513 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 16:59:37,515 INFO L272 AbstractInterpreter]: Visited 66 different actions 66 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-15 16:59:37,550 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 16:59:37,719 INFO L232 lantSequenceWeakener]: Weakened 64 states. On average, predicates are now at 80.57% of their original sizes. [2018-09-15 16:59:37,720 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 16:59:37,818 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 16:59:37,819 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 16:59:37,820 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-15 16:59:37,820 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 16:59:37,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-15 16:59:37,832 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-15 16:59:37,832 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-15 16:59:37,835 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 5 states. [2018-09-15 16:59:40,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 16:59:40,462 INFO L93 Difference]: Finished difference Result 693 states and 1229 transitions. [2018-09-15 16:59:40,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-15 16:59:40,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-09-15 16:59:40,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 16:59:40,485 INFO L225 Difference]: With dead ends: 693 [2018-09-15 16:59:40,485 INFO L226 Difference]: Without dead ends: 436 [2018-09-15 16:59:40,493 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-15 16:59:40,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-09-15 16:59:40,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2018-09-15 16:59:40,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-09-15 16:59:40,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 615 transitions. [2018-09-15 16:59:40,572 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 615 transitions. Word has length 67 [2018-09-15 16:59:40,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 16:59:40,574 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 615 transitions. [2018-09-15 16:59:40,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-15 16:59:40,574 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 615 transitions. [2018-09-15 16:59:40,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-15 16:59:40,582 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 16:59:40,583 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, 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] [2018-09-15 16:59:40,583 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 16:59:40,584 INFO L82 PathProgramCache]: Analyzing trace with hash -385063085, now seen corresponding path program 1 times [2018-09-15 16:59:40,584 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 16:59:40,584 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 153 with the following transitions: [2018-09-15 16:59:40,585 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [437], [439], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-15 16:59:40,590 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 16:59:40,590 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 16:59:40,846 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 16:59:40,848 INFO L272 AbstractInterpreter]: Visited 92 different actions 177 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 16:59:40,893 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 16:59:41,163 INFO L232 lantSequenceWeakener]: Weakened 149 states. On average, predicates are now at 78.8% of their original sizes. [2018-09-15 16:59:41,164 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 16:59:41,809 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 16:59:41,809 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 16:59:41,810 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-15 16:59:41,810 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 16:59:41,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-15 16:59:41,811 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-15 16:59:41,812 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-15 16:59:41,812 INFO L87 Difference]: Start difference. First operand 434 states and 615 transitions. Second operand 9 states. [2018-09-15 16:59:46,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 16:59:46,221 INFO L93 Difference]: Finished difference Result 1051 states and 1763 transitions. [2018-09-15 16:59:46,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-15 16:59:46,222 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 152 [2018-09-15 16:59:46,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 16:59:46,228 INFO L225 Difference]: With dead ends: 1051 [2018-09-15 16:59:46,229 INFO L226 Difference]: Without dead ends: 806 [2018-09-15 16:59:46,234 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 157 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-09-15 16:59:46,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2018-09-15 16:59:46,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 803. [2018-09-15 16:59:46,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2018-09-15 16:59:46,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1002 transitions. [2018-09-15 16:59:46,280 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1002 transitions. Word has length 152 [2018-09-15 16:59:46,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 16:59:46,281 INFO L480 AbstractCegarLoop]: Abstraction has 803 states and 1002 transitions. [2018-09-15 16:59:46,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-15 16:59:46,282 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1002 transitions. [2018-09-15 16:59:46,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-09-15 16:59:46,287 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 16:59:46,287 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, 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] [2018-09-15 16:59:46,287 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 16:59:46,288 INFO L82 PathProgramCache]: Analyzing trace with hash -188894681, now seen corresponding path program 1 times [2018-09-15 16:59:46,288 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 16:59:46,288 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 179 with the following transitions: [2018-09-15 16:59:46,289 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [437], [439], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-15 16:59:46,293 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 16:59:46,293 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 16:59:46,456 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 16:59:46,456 INFO L272 AbstractInterpreter]: Visited 118 different actions 230 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 16:59:46,494 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 16:59:46,713 INFO L232 lantSequenceWeakener]: Weakened 175 states. On average, predicates are now at 78.57% of their original sizes. [2018-09-15 16:59:46,713 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 16:59:47,360 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 16:59:47,361 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 16:59:47,361 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-15 16:59:47,361 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 16:59:47,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-15 16:59:47,362 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-15 16:59:47,362 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-15 16:59:47,363 INFO L87 Difference]: Start difference. First operand 803 states and 1002 transitions. Second operand 9 states. [2018-09-15 16:59:50,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 16:59:50,023 INFO L93 Difference]: Finished difference Result 1236 states and 1786 transitions. [2018-09-15 16:59:50,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-15 16:59:50,027 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 178 [2018-09-15 16:59:50,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 16:59:50,037 INFO L225 Difference]: With dead ends: 1236 [2018-09-15 16:59:50,037 INFO L226 Difference]: Without dead ends: 991 [2018-09-15 16:59:50,046 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 183 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-09-15 16:59:50,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2018-09-15 16:59:50,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 988. [2018-09-15 16:59:50,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2018-09-15 16:59:50,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1200 transitions. [2018-09-15 16:59:50,095 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1200 transitions. Word has length 178 [2018-09-15 16:59:50,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 16:59:50,096 INFO L480 AbstractCegarLoop]: Abstraction has 988 states and 1200 transitions. [2018-09-15 16:59:50,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-15 16:59:50,097 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1200 transitions. [2018-09-15 16:59:50,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-09-15 16:59:50,110 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 16:59:50,110 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, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 16:59:50,111 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 16:59:50,111 INFO L82 PathProgramCache]: Analyzing trace with hash -785952011, now seen corresponding path program 1 times [2018-09-15 16:59:50,111 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 16:59:50,112 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 264 with the following transitions: [2018-09-15 16:59:50,112 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [437], [439], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-15 16:59:50,121 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 16:59:50,122 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 16:59:50,321 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-15 16:59:50,322 INFO L272 AbstractInterpreter]: Visited 120 different actions 353 times. Merged at 7 different actions 17 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 16:59:50,360 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-15 16:59:50,418 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-15 16:59:50,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 04:59:50 BoogieIcfgContainer [2018-09-15 16:59:50,419 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-15 16:59:50,420 INFO L168 Benchmark]: Toolchain (without parser) took 18470.21 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 924.3 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -231.0 MB). Peak memory consumption was 693.4 MB. Max. memory is 7.1 GB. [2018-09-15 16:59:50,422 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 16:59:50,423 INFO L168 Benchmark]: CACSL2BoogieTranslator took 769.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-15 16:59:50,425 INFO L168 Benchmark]: Boogie Procedure Inliner took 133.13 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-15 16:59:50,426 INFO L168 Benchmark]: Boogie Preprocessor took 285.54 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 767.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -860.3 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. [2018-09-15 16:59:50,427 INFO L168 Benchmark]: RCFGBuilder took 3982.70 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 140.0 MB). Peak memory consumption was 140.0 MB. Max. memory is 7.1 GB. [2018-09-15 16:59:50,429 INFO L168 Benchmark]: TraceAbstraction took 13289.10 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 157.3 MB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 436.5 MB). Peak memory consumption was 593.8 MB. Max. memory is 7.1 GB. [2018-09-15 16:59:50,437 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 769.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 133.13 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 285.54 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 767.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -860.3 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3982.70 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 140.0 MB). Peak memory consumption was 140.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13289.10 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 157.3 MB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 436.5 MB). Peak memory consumption was 593.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 184]: 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: [L7] int inputD = 4; [L8] int inputB = 2; [L9] int inputC = 3; [L10] int inputF = 6; [L11] int inputE = 5; [L12] int inputA = 1; [L15] int a21 = 7; [L16] int a15 = 8; [L17] int a12 = -49; [L18] int a24 = 1; [L877] int output = -1; [L880] COND TRUE 1 [L883] int input; [L884] input = __VERIFIER_nondet_int() [L885] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L888] CALL, EXPR calculate_output(input) [L21] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) [L24] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) [L27] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L30] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) [L33] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L36] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L39] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L42] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) [L45] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) [L48] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) [L51] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L54] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) [L57] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) [L60] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) [L63] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) [L66] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L69] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L72] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L75] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L78] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) [L81] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) [L84] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) [L87] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L90] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L93] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) [L96] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) [L99] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) [L102] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L105] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) [L108] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L111] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L114] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L117] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L120] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L123] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) [L126] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L129] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) [L132] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L135] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) [L138] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L141] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) [L144] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L147] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) [L150] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L153] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) [L156] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) [L159] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L162] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) [L165] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) [L168] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L171] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) [L174] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) [L177] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L180] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L183] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) [L186] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L189] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) [L192] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L195] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L198] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) [L201] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L205] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) [L211] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) [L217] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) [L223] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) [L229] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) [L235] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) [L241] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) [L247] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) [L252] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) [L258] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) [L264] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) [L269] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) [L275] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) [L280] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) [L286] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) [L293] COND TRUE ((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8)) [L295] a15 = 5 [L296] a21 = 6 [L298] RET return -1; [L888] EXPR calculate_output(input) [L888] output = calculate_output(input) [L880] COND TRUE 1 [L883] int input; [L884] input = __VERIFIER_nondet_int() [L885] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L888] CALL, EXPR calculate_output(input) [L21] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) [L24] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) [L27] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L30] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) [L33] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L36] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L39] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L42] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) [L45] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) [L48] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) [L51] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L54] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) [L57] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) [L60] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) [L63] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) [L66] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L69] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L72] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L75] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L78] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) [L81] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) [L84] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) [L87] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L90] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L93] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) [L96] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) [L99] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) [L102] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L105] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) [L108] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L111] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L114] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L117] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L120] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L123] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) [L126] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L129] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) [L132] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L135] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) [L138] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L141] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) [L144] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L147] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) [L150] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L153] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) [L156] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) [L159] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L162] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) [L165] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) [L168] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L171] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) [L174] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) [L177] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L180] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L183] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) [L186] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L189] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) [L192] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L195] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L198] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) [L201] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L205] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) [L211] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) [L217] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) [L223] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) [L229] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) [L235] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) [L241] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) [L247] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) [L252] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) [L258] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) [L264] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) [L269] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) [L275] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) [L280] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) [L286] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) [L293] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) [L299] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) [L305] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) [L311] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) [L317] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) [L323] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) [L329] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) [L335] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) [L341] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) [L347] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) [L353] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) [L359] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) [L366] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) [L372] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) [L378] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) [L384] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) [L390] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) [L396] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) [L402] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) [L408] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) [L414] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) [L420] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) [L426] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) [L432] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) [L438] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) [L444] COND FALSE !(((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8))) [L449] COND TRUE (((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8)) [L451] a21 = 10 [L453] RET return 22; [L888] EXPR calculate_output(input) [L888] output = calculate_output(input) [L880] COND TRUE 1 [L883] int input; [L884] input = __VERIFIER_nondet_int() [L885] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L888] CALL calculate_output(input) [L21] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) [L24] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) [L27] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L30] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) [L33] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L36] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L39] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L42] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) [L45] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) [L48] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) [L51] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L54] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) [L57] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) [L60] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) [L63] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) [L66] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L69] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L72] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L75] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L78] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) [L81] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) [L84] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) [L87] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L90] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L93] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) [L96] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) [L99] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) [L102] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L105] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) [L108] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L111] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L114] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L117] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L120] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L123] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) [L126] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L129] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) [L132] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L135] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) [L138] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L141] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) [L144] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L147] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) [L150] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L153] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) [L156] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) [L159] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L162] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) [L165] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) [L168] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L171] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) [L174] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) [L177] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L180] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L183] COND TRUE ((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7)) [L184] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. UNKNOWN Result, 13.1s OverallTime, 4 OverallIterations, 3 TraceHistogramMax, 9.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 745 SDtfs, 2120 SDslu, 473 SDs, 0 SdLazy, 3853 SolverSat, 718 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.0s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 406 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=988occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.0s AbstIntTime, 4 AbstIntIterations, 3 AbstIntStrong, 0.9971836869817448 AbsIntWeakeningRatio, 0.13705583756345177 AbsIntAvgWeakeningVarsNumRemoved, 3.203045685279188 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s 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/Problem14_label20_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-15_16-59-50-467.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem14_label20_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-15_16-59-50-467.csv Received shutdown request...