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_label56_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 07:46:50,100 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 07:46:50,106 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 07:46:50,124 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 07:46:50,124 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 07:46:50,126 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 07:46:50,127 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 07:46:50,132 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 07:46:50,134 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 07:46:50,134 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 07:46:50,135 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 07:46:50,137 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 07:46:50,138 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 07:46:50,140 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 07:46:50,144 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 07:46:50,145 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 07:46:50,147 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 07:46:50,149 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 07:46:50,161 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 07:46:50,162 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 07:46:50,163 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 07:46:50,165 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 07:46:50,167 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 07:46:50,167 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 07:46:50,167 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 07:46:50,168 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 07:46:50,169 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 07:46:50,172 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 07:46:50,173 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 07:46:50,174 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 07:46:50,174 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 07:46:50,178 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 07:46:50,179 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 07:46:50,179 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 07:46:50,180 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 07:46:50,181 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 07:46:50,181 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:46:50,196 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 07:46:50,196 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 07:46:50,197 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 07:46:50,197 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 07:46:50,198 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 07:46:50,198 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 07:46:50,198 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 07:46:50,198 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 07:46:50,199 INFO L133 SettingsManager]: * Abstract domain=CongruenceDomain [2018-09-19 07:46:50,199 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 07:46:50,199 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 07:46:50,199 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 07:46:50,199 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-19 07:46:50,200 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 07:46:50,200 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 07:46:50,201 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 07:46:50,201 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 07:46:50,201 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 07:46:50,201 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 07:46:50,202 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 07:46:50,202 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 07:46:50,202 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 07:46:50,202 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 07:46:50,202 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 07:46:50,203 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 07:46:50,203 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 07:46:50,203 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 07:46:50,203 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 07:46:50,204 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 07:46:50,204 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 07:46:50,204 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 07:46:50,204 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 07:46:50,204 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 07:46:50,205 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 07:46:50,205 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 07:46:50,257 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 07:46:50,271 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 07:46:50,275 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 07:46:50,277 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 07:46:50,277 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 07:46:50,278 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label56_true-unreach-call.c [2018-09-19 07:46:50,631 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9c0a53a9/a425b07cd6534c73ba7eeabee8f9e99e/FLAGfd1ab7363 [2018-09-19 07:46:50,905 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 07:46:50,906 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label56_true-unreach-call.c [2018-09-19 07:46:50,919 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9c0a53a9/a425b07cd6534c73ba7eeabee8f9e99e/FLAGfd1ab7363 [2018-09-19 07:46:50,942 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9c0a53a9/a425b07cd6534c73ba7eeabee8f9e99e [2018-09-19 07:46:50,955 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 07:46:50,959 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 07:46:50,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 07:46:50,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 07:46:50,968 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 07:46:50,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 07:46:50" (1/1) ... [2018-09-19 07:46:50,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64024991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:46:50, skipping insertion in model container [2018-09-19 07:46:50,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 07:46:50" (1/1) ... [2018-09-19 07:46:50,985 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 07:46:51,509 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 07:46:51,529 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 07:46:51,674 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 07:46:51,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:46:51 WrapperNode [2018-09-19 07:46:51,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 07:46:51,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 07:46:51,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 07:46:51,725 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 07:46:51,735 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:46:51" (1/1) ... [2018-09-19 07:46:51,762 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:46:51" (1/1) ... [2018-09-19 07:46:51,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 07:46:51,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 07:46:51,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 07:46:51,852 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 07:46:51,864 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:46:51" (1/1) ... [2018-09-19 07:46:51,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:46:51" (1/1) ... [2018-09-19 07:46:51,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:46:51" (1/1) ... [2018-09-19 07:46:51,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:46:51" (1/1) ... [2018-09-19 07:46:52,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:46:51" (1/1) ... [2018-09-19 07:46:52,146 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:46:51" (1/1) ... [2018-09-19 07:46:52,167 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:46:51" (1/1) ... [2018-09-19 07:46:52,188 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 07:46:52,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 07:46:52,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 07:46:52,189 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 07:46:52,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:46:51" (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:46:52,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 07:46:52,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 07:46:52,264 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 07:46:52,265 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 07:46:52,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 07:46:52,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 07:46:52,265 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 07:46:52,265 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 07:46:55,400 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 07:46:55,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 07:46:55 BoogieIcfgContainer [2018-09-19 07:46:55,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 07:46:55,402 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 07:46:55,402 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 07:46:55,406 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 07:46:55,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 07:46:50" (1/3) ... [2018-09-19 07:46:55,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6becd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 07:46:55, skipping insertion in model container [2018-09-19 07:46:55,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:46:51" (2/3) ... [2018-09-19 07:46:55,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6becd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 07:46:55, skipping insertion in model container [2018-09-19 07:46:55,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 07:46:55" (3/3) ... [2018-09-19 07:46:55,410 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label56_true-unreach-call.c [2018-09-19 07:46:55,418 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 07:46:55,428 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 07:46:55,481 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 07:46:55,482 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 07:46:55,482 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 07:46:55,483 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 07:46:55,483 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 07:46:55,483 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 07:46:55,483 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 07:46:55,483 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 07:46:55,484 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 07:46:55,510 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-19 07:46:55,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-19 07:46:55,519 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 07:46:55,520 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] [2018-09-19 07:46:55,521 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 07:46:55,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1189398212, now seen corresponding path program 1 times [2018-09-19 07:46:55,528 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 07:46:55,529 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-09-19 07:46:55,532 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [141], [143], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-19 07:46:55,560 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-19 07:46:55,561 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 07:46:55,691 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 07:46:55,693 INFO L272 AbstractInterpreter]: Visited 29 different actions 29 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 07:46:55,705 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 07:46:55,798 INFO L232 lantSequenceWeakener]: Weakened 27 states. On average, predicates are now at 73.65% of their original sizes. [2018-09-19 07:46:55,798 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 07:46:55,941 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 07:46:55,943 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 07:46:55,944 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-19 07:46:55,944 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 07:46:55,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-19 07:46:55,957 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-19 07:46:55,958 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-19 07:46:55,961 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 5 states. [2018-09-19 07:46:58,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 07:46:58,441 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-19 07:46:58,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-19 07:46:58,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-09-19 07:46:58,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 07:46:58,462 INFO L225 Difference]: With dead ends: 576 [2018-09-19 07:46:58,463 INFO L226 Difference]: Without dead ends: 358 [2018-09-19 07:46:58,470 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-19 07:46:58,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-19 07:46:58,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-19 07:46:58,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-19 07:46:58,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-19 07:46:58,540 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 30 [2018-09-19 07:46:58,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 07:46:58,541 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-19 07:46:58,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-19 07:46:58,541 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-19 07:46:58,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-09-19 07:46:58,547 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 07:46:58,547 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:58,547 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 07:46:58,548 INFO L82 PathProgramCache]: Analyzing trace with hash 160243507, now seen corresponding path program 1 times [2018-09-19 07:46:58,548 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 07:46:58,548 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 102 with the following transitions: [2018-09-19 07:46:58,549 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [141], [143], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [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:46:58,553 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-19 07:46:58,554 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 07:46:58,657 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 07:46:58,660 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:46:58,699 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 07:46:58,859 INFO L232 lantSequenceWeakener]: Weakened 98 states. On average, predicates are now at 75.5% of their original sizes. [2018-09-19 07:46:58,859 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 07:46:59,042 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 07:46:59,043 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 07:46:59,043 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 07:46:59,043 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 07:46:59,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 07:46:59,045 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 07:46:59,045 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-19 07:46:59,046 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 9 states. [2018-09-19 07:47:02,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 07:47:02,648 INFO L93 Difference]: Finished difference Result 798 states and 1291 transitions. [2018-09-19 07:47:02,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 07:47:02,651 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2018-09-19 07:47:02,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 07:47:02,658 INFO L225 Difference]: With dead ends: 798 [2018-09-19 07:47:02,658 INFO L226 Difference]: Without dead ends: 592 [2018-09-19 07:47:02,661 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 107 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-19 07:47:02,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-09-19 07:47:02,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 579. [2018-09-19 07:47:02,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-09-19 07:47:02,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 793 transitions. [2018-09-19 07:47:02,702 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 793 transitions. Word has length 101 [2018-09-19 07:47:02,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 07:47:02,703 INFO L480 AbstractCegarLoop]: Abstraction has 579 states and 793 transitions. [2018-09-19 07:47:02,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 07:47:02,704 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 793 transitions. [2018-09-19 07:47:02,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-19 07:47:02,708 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 07:47:02,708 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:02,708 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 07:47:02,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1268619912, now seen corresponding path program 1 times [2018-09-19 07:47:02,709 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 07:47:02,709 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2018-09-19 07:47:02,710 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [141], [143], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [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:47:02,713 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-19 07:47:02,713 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 07:47:02,762 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 07:47:02,763 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:47:02,803 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 07:47:02,837 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 07:47:02,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 07:47:02 BoogieIcfgContainer [2018-09-19 07:47:02,838 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 07:47:02,839 INFO L168 Benchmark]: Toolchain (without parser) took 11883.25 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 802.7 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -225.7 MB). Peak memory consumption was 577.0 MB. Max. memory is 7.1 GB. [2018-09-19 07:47:02,840 INFO L168 Benchmark]: CDTParser took 0.22 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:47:02,841 INFO L168 Benchmark]: CACSL2BoogieTranslator took 763.76 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-19 07:47:02,842 INFO L168 Benchmark]: Boogie Procedure Inliner took 127.14 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:47:02,843 INFO L168 Benchmark]: Boogie Preprocessor took 336.76 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 802.7 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -894.6 MB). Peak memory consumption was 30.7 MB. Max. memory is 7.1 GB. [2018-09-19 07:47:02,844 INFO L168 Benchmark]: RCFGBuilder took 3212.14 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 109.2 MB). Peak memory consumption was 109.2 MB. Max. memory is 7.1 GB. [2018-09-19 07:47:02,845 INFO L168 Benchmark]: TraceAbstraction took 7435.96 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 506.9 MB). Peak memory consumption was 506.9 MB. Max. memory is 7.1 GB. [2018-09-19 07:47:02,850 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.22 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 763.76 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 127.14 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 336.76 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 802.7 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -894.6 MB). Peak memory consumption was 30.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3212.14 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 109.2 MB). Peak memory consumption was 109.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7435.96 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 506.9 MB). Peak memory consumption was 506.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 73]: 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 TRUE (((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)) [L73] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 7.3s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 6.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 394 SDtfs, 1074 SDslu, 349 SDs, 0 SdLazy, 2316 SolverSat, 391 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 136 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s 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.4s AbstIntTime, 3 AbstIntIterations, 2 AbstIntStrong, 0.9946956008767514 AbsIntWeakeningRatio, 0.26356589147286824 AbsIntAvgWeakeningVarsNumRemoved, 14.5968992248062 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_label56_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_07-47-02-865.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label56_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_07-47-02-865.csv Received shutdown request...