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_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label49_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 03:31:53,326 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 03:31:53,330 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 03:31:53,347 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 03:31:53,347 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 03:31:53,348 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 03:31:53,350 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 03:31:53,352 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 03:31:53,356 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 03:31:53,357 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 03:31:53,359 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 03:31:53,360 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 03:31:53,361 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 03:31:53,362 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 03:31:53,365 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 03:31:53,366 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 03:31:53,367 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 03:31:53,377 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 03:31:53,380 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 03:31:53,382 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 03:31:53,386 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 03:31:53,387 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 03:31:53,390 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 03:31:53,390 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 03:31:53,391 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 03:31:53,391 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 03:31:53,392 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 03:31:53,393 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 03:31:53,394 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 03:31:53,395 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 03:31:53,395 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 03:31:53,396 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 03:31:53,396 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 03:31:53,396 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 03:31:53,397 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 03:31:53,398 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 03:31:53,398 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf [2018-09-19 03:31:53,417 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 03:31:53,418 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 03:31:53,419 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 03:31:53,419 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 03:31:53,419 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 03:31:53,419 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 03:31:53,420 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 03:31:53,421 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-19 03:31:53,421 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 03:31:53,421 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 03:31:53,421 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 03:31:53,421 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-19 03:31:53,422 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 03:31:53,423 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 03:31:53,423 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 03:31:53,424 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 03:31:53,424 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 03:31:53,424 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 03:31:53,424 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 03:31:53,424 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 03:31:53,425 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 03:31:53,425 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 03:31:53,425 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 03:31:53,425 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 03:31:53,427 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 03:31:53,427 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 03:31:53,427 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 03:31:53,427 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 03:31:53,427 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 03:31:53,428 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 03:31:53,428 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 03:31:53,428 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 03:31:53,428 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 03:31:53,428 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 03:31:53,488 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 03:31:53,506 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 03:31:53,514 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 03:31:53,516 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 03:31:53,517 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 03:31:53,517 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label49_true-unreach-call.c [2018-09-19 03:31:53,902 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb95b5fc8/a017474cea904aa1bf986353550f7b98/FLAGb4a3bc20f [2018-09-19 03:31:54,193 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 03:31:54,194 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label49_true-unreach-call.c [2018-09-19 03:31:54,215 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb95b5fc8/a017474cea904aa1bf986353550f7b98/FLAGb4a3bc20f [2018-09-19 03:31:54,238 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb95b5fc8/a017474cea904aa1bf986353550f7b98 [2018-09-19 03:31:54,251 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 03:31:54,256 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 03:31:54,257 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 03:31:54,257 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 03:31:54,266 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 03:31:54,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:31:54" (1/1) ... [2018-09-19 03:31:54,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c4408f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:31:54, skipping insertion in model container [2018-09-19 03:31:54,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:31:54" (1/1) ... [2018-09-19 03:31:54,285 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 03:31:54,790 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 03:31:54,810 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 03:31:54,985 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 03:31:55,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:31:55 WrapperNode [2018-09-19 03:31:55,041 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 03:31:55,042 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 03:31:55,042 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 03:31:55,042 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 03:31:55,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:31:55" (1/1) ... [2018-09-19 03:31:55,086 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:31:55" (1/1) ... [2018-09-19 03:31:55,158 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 03:31:55,159 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 03:31:55,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 03:31:55,159 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 03:31:55,327 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:31:55" (1/1) ... [2018-09-19 03:31:55,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:31:55" (1/1) ... [2018-09-19 03:31:55,336 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:31:55" (1/1) ... [2018-09-19 03:31:55,340 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:31:55" (1/1) ... [2018-09-19 03:31:55,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:31:55" (1/1) ... [2018-09-19 03:31:55,402 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:31:55" (1/1) ... [2018-09-19 03:31:55,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:31:55" (1/1) ... [2018-09-19 03:31:55,431 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 03:31:55,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 03:31:55,432 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 03:31:55,432 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 03:31:55,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:31:55" (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 03:31:55,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 03:31:55,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 03:31:55,506 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 03:31:55,506 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 03:31:55,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 03:31:55,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 03:31:55,507 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 03:31:55,507 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 03:31:58,857 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 03:31:58,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:31:58 BoogieIcfgContainer [2018-09-19 03:31:58,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 03:31:58,861 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 03:31:58,863 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 03:31:58,868 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 03:31:58,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 03:31:54" (1/3) ... [2018-09-19 03:31:58,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbd3695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:31:58, skipping insertion in model container [2018-09-19 03:31:58,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:31:55" (2/3) ... [2018-09-19 03:31:58,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbd3695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:31:58, skipping insertion in model container [2018-09-19 03:31:58,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:31:58" (3/3) ... [2018-09-19 03:31:58,873 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label49_true-unreach-call.c [2018-09-19 03:31:58,885 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 03:31:58,899 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 03:31:58,963 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 03:31:58,964 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 03:31:58,964 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 03:31:58,964 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 03:31:58,964 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 03:31:58,965 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 03:31:58,965 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 03:31:58,965 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 03:31:58,965 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 03:31:59,000 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-19 03:31:59,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-19 03:31:59,011 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:31:59,012 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] [2018-09-19 03:31:59,014 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:31:59,022 INFO L82 PathProgramCache]: Analyzing trace with hash -654369111, now seen corresponding path program 1 times [2018-09-19 03:31:59,024 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:31:59,026 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-09-19 03:31:59,028 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [133], [135], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-19 03:31:59,094 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:31:59,094 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:32:00,095 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:32:00,097 INFO L272 AbstractInterpreter]: Visited 28 different actions 28 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 03:32:00,109 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:32:00,538 INFO L232 lantSequenceWeakener]: Weakened 27 states. On average, predicates are now at 74.37% of their original sizes. [2018-09-19 03:32:00,538 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:32:00,853 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:32:00,856 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:32:00,857 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 03:32:00,857 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:32:00,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 03:32:00,878 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 03:32:00,879 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 03:32:00,882 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-19 03:32:05,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:32:05,243 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-19 03:32:05,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 03:32:05,246 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-09-19 03:32:05,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:32:05,265 INFO L225 Difference]: With dead ends: 576 [2018-09-19 03:32:05,266 INFO L226 Difference]: Without dead ends: 358 [2018-09-19 03:32:05,274 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 03:32:05,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-19 03:32:05,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-19 03:32:05,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-19 03:32:05,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-19 03:32:05,356 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 29 [2018-09-19 03:32:05,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:32:05,357 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-19 03:32:05,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 03:32:05,357 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-19 03:32:05,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-19 03:32:05,362 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:32:05,363 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:32:05,363 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:32:05,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1781636261, now seen corresponding path program 1 times [2018-09-19 03:32:05,364 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:32:05,364 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2018-09-19 03:32:05,365 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [133], [135], [138], [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 03:32:05,372 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:32:05,372 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:32:06,870 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:32:10,023 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:32:10,023 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 03:32:10,039 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:32:10,817 INFO L232 lantSequenceWeakener]: Weakened 98 states. On average, predicates are now at 73.27% of their original sizes. [2018-09-19 03:32:10,817 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:32:11,424 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:32:11,425 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:32:11,425 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 03:32:11,425 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:32:11,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 03:32:11,427 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 03:32:11,427 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 03:32:11,427 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-19 03:32:19,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:32:19,687 INFO L93 Difference]: Finished difference Result 717 states and 1132 transitions. [2018-09-19 03:32:19,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 03:32:19,691 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 100 [2018-09-19 03:32:19,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:32:19,696 INFO L225 Difference]: With dead ends: 717 [2018-09-19 03:32:19,696 INFO L226 Difference]: Without dead ends: 511 [2018-09-19 03:32:19,698 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 106 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 03:32:19,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-09-19 03:32:19,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 505. [2018-09-19 03:32:19,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-09-19 03:32:19,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 659 transitions. [2018-09-19 03:32:19,739 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 659 transitions. Word has length 100 [2018-09-19 03:32:19,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:32:19,740 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 659 transitions. [2018-09-19 03:32:19,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 03:32:19,740 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 659 transitions. [2018-09-19 03:32:19,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-09-19 03:32:19,744 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:32:19,744 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:32:19,745 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:32:19,745 INFO L82 PathProgramCache]: Analyzing trace with hash -781565036, now seen corresponding path program 1 times [2018-09-19 03:32:19,745 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:32:19,745 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 110 with the following transitions: [2018-09-19 03:32:19,746 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [133], [135], [138], [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 03:32:19,751 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:32:19,752 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:32:24,613 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:32:26,375 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:32:26,375 INFO L272 AbstractInterpreter]: Visited 87 different actions 248 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 03:32:26,394 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:32:27,288 INFO L232 lantSequenceWeakener]: Weakened 107 states. On average, predicates are now at 73.23% of their original sizes. [2018-09-19 03:32:27,289 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:32:28,405 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:32:28,406 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:32:28,406 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 03:32:28,406 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:32:28,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 03:32:28,408 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 03:32:28,408 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 03:32:28,409 INFO L87 Difference]: Start difference. First operand 505 states and 659 transitions. Second operand 13 states. [2018-09-19 03:32:37,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:32:37,142 INFO L93 Difference]: Finished difference Result 1333 states and 2076 transitions. [2018-09-19 03:32:37,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-19 03:32:37,145 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 109 [2018-09-19 03:32:37,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:32:37,156 INFO L225 Difference]: With dead ends: 1333 [2018-09-19 03:32:37,156 INFO L226 Difference]: Without dead ends: 978 [2018-09-19 03:32:37,159 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 123 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2018-09-19 03:32:37,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2018-09-19 03:32:37,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 762. [2018-09-19 03:32:37,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2018-09-19 03:32:37,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 943 transitions. [2018-09-19 03:32:37,206 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 943 transitions. Word has length 109 [2018-09-19 03:32:37,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:32:37,207 INFO L480 AbstractCegarLoop]: Abstraction has 762 states and 943 transitions. [2018-09-19 03:32:37,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 03:32:37,207 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 943 transitions. [2018-09-19 03:32:37,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-09-19 03:32:37,213 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:32:37,214 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:32:37,214 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:32:37,214 INFO L82 PathProgramCache]: Analyzing trace with hash 7145116, now seen corresponding path program 1 times [2018-09-19 03:32:37,215 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:32:37,215 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2018-09-19 03:32:37,215 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [133], [135], [138], [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], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:32:37,222 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:32:37,223 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:32:40,311 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:32:47,426 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:32:47,427 INFO L272 AbstractInterpreter]: Visited 123 different actions 356 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 03:32:47,431 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:32:48,447 INFO L232 lantSequenceWeakener]: Weakened 143 states. On average, predicates are now at 73.1% of their original sizes. [2018-09-19 03:32:48,448 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:32:48,878 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:32:48,879 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:32:48,879 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 03:32:48,879 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:32:48,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 03:32:48,880 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 03:32:48,880 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-19 03:32:48,880 INFO L87 Difference]: Start difference. First operand 762 states and 943 transitions. Second operand 12 states. [2018-09-19 03:32:55,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:32:55,290 INFO L93 Difference]: Finished difference Result 1677 states and 2200 transitions. [2018-09-19 03:32:55,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 03:32:55,291 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 145 [2018-09-19 03:32:55,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:32:55,296 INFO L225 Difference]: With dead ends: 1677 [2018-09-19 03:32:55,297 INFO L226 Difference]: Without dead ends: 1067 [2018-09-19 03:32:55,299 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 153 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2018-09-19 03:32:55,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2018-09-19 03:32:55,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1056. [2018-09-19 03:32:55,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2018-09-19 03:32:55,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1277 transitions. [2018-09-19 03:32:55,340 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1277 transitions. Word has length 145 [2018-09-19 03:32:55,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:32:55,341 INFO L480 AbstractCegarLoop]: Abstraction has 1056 states and 1277 transitions. [2018-09-19 03:32:55,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 03:32:55,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1277 transitions. [2018-09-19 03:32:55,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-19 03:32:55,345 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:32:55,345 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:32:55,346 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:32:55,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1802704933, now seen corresponding path program 1 times [2018-09-19 03:32:55,346 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:32:55,346 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 165 with the following transitions: [2018-09-19 03:32:55,347 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [133], [135], [138], [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], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:32:55,353 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:32:55,353 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:33:05,178 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:33:05,178 INFO L272 AbstractInterpreter]: Visited 142 different actions 413 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 03:33:05,184 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:33:06,253 INFO L232 lantSequenceWeakener]: Weakened 162 states. On average, predicates are now at 73.06% of their original sizes. [2018-09-19 03:33:06,254 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:33:06,622 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:33:06,622 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:33:06,622 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 03:33:06,623 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:33:06,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 03:33:06,623 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 03:33:06,623 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-19 03:33:06,624 INFO L87 Difference]: Start difference. First operand 1056 states and 1277 transitions. Second operand 12 states. [2018-09-19 03:33:13,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:33:13,621 INFO L93 Difference]: Finished difference Result 2268 states and 2879 transitions. [2018-09-19 03:33:13,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-19 03:33:13,622 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 164 [2018-09-19 03:33:13,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:33:13,629 INFO L225 Difference]: With dead ends: 2268 [2018-09-19 03:33:13,629 INFO L226 Difference]: Without dead ends: 1364 [2018-09-19 03:33:13,632 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 173 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2018-09-19 03:33:13,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2018-09-19 03:33:13,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1352. [2018-09-19 03:33:13,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-09-19 03:33:13,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1605 transitions. [2018-09-19 03:33:13,687 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1605 transitions. Word has length 164 [2018-09-19 03:33:13,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:33:13,688 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 1605 transitions. [2018-09-19 03:33:13,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 03:33:13,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1605 transitions. [2018-09-19 03:33:13,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-19 03:33:13,691 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:33:13,692 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:33:13,692 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:33:13,693 INFO L82 PathProgramCache]: Analyzing trace with hash -611450754, now seen corresponding path program 1 times [2018-09-19 03:33:13,693 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:33:13,694 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 177 with the following transitions: [2018-09-19 03:33:13,694 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [133], [135], [138], [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], [499], [503], [507], [511], [515], [518], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:33:13,703 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:33:13,704 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:33:15,052 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:33:20,014 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:33:20,015 INFO L272 AbstractInterpreter]: Visited 84 different actions 323 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:33:20,021 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:33:21,031 INFO L232 lantSequenceWeakener]: Weakened 174 states. On average, predicates are now at 73.09% of their original sizes. [2018-09-19 03:33:21,032 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:33:21,365 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:33:21,366 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:33:21,366 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 03:33:21,366 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:33:21,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 03:33:21,367 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 03:33:21,367 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 03:33:21,367 INFO L87 Difference]: Start difference. First operand 1352 states and 1605 transitions. Second operand 10 states. [2018-09-19 03:33:27,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:33:27,798 INFO L93 Difference]: Finished difference Result 2719 states and 3368 transitions. [2018-09-19 03:33:27,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 03:33:27,807 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 176 [2018-09-19 03:33:27,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:33:27,817 INFO L225 Difference]: With dead ends: 2719 [2018-09-19 03:33:27,817 INFO L226 Difference]: Without dead ends: 1521 [2018-09-19 03:33:27,826 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 183 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 03:33:27,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2018-09-19 03:33:27,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1503. [2018-09-19 03:33:27,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2018-09-19 03:33:27,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1772 transitions. [2018-09-19 03:33:27,884 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1772 transitions. Word has length 176 [2018-09-19 03:33:27,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:33:27,884 INFO L480 AbstractCegarLoop]: Abstraction has 1503 states and 1772 transitions. [2018-09-19 03:33:27,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 03:33:27,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1772 transitions. [2018-09-19 03:33:27,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-09-19 03:33:27,888 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:33:27,888 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 03:33:27,888 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:33:27,888 INFO L82 PathProgramCache]: Analyzing trace with hash -714047781, now seen corresponding path program 1 times [2018-09-19 03:33:27,889 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:33:27,889 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 188 with the following transitions: [2018-09-19 03:33:27,889 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [133], [135], [138], [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], [526], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:33:27,892 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:33:27,892 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:33:31,272 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:33:35,296 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 03:33:35,297 INFO L272 AbstractInterpreter]: Visited 89 different actions 343 times. Merged at 7 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 03:33:35,306 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 03:33:35,342 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 03:33:35,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 03:33:35 BoogieIcfgContainer [2018-09-19 03:33:35,343 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 03:33:35,344 INFO L168 Benchmark]: Toolchain (without parser) took 101092.30 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.2 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-19 03:33:35,350 INFO L168 Benchmark]: CDTParser took 0.23 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 03:33:35,351 INFO L168 Benchmark]: CACSL2BoogieTranslator took 784.46 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 03:33:35,351 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.75 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 03:33:35,352 INFO L168 Benchmark]: Boogie Preprocessor took 272.36 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -841.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2018-09-19 03:33:35,353 INFO L168 Benchmark]: RCFGBuilder took 3428.04 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: 110.3 MB). Peak memory consumption was 110.3 MB. Max. memory is 7.1 GB. [2018-09-19 03:33:35,354 INFO L168 Benchmark]: TraceAbstraction took 96482.23 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-09-19 03:33:35,363 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.23 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 784.46 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 116.75 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 272.36 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -841.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3428.04 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: 110.3 MB). Peak memory consumption was 110.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 96482.23 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 70]: 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, 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 TRUE (((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0)) [L245] a1 = (((((a1 % 25)- -13) - 42605) / 5) - -8517) [L246] a10 = 3 [L248] RET return 26; [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 TRUE (((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)) [L70] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 96.3s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 41.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1242 SDtfs, 4275 SDslu, 2219 SDs, 0 SdLazy, 11416 SolverSat, 1147 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 35.7s Time, PredicateUnifierStatistics: 12 DeclaredPredicates, 766 GetRequests, 666 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1503occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 46.2s AbstIntTime, 7 AbstIntIterations, 6 AbstIntStrong, 0.9922581738799676 AbsIntWeakeningRatio, 0.16736401673640167 AbsIntAvgWeakeningVarsNumRemoved, 877.6666666666666 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 265 StatesRemovedByMinimization, 6 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_label49_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_03-33-35-389.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label49_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_03-33-35-389.csv Received shutdown request...