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/Problem10_label02_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 07:44:40,108 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 07:44:40,110 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 07:44:40,126 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 07:44:40,126 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 07:44:40,128 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 07:44:40,132 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 07:44:40,134 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 07:44:40,137 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 07:44:40,145 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 07:44:40,147 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 07:44:40,147 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 07:44:40,151 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 07:44:40,152 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 07:44:40,154 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 07:44:40,155 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 07:44:40,155 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 07:44:40,157 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 07:44:40,159 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 07:44:40,161 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 07:44:40,162 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 07:44:40,163 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 07:44:40,165 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 07:44:40,166 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 07:44:40,166 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 07:44:40,167 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 07:44:40,168 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 07:44:40,168 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 07:44:40,169 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 07:44:40,170 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 07:44:40,171 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 07:44:40,171 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 07:44:40,171 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 07:44:40,172 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 07:44:40,173 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 07:44:40,174 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 07:44:40,174 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf [2018-09-19 07:44:40,199 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 07:44:40,200 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 07:44:40,202 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 07:44:40,203 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 07:44:40,203 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 07:44:40,203 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 07:44:40,203 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 07:44:40,204 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 07:44:40,204 INFO L133 SettingsManager]: * Abstract domain=CongruenceDomain [2018-09-19 07:44:40,204 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 07:44:40,204 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 07:44:40,204 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 07:44:40,205 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-19 07:44:40,206 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 07:44:40,206 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 07:44:40,206 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 07:44:40,206 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 07:44:40,207 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 07:44:40,208 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 07:44:40,208 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 07:44:40,208 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 07:44:40,208 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 07:44:40,208 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 07:44:40,209 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 07:44:40,209 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 07:44:40,209 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 07:44:40,210 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 07:44:40,210 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 07:44:40,210 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 07:44:40,210 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 07:44:40,211 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 07:44:40,211 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 07:44:40,211 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 07:44:40,211 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 07:44:40,212 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 07:44:40,286 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 07:44:40,300 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 07:44:40,304 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 07:44:40,305 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 07:44:40,306 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 07:44:40,307 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label02_true-unreach-call.c [2018-09-19 07:44:40,651 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc0be4991/85116e8cfbfd4e39bd0b1d9f733f5152/FLAGc00e5834a [2018-09-19 07:44:40,960 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 07:44:40,961 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label02_true-unreach-call.c [2018-09-19 07:44:40,982 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc0be4991/85116e8cfbfd4e39bd0b1d9f733f5152/FLAGc00e5834a [2018-09-19 07:44:41,004 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc0be4991/85116e8cfbfd4e39bd0b1d9f733f5152 [2018-09-19 07:44:41,016 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 07:44:41,020 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 07:44:41,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 07:44:41,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 07:44:41,031 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 07:44:41,032 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 07:44:41" (1/1) ... [2018-09-19 07:44:41,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4428b5ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:44:41, skipping insertion in model container [2018-09-19 07:44:41,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 07:44:41" (1/1) ... [2018-09-19 07:44:41,048 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 07:44:41,531 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 07:44:41,551 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 07:44:41,722 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 07:44:41,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:44:41 WrapperNode [2018-09-19 07:44:41,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 07:44:41,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 07:44:41,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 07:44:41,776 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 07:44:41,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:44:41" (1/1) ... [2018-09-19 07:44:41,825 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:44:41" (1/1) ... [2018-09-19 07:44:41,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 07:44:41,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 07:44:41,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 07:44:41,915 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 07:44:42,068 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:44:41" (1/1) ... [2018-09-19 07:44:42,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:44:41" (1/1) ... [2018-09-19 07:44:42,081 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:44:41" (1/1) ... [2018-09-19 07:44:42,082 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:44:41" (1/1) ... [2018-09-19 07:44:42,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:44:41" (1/1) ... [2018-09-19 07:44:42,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:44:41" (1/1) ... [2018-09-19 07:44:42,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:44:41" (1/1) ... [2018-09-19 07:44:42,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 07:44:42,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 07:44:42,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 07:44:42,161 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 07:44:42,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:44:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 07:44:42,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 07:44:42,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 07:44:42,243 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 07:44:42,243 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 07:44:42,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 07:44:42,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 07:44:42,243 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 07:44:42,244 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 07:44:45,419 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 07:44:45,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 07:44:45 BoogieIcfgContainer [2018-09-19 07:44:45,420 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 07:44:45,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 07:44:45,422 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 07:44:45,426 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 07:44:45,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 07:44:41" (1/3) ... [2018-09-19 07:44:45,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f5fda5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 07:44:45, skipping insertion in model container [2018-09-19 07:44:45,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:44:41" (2/3) ... [2018-09-19 07:44:45,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f5fda5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 07:44:45, skipping insertion in model container [2018-09-19 07:44:45,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 07:44:45" (3/3) ... [2018-09-19 07:44:45,432 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label02_true-unreach-call.c [2018-09-19 07:44:45,444 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 07:44:45,453 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 07:44:45,515 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 07:44:45,516 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 07:44:45,516 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 07:44:45,516 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 07:44:45,516 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 07:44:45,517 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 07:44:45,517 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 07:44:45,517 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 07:44:45,517 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 07:44:45,542 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-19 07:44:45,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-19 07:44:45,557 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 07:44:45,558 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] [2018-09-19 07:44:45,559 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 07:44:45,564 INFO L82 PathProgramCache]: Analyzing trace with hash 417311892, now seen corresponding path program 1 times [2018-09-19 07:44:45,566 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 07:44:45,567 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 67 with the following transitions: [2018-09-19 07:44:45,569 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], [429], [431], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-19 07:44:45,602 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-19 07:44:45,602 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 07:44:45,771 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 07:44:45,773 INFO L272 AbstractInterpreter]: Visited 65 different actions 65 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 07:44:45,831 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 07:44:46,057 INFO L232 lantSequenceWeakener]: Weakened 63 states. On average, predicates are now at 75.72% of their original sizes. [2018-09-19 07:44:46,058 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 07:44:46,163 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 07:44:46,167 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 07:44:46,168 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-19 07:44:46,168 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 07:44:46,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-19 07:44:46,183 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-19 07:44:46,184 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-19 07:44:46,186 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 5 states. [2018-09-19 07:44:48,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 07:44:48,042 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-19 07:44:48,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-19 07:44:48,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-09-19 07:44:48,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 07:44:48,061 INFO L225 Difference]: With dead ends: 576 [2018-09-19 07:44:48,061 INFO L226 Difference]: Without dead ends: 358 [2018-09-19 07:44:48,068 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 65 GetRequests, 62 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-19 07:44:48,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-19 07:44:48,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-19 07:44:48,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-19 07:44:48,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-19 07:44:48,137 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 66 [2018-09-19 07:44:48,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 07:44:48,138 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-19 07:44:48,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-19 07:44:48,138 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-19 07:44:48,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-09-19 07:44:48,146 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 07:44:48,146 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 07:44:48,147 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 07:44:48,147 INFO L82 PathProgramCache]: Analyzing trace with hash 696839107, now seen corresponding path program 1 times [2018-09-19 07:44:48,147 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 07:44:48,148 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 138 with the following transitions: [2018-09-19 07:44:48,148 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], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 07:44:48,153 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-19 07:44:48,153 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 07:44:48,264 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 07:44:48,264 INFO L272 AbstractInterpreter]: Visited 78 different actions 221 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 07:44:48,310 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 07:44:48,461 INFO L232 lantSequenceWeakener]: Weakened 134 states. On average, predicates are now at 76.71% of their original sizes. [2018-09-19 07:44:48,461 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 07:44:49,029 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 07:44:49,029 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 07:44:49,030 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 07:44:49,030 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 07:44:49,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 07:44:49,031 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 07:44:49,032 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-19 07:44:49,032 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 9 states. [2018-09-19 07:44:52,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 07:44:52,543 INFO L93 Difference]: Finished difference Result 798 states and 1291 transitions. [2018-09-19 07:44:52,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 07:44:52,545 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2018-09-19 07:44:52,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 07:44:52,554 INFO L225 Difference]: With dead ends: 798 [2018-09-19 07:44:52,554 INFO L226 Difference]: Without dead ends: 592 [2018-09-19 07:44:52,557 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 143 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-19 07:44:52,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-09-19 07:44:52,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 579. [2018-09-19 07:44:52,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-09-19 07:44:52,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 793 transitions. [2018-09-19 07:44:52,596 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 793 transitions. Word has length 137 [2018-09-19 07:44:52,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 07:44:52,598 INFO L480 AbstractCegarLoop]: Abstraction has 579 states and 793 transitions. [2018-09-19 07:44:52,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 07:44:52,598 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 793 transitions. [2018-09-19 07:44:52,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-19 07:44:52,602 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 07:44:52,603 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 07:44:52,603 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 07:44:52,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1246975752, now seen corresponding path program 1 times [2018-09-19 07:44:52,603 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 07:44:52,604 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 147 with the following transitions: [2018-09-19 07:44:52,604 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], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 07:44:52,608 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-19 07:44:52,608 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 07:44:52,663 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 07:44:52,663 INFO L272 AbstractInterpreter]: Visited 88 different actions 168 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 07:44:52,702 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 07:44:52,747 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 07:44:52,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 07:44:52 BoogieIcfgContainer [2018-09-19 07:44:52,748 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 07:44:52,749 INFO L168 Benchmark]: Toolchain (without parser) took 11731.99 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 779.1 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -217.2 MB). Peak memory consumption was 561.9 MB. Max. memory is 7.1 GB. [2018-09-19 07:44:52,751 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 07:44:52,752 INFO L168 Benchmark]: CACSL2BoogieTranslator took 754.12 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. [2018-09-19 07:44:52,754 INFO L168 Benchmark]: Boogie Procedure Inliner took 139.05 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-19 07:44:52,755 INFO L168 Benchmark]: Boogie Preprocessor took 244.66 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 779.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -881.3 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2018-09-19 07:44:52,756 INFO L168 Benchmark]: RCFGBuilder took 3259.98 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: 105.4 MB). Peak memory consumption was 105.4 MB. Max. memory is 7.1 GB. [2018-09-19 07:44:52,758 INFO L168 Benchmark]: TraceAbstraction took 7327.12 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 503.1 MB). Peak memory consumption was 503.1 MB. Max. memory is 7.1 GB. [2018-09-19 07:44:52,766 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 754.12 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 139.05 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 244.66 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 779.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -881.3 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3259.98 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: 105.4 MB). Peak memory consumption was 105.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7327.12 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 503.1 MB). Peak memory consumption was 503.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 181]: 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 inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND TRUE (((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0)) [L255] a1 = (((a1 / 5) + 110755) + 220746) [L256] a10 = 1 [L257] a19 = 8 [L259] RET return -1; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND TRUE (((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)) [L181] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 7.2s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 5.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 394 SDtfs, 1003 SDslu, 341 SDs, 0 SdLazy, 2118 SolverSat, 390 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 208 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=579occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 3 AbstIntIterations, 2 AbstIntStrong, 0.9965956841447806 AbsIntWeakeningRatio, 0.1691542288557214 AbsIntAvgWeakeningVarsNumRemoved, 15.278606965174129 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 15 StatesRemovedByMinimization, 2 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/Problem10_label02_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_07-44-52-788.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label02_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_07-44-52-788.csv Received shutdown request...