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/Problem01_label52_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 01:41:16,315 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 01:41:16,318 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 01:41:16,331 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 01:41:16,332 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 01:41:16,333 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 01:41:16,334 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 01:41:16,336 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 01:41:16,338 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 01:41:16,339 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 01:41:16,340 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 01:41:16,341 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 01:41:16,342 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 01:41:16,343 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 01:41:16,344 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 01:41:16,345 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 01:41:16,346 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 01:41:16,348 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 01:41:16,350 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 01:41:16,351 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 01:41:16,353 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 01:41:16,354 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 01:41:16,357 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 01:41:16,357 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 01:41:16,358 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 01:41:16,359 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 01:41:16,360 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 01:41:16,361 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 01:41:16,362 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 01:41:16,363 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 01:41:16,363 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 01:41:16,364 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 01:41:16,365 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 01:41:16,365 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 01:41:16,366 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 01:41:16,367 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 01:41:16,367 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 01:41:16,400 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 01:41:16,400 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 01:41:16,402 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 01:41:16,402 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 01:41:16,402 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 01:41:16,402 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 01:41:16,403 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 01:41:16,403 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-19 01:41:16,403 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 01:41:16,403 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 01:41:16,404 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 01:41:16,404 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-19 01:41:16,405 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 01:41:16,405 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 01:41:16,406 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 01:41:16,406 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 01:41:16,406 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 01:41:16,406 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 01:41:16,406 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 01:41:16,408 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 01:41:16,408 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 01:41:16,409 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 01:41:16,409 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 01:41:16,409 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 01:41:16,409 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 01:41:16,410 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 01:41:16,410 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 01:41:16,410 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 01:41:16,410 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 01:41:16,410 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 01:41:16,411 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 01:41:16,411 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 01:41:16,411 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 01:41:16,411 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 01:41:16,486 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 01:41:16,504 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 01:41:16,511 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 01:41:16,513 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 01:41:16,513 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 01:41:16,514 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label52_true-unreach-call_false-termination.c [2018-09-19 01:41:16,929 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5f93060d/77c0490768e2409c8c53d35b87308a64/FLAGb03a19595 [2018-09-19 01:41:17,201 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 01:41:17,204 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label52_true-unreach-call_false-termination.c [2018-09-19 01:41:17,230 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5f93060d/77c0490768e2409c8c53d35b87308a64/FLAGb03a19595 [2018-09-19 01:41:17,246 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5f93060d/77c0490768e2409c8c53d35b87308a64 [2018-09-19 01:41:17,258 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 01:41:17,262 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 01:41:17,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 01:41:17,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 01:41:17,271 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 01:41:17,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 01:41:17" (1/1) ... [2018-09-19 01:41:17,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cd34c06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:41:17, skipping insertion in model container [2018-09-19 01:41:17,277 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 01:41:17" (1/1) ... [2018-09-19 01:41:17,290 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 01:41:17,831 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 01:41:17,864 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 01:41:18,028 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 01:41:18,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:41:18 WrapperNode [2018-09-19 01:41:18,073 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 01:41:18,074 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 01:41:18,074 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 01:41:18,074 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 01:41:18,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:41:18" (1/1) ... [2018-09-19 01:41:18,119 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:41:18" (1/1) ... [2018-09-19 01:41:18,207 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 01:41:18,207 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 01:41:18,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 01:41:18,208 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 01:41:18,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:41:18" (1/1) ... [2018-09-19 01:41:18,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:41:18" (1/1) ... [2018-09-19 01:41:18,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:41:18" (1/1) ... [2018-09-19 01:41:18,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:41:18" (1/1) ... [2018-09-19 01:41:18,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:41:18" (1/1) ... [2018-09-19 01:41:18,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:41:18" (1/1) ... [2018-09-19 01:41:18,474 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:41:18" (1/1) ... [2018-09-19 01:41:18,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 01:41:18,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 01:41:18,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 01:41:18,496 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 01:41:18,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:41:18" (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 01:41:18,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 01:41:18,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 01:41:18,578 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 01:41:18,578 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 01:41:18,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 01:41:18,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 01:41:18,578 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 01:41:18,578 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 01:41:21,948 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 01:41:21,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 01:41:21 BoogieIcfgContainer [2018-09-19 01:41:21,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 01:41:21,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 01:41:21,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 01:41:21,954 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 01:41:21,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 01:41:17" (1/3) ... [2018-09-19 01:41:21,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19be326f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 01:41:21, skipping insertion in model container [2018-09-19 01:41:21,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:41:18" (2/3) ... [2018-09-19 01:41:21,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19be326f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 01:41:21, skipping insertion in model container [2018-09-19 01:41:21,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 01:41:21" (3/3) ... [2018-09-19 01:41:21,959 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label52_true-unreach-call_false-termination.c [2018-09-19 01:41:21,969 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 01:41:21,979 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 01:41:22,037 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 01:41:22,038 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 01:41:22,038 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 01:41:22,038 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 01:41:22,039 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 01:41:22,039 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 01:41:22,039 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 01:41:22,039 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 01:41:22,040 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 01:41:22,071 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-09-19 01:41:22,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-09-19 01:41:22,093 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 01:41:22,095 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:41:22,096 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 01:41:22,102 INFO L82 PathProgramCache]: Analyzing trace with hash -197406427, now seen corresponding path program 1 times [2018-09-19 01:41:22,105 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 01:41:22,106 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 134 with the following transitions: [2018-09-19 01:41:22,110 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [697], [701], [703], [761], [765], [771], [775], [782], [783], [784], [786] [2018-09-19 01:41:22,191 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 01:41:22,191 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 01:41:39,688 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 01:41:39,690 INFO L272 AbstractInterpreter]: Visited 67 different actions 67 times. Never merged. Never widened. Never found a fixpoint. Largest state had 41 variables. [2018-09-19 01:41:39,707 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 01:41:42,029 INFO L232 lantSequenceWeakener]: Weakened 66 states. On average, predicates are now at 79.62% of their original sizes. [2018-09-19 01:41:42,030 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 01:41:43,423 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 01:41:43,425 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 01:41:43,426 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 01:41:43,426 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 01:41:43,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 01:41:43,441 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 01:41:43,442 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-09-19 01:41:43,445 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 12 states. [2018-09-19 01:41:50,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 01:41:50,478 INFO L93 Difference]: Finished difference Result 475 states and 794 transitions. [2018-09-19 01:41:50,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-19 01:41:50,481 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 133 [2018-09-19 01:41:50,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 01:41:50,497 INFO L225 Difference]: With dead ends: 475 [2018-09-19 01:41:50,497 INFO L226 Difference]: Without dead ends: 265 [2018-09-19 01:41:50,503 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 138 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2018-09-19 01:41:50,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-09-19 01:41:50,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2018-09-19 01:41:50,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-09-19 01:41:50,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 397 transitions. [2018-09-19 01:41:50,573 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 397 transitions. Word has length 133 [2018-09-19 01:41:50,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 01:41:50,574 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 397 transitions. [2018-09-19 01:41:50,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 01:41:50,574 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 397 transitions. [2018-09-19 01:41:50,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-19 01:41:50,580 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 01:41:50,580 INFO L376 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 01:41:50,581 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 01:41:50,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1412389342, now seen corresponding path program 1 times [2018-09-19 01:41:50,581 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 01:41:50,582 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 143 with the following transitions: [2018-09-19 01:41:50,582 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [697], [701], [703], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-09-19 01:41:50,591 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 01:41:50,591 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 01:42:38,839 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 01:42:38,840 INFO L272 AbstractInterpreter]: Visited 136 different actions 201 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-09-19 01:42:38,846 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 01:42:42,256 INFO L232 lantSequenceWeakener]: Weakened 140 states. On average, predicates are now at 80.84% of their original sizes. [2018-09-19 01:42:42,257 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 01:42:43,370 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 01:42:43,371 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 01:42:43,371 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-19 01:42:43,371 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 01:42:43,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 01:42:43,373 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 01:42:43,373 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-09-19 01:42:43,374 INFO L87 Difference]: Start difference. First operand 265 states and 397 transitions. Second operand 14 states. [2018-09-19 01:42:50,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 01:42:50,006 INFO L93 Difference]: Finished difference Result 608 states and 996 transitions. [2018-09-19 01:42:50,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-19 01:42:50,007 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 142 [2018-09-19 01:42:50,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 01:42:50,011 INFO L225 Difference]: With dead ends: 608 [2018-09-19 01:42:50,011 INFO L226 Difference]: Without dead ends: 410 [2018-09-19 01:42:50,016 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 156 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2018-09-19 01:42:50,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-09-19 01:42:50,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 403. [2018-09-19 01:42:50,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-09-19 01:42:50,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 549 transitions. [2018-09-19 01:42:50,054 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 549 transitions. Word has length 142 [2018-09-19 01:42:50,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 01:42:50,055 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 549 transitions. [2018-09-19 01:42:50,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 01:42:50,056 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 549 transitions. [2018-09-19 01:42:50,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-09-19 01:42:50,061 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 01:42:50,062 INFO L376 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 01:42:50,062 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 01:42:50,062 INFO L82 PathProgramCache]: Analyzing trace with hash 957314258, now seen corresponding path program 1 times [2018-09-19 01:42:50,066 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 01:42:50,067 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2018-09-19 01:42:50,067 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [697], [701], [703], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-09-19 01:42:50,074 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 01:42:50,075 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 01:43:35,781 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 01:43:35,781 INFO L272 AbstractInterpreter]: Visited 136 different actions 200 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-09-19 01:43:35,820 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 01:43:39,361 INFO L232 lantSequenceWeakener]: Weakened 143 states. On average, predicates are now at 80.82% of their original sizes. [2018-09-19 01:43:39,362 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 01:43:40,387 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 01:43:40,388 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 01:43:40,389 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-19 01:43:40,389 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 01:43:40,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 01:43:40,390 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 01:43:40,391 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-09-19 01:43:40,391 INFO L87 Difference]: Start difference. First operand 403 states and 549 transitions. Second operand 14 states. [2018-09-19 01:43:54,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 01:43:54,784 INFO L93 Difference]: Finished difference Result 1242 states and 2111 transitions. [2018-09-19 01:43:54,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-19 01:43:54,789 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 145 [2018-09-19 01:43:54,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 01:43:54,797 INFO L225 Difference]: With dead ends: 1242 [2018-09-19 01:43:54,797 INFO L226 Difference]: Without dead ends: 1044 [2018-09-19 01:43:54,800 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 168 GetRequests, 127 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=296, Invalid=1110, Unknown=0, NotChecked=0, Total=1406 [2018-09-19 01:43:54,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2018-09-19 01:43:54,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 1033. [2018-09-19 01:43:54,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1033 states. [2018-09-19 01:43:54,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1227 transitions. [2018-09-19 01:43:54,881 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1227 transitions. Word has length 145 [2018-09-19 01:43:54,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 01:43:54,882 INFO L480 AbstractCegarLoop]: Abstraction has 1033 states and 1227 transitions. [2018-09-19 01:43:54,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 01:43:54,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1227 transitions. [2018-09-19 01:43:54,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-09-19 01:43:54,885 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 01:43:54,886 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2018-09-19 01:43:54,886 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 01:43:54,886 INFO L82 PathProgramCache]: Analyzing trace with hash -49949419, now seen corresponding path program 1 times [2018-09-19 01:43:54,887 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 01:43:54,887 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 155 with the following transitions: [2018-09-19 01:43:54,887 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [697], [701], [703], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-09-19 01:43:54,893 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 01:43:54,893 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 01:45:09,407 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 01:45:09,408 INFO L272 AbstractInterpreter]: Visited 137 different actions 341 times. Merged at 7 different actions 17 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 42 variables. [2018-09-19 01:45:09,413 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 01:45:12,763 INFO L232 lantSequenceWeakener]: Weakened 152 states. On average, predicates are now at 80.8% of their original sizes. [2018-09-19 01:45:12,764 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 01:45:13,637 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 01:45:13,638 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 01:45:13,638 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-19 01:45:13,638 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 01:45:13,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 01:45:13,639 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 01:45:13,639 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-09-19 01:45:13,639 INFO L87 Difference]: Start difference. First operand 1033 states and 1227 transitions. Second operand 14 states. [2018-09-19 01:45:26,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 01:45:26,669 INFO L93 Difference]: Finished difference Result 2017 states and 2520 transitions. [2018-09-19 01:45:26,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-19 01:45:26,670 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 154 [2018-09-19 01:45:26,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 01:45:26,677 INFO L225 Difference]: With dead ends: 2017 [2018-09-19 01:45:26,677 INFO L226 Difference]: Without dead ends: 1189 [2018-09-19 01:45:26,680 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 176 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=291, Invalid=1041, Unknown=0, NotChecked=0, Total=1332 [2018-09-19 01:45:26,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2018-09-19 01:45:26,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1171. [2018-09-19 01:45:26,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1171 states. [2018-09-19 01:45:26,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1382 transitions. [2018-09-19 01:45:26,738 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1382 transitions. Word has length 154 [2018-09-19 01:45:26,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 01:45:26,739 INFO L480 AbstractCegarLoop]: Abstraction has 1171 states and 1382 transitions. [2018-09-19 01:45:26,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 01:45:26,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1382 transitions. [2018-09-19 01:45:26,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-09-19 01:45:26,743 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 01:45:26,743 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:45:26,744 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 01:45:26,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1938699506, now seen corresponding path program 1 times [2018-09-19 01:45:26,744 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 01:45:26,744 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 176 with the following transitions: [2018-09-19 01:45:26,745 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [697], [701], [703], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-09-19 01:45:26,750 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 01:45:26,750 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) Received shutdown request... [2018-09-19 01:45:42,132 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-19 01:45:42,133 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-19 01:45:42,134 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 01:45:42,179 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 01:45:42,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 01:45:42 BoogieIcfgContainer [2018-09-19 01:45:42,180 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 01:45:42,181 INFO L168 Benchmark]: Toolchain (without parser) took 264921.78 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 1.6 GB in the end (delta: -140.8 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-19 01:45:42,184 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 01:45:42,185 INFO L168 Benchmark]: CACSL2BoogieTranslator took 810.03 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 01:45:42,186 INFO L168 Benchmark]: Boogie Procedure Inliner took 133.15 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 01:45:42,188 INFO L168 Benchmark]: Boogie Preprocessor took 287.66 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -836.2 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2018-09-19 01:45:42,190 INFO L168 Benchmark]: RCFGBuilder took 3454.26 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: 109.1 MB). Peak memory consumption was 109.1 MB. Max. memory is 7.1 GB. [2018-09-19 01:45:42,191 INFO L168 Benchmark]: TraceAbstraction took 260229.18 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 1.6 GB in the end (delta: 533.4 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-19 01:45:42,198 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 810.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 133.15 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 287.66 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -836.2 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3454.26 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: 109.1 MB). Peak memory consumption was 109.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 260229.18 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 1.6 GB in the end (delta: 533.4 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 554]: 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 a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND TRUE ((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1))))) [L215] a17 = 0 [L216] a16 = 6 [L217] RET return 22; [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L403] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L406] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L409] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L412] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L415] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L418] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L421] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L424] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L427] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L430] COND FALSE !((((((((a17==1)&&!(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L433] COND FALSE !((((((((a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==6))&&(a21==1))) [L436] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L439] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L442] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L445] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L448] COND FALSE !((((((((a17==1)&&(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L451] COND FALSE !((((((((a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==6))&&(a21==1))) [L454] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==15))&&(a12==8))&&(a16==6))&&(a21==1))) [L457] COND FALSE !((((((((a17==1)&&(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L460] COND FALSE !((((((((a17==1)&&(a7==1))&&(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L463] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L466] COND FALSE !((((((((a17==1)&&(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L469] COND FALSE !((((((((a17==1)&&(a7==1))&&(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L472] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==6))&&(a21==1))) [L475] COND FALSE !((((((((a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L478] COND FALSE !((((((((a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L481] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==5))&&(a21==1))) [L484] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L487] COND FALSE !((((((((a17==1)&&(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L490] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==6))&&(a21==1))) [L493] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L496] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==6))&&(a21==1))) [L499] COND FALSE !((((((((a17==1)&&(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==5))&&(a21==1))) [L502] COND FALSE !((((((((a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L505] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L508] COND FALSE !((((((((a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==6))&&(a21==1))) [L511] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L514] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L517] COND FALSE !((((((((a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L520] COND FALSE !((((((((a17==1)&&!(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==5))&&(a21==1))) [L523] COND FALSE !((((((((a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L526] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==5))&&(a21==1))) [L529] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==5))&&(a21==1))) [L532] COND FALSE !((((((((a17==1)&&(a7==1))&&(a20==1))&&(a8==15))&&(a12==8))&&(a16==6))&&(a21==1))) [L535] COND FALSE !((((((((a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L538] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L541] COND FALSE !((((((((a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L544] COND FALSE !((((((((a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==6))&&(a21==1))) [L547] COND FALSE !((((((((a17==1)&&(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==5))&&(a21==1))) [L550] COND FALSE !((((((((a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L553] COND TRUE ((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==6))&&(a21==1)) [L554] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. UNKNOWN Result, 260.1s OverallTime, 5 OverallIterations, 3 TraceHistogramMax, 41.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 927 SDtfs, 3949 SDslu, 1242 SDs, 0 SdLazy, 7364 SolverSat, 846 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 33.3s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 638 GetRequests, 519 SyntacticMatches, 5 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1171occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 201.5s AbstIntTime, 5 AbstIntIterations, 4 AbstIntStrong, 0.9947999572100992 AbsIntWeakeningRatio, 0.20350877192982456 AbsIntAvgWeakeningVarsNumRemoved, 2658.452631578947 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 36 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: No data available, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem01_label52_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_01-45-42-223.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem01_label52_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_01-45-42-223.csv Completed graceful shutdown