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_INT-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label04_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 05:02:57,074 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 05:02:57,077 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 05:02:57,090 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 05:02:57,090 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 05:02:57,091 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 05:02:57,092 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 05:02:57,094 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 05:02:57,096 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 05:02:57,097 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 05:02:57,097 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 05:02:57,098 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 05:02:57,099 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 05:02:57,100 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 05:02:57,101 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 05:02:57,102 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 05:02:57,103 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 05:02:57,105 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 05:02:57,107 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 05:02:57,108 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 05:02:57,110 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 05:02:57,111 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 05:02:57,114 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 05:02:57,114 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 05:02:57,114 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 05:02:57,115 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 05:02:57,116 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 05:02:57,117 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 05:02:57,118 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 05:02:57,119 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 05:02:57,120 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 05:02:57,120 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 05:02:57,121 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 05:02:57,121 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 05:02:57,122 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 05:02:57,123 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 05:02:57,123 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf [2018-09-19 05:02:57,150 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 05:02:57,150 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 05:02:57,151 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 05:02:57,151 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 05:02:57,151 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 05:02:57,152 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 05:02:57,152 INFO L133 SettingsManager]: * Congruence Domain=false [2018-09-19 05:02:57,152 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 05:02:57,152 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 05:02:57,153 INFO L133 SettingsManager]: * Abstract domain=IntervalDomain [2018-09-19 05:02:57,153 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 05:02:57,153 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 05:02:57,153 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 05:02:57,154 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 05:02:57,154 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 05:02:57,157 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 05:02:57,157 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 05:02:57,158 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 05:02:57,158 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 05:02:57,158 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 05:02:57,158 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 05:02:57,158 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 05:02:57,159 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 05:02:57,159 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 05:02:57,159 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 05:02:57,159 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 05:02:57,161 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 05:02:57,161 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 05:02:57,161 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 05:02:57,162 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 05:02:57,162 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 05:02:57,162 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 05:02:57,162 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 05:02:57,163 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 05:02:57,163 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 05:02:57,229 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 05:02:57,244 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 05:02:57,251 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 05:02:57,252 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 05:02:57,253 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 05:02:57,254 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label04_true-unreach-call_false-termination.c [2018-09-19 05:02:57,612 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97073518f/824707bd1e3c44da80b681b3539d6f59/FLAG1d4326d05 [2018-09-19 05:02:57,910 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 05:02:57,910 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label04_true-unreach-call_false-termination.c [2018-09-19 05:02:57,928 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97073518f/824707bd1e3c44da80b681b3539d6f59/FLAG1d4326d05 [2018-09-19 05:02:57,946 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97073518f/824707bd1e3c44da80b681b3539d6f59 [2018-09-19 05:02:57,958 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 05:02:57,961 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 05:02:57,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 05:02:57,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 05:02:57,969 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 05:02:57,970 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 05:02:57" (1/1) ... [2018-09-19 05:02:57,973 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cedc78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 05:02:57, skipping insertion in model container [2018-09-19 05:02:57,974 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 05:02:57" (1/1) ... [2018-09-19 05:02:57,986 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 05:02:58,432 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 05:02:58,459 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 05:02:58,622 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 05:02:58,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 05:02:58 WrapperNode [2018-09-19 05:02:58,658 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 05:02:58,660 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 05:02:58,660 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 05:02:58,660 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 05:02:58,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 05:02:58" (1/1) ... [2018-09-19 05:02:58,688 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 05:02:58" (1/1) ... [2018-09-19 05:02:58,745 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 05:02:58,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 05:02:58,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 05:02:58,746 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 05:02:58,880 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 05:02:58" (1/1) ... [2018-09-19 05:02:58,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 05:02:58" (1/1) ... [2018-09-19 05:02:58,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 05:02:58" (1/1) ... [2018-09-19 05:02:58,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 05:02:58" (1/1) ... [2018-09-19 05:02:58,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 05:02:58" (1/1) ... [2018-09-19 05:02:58,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 05:02:58" (1/1) ... [2018-09-19 05:02:58,925 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 05:02:58" (1/1) ... [2018-09-19 05:02:58,934 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 05:02:58,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 05:02:58,935 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 05:02:58,935 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 05:02:58,936 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 05:02:58" (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 05:02:59,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 05:02:59,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 05:02:59,031 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 05:02:59,031 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 05:02:59,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 05:02:59,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 05:02:59,032 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 05:02:59,032 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 05:03:02,440 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 05:03:02,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 05:03:02 BoogieIcfgContainer [2018-09-19 05:03:02,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 05:03:02,442 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 05:03:02,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 05:03:02,446 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 05:03:02,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 05:02:57" (1/3) ... [2018-09-19 05:03:02,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e79933f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 05:03:02, skipping insertion in model container [2018-09-19 05:03:02,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 05:02:58" (2/3) ... [2018-09-19 05:03:02,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e79933f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 05:03:02, skipping insertion in model container [2018-09-19 05:03:02,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 05:03:02" (3/3) ... [2018-09-19 05:03:02,450 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label04_true-unreach-call_false-termination.c [2018-09-19 05:03:02,461 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 05:03:02,470 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 05:03:02,523 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 05:03:02,524 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 05:03:02,524 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 05:03:02,524 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 05:03:02,524 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 05:03:02,524 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 05:03:02,525 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 05:03:02,525 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 05:03:02,525 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 05:03:02,551 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-09-19 05:03:02,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-09-19 05:03:02,573 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 05:03:02,574 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] [2018-09-19 05:03:02,575 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 05:03:02,580 INFO L82 PathProgramCache]: Analyzing trace with hash -744241401, now seen corresponding path program 1 times [2018-09-19 05:03:02,582 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 05:03:02,583 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2018-09-19 05:03:02,586 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [575], [577], [867], [871], [877], [881], [888], [889], [890], [892] [2018-09-19 05:03:02,638 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 05:03:02,638 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 05:03:03,157 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 05:03:03,159 INFO L272 AbstractInterpreter]: Visited 112 different actions 112 times. Never merged. Never widened. Never found a fixpoint. Largest state had 37 variables. [2018-09-19 05:03:03,206 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 05:03:03,561 INFO L232 lantSequenceWeakener]: Weakened 110 states. On average, predicates are now at 80.83% of their original sizes. [2018-09-19 05:03:03,561 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 05:03:04,435 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 05:03:04,437 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 05:03:04,437 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 05:03:04,438 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 05:03:04,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 05:03:04,457 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 05:03:04,458 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-09-19 05:03:04,462 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 10 states. [2018-09-19 05:03:07,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 05:03:07,561 INFO L93 Difference]: Finished difference Result 622 states and 1061 transitions. [2018-09-19 05:03:07,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-19 05:03:07,565 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2018-09-19 05:03:07,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 05:03:07,584 INFO L225 Difference]: With dead ends: 622 [2018-09-19 05:03:07,585 INFO L226 Difference]: Without dead ends: 383 [2018-09-19 05:03:07,592 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 116 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-09-19 05:03:07,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-09-19 05:03:07,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 380. [2018-09-19 05:03:07,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-09-19 05:03:07,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 531 transitions. [2018-09-19 05:03:07,677 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 531 transitions. Word has length 113 [2018-09-19 05:03:07,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 05:03:07,679 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 531 transitions. [2018-09-19 05:03:07,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 05:03:07,680 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 531 transitions. [2018-09-19 05:03:07,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-09-19 05:03:07,688 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 05:03:07,691 INFO L376 BasicCegarLoop]: trace histogram [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] [2018-09-19 05:03:07,691 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 05:03:07,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1399311546, now seen corresponding path program 1 times [2018-09-19 05:03:07,696 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 05:03:07,696 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 124 with the following transitions: [2018-09-19 05:03:07,697 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [575], [577], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-19 05:03:07,702 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 05:03:07,703 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 05:03:07,998 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 05:03:07,998 INFO L272 AbstractInterpreter]: Visited 116 different actions 226 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-09-19 05:03:08,028 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 05:03:08,219 INFO L232 lantSequenceWeakener]: Weakened 120 states. On average, predicates are now at 80.86% of their original sizes. [2018-09-19 05:03:08,220 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 05:03:08,487 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 05:03:08,487 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 05:03:08,488 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 05:03:08,488 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 05:03:08,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 05:03:08,489 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 05:03:08,490 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 05:03:08,490 INFO L87 Difference]: Start difference. First operand 380 states and 531 transitions. Second operand 10 states. [2018-09-19 05:03:13,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 05:03:13,778 INFO L93 Difference]: Finished difference Result 906 states and 1350 transitions. [2018-09-19 05:03:13,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 05:03:13,782 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2018-09-19 05:03:13,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 05:03:13,789 INFO L225 Difference]: With dead ends: 906 [2018-09-19 05:03:13,790 INFO L226 Difference]: Without dead ends: 532 [2018-09-19 05:03:13,793 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 130 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 05:03:13,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2018-09-19 05:03:13,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 526. [2018-09-19 05:03:13,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2018-09-19 05:03:13,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 699 transitions. [2018-09-19 05:03:13,831 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 699 transitions. Word has length 123 [2018-09-19 05:03:13,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 05:03:13,832 INFO L480 AbstractCegarLoop]: Abstraction has 526 states and 699 transitions. [2018-09-19 05:03:13,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 05:03:13,832 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 699 transitions. [2018-09-19 05:03:13,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-09-19 05:03:13,836 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 05:03:13,837 INFO L376 BasicCegarLoop]: trace histogram [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] [2018-09-19 05:03:13,837 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 05:03:13,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1926572878, now seen corresponding path program 1 times [2018-09-19 05:03:13,837 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 05:03:13,838 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 128 with the following transitions: [2018-09-19 05:03:13,838 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [575], [577], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-19 05:03:13,842 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 05:03:13,843 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 05:03:14,035 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 05:03:14,036 INFO L272 AbstractInterpreter]: Visited 116 different actions 226 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-09-19 05:03:14,072 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 05:03:14,213 INFO L232 lantSequenceWeakener]: Weakened 124 states. On average, predicates are now at 80.85% of their original sizes. [2018-09-19 05:03:14,213 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 05:03:14,432 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 05:03:14,432 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 05:03:14,432 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 05:03:14,432 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 05:03:14,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 05:03:14,433 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 05:03:14,434 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 05:03:14,434 INFO L87 Difference]: Start difference. First operand 526 states and 699 transitions. Second operand 10 states. [2018-09-19 05:03:16,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 05:03:16,500 INFO L93 Difference]: Finished difference Result 1207 states and 1697 transitions. [2018-09-19 05:03:16,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 05:03:16,501 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 127 [2018-09-19 05:03:16,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 05:03:16,506 INFO L225 Difference]: With dead ends: 1207 [2018-09-19 05:03:16,507 INFO L226 Difference]: Without dead ends: 687 [2018-09-19 05:03:16,509 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 134 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 05:03:16,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-09-19 05:03:16,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 677. [2018-09-19 05:03:16,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2018-09-19 05:03:16,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 888 transitions. [2018-09-19 05:03:16,544 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 888 transitions. Word has length 127 [2018-09-19 05:03:16,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 05:03:16,545 INFO L480 AbstractCegarLoop]: Abstraction has 677 states and 888 transitions. [2018-09-19 05:03:16,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 05:03:16,545 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 888 transitions. [2018-09-19 05:03:16,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-19 05:03:16,551 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 05:03:16,551 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2018-09-19 05:03:16,551 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 05:03:16,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1557744187, now seen corresponding path program 1 times [2018-09-19 05:03:16,552 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 05:03:16,552 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 133 with the following transitions: [2018-09-19 05:03:16,553 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [575], [577], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-19 05:03:16,557 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 05:03:16,557 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 05:03:16,929 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 05:03:16,930 INFO L272 AbstractInterpreter]: Visited 117 different actions 342 times. Merged at 7 different actions 13 times. Never widened. Found 3 fixpoints after 1 different actions. Largest state had 38 variables. [2018-09-19 05:03:16,972 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 05:03:17,145 INFO L232 lantSequenceWeakener]: Weakened 129 states. On average, predicates are now at 80.88% of their original sizes. [2018-09-19 05:03:17,145 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 05:03:17,288 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 05:03:17,288 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 05:03:17,288 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 05:03:17,288 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 05:03:17,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 05:03:17,289 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 05:03:17,289 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 05:03:17,289 INFO L87 Difference]: Start difference. First operand 677 states and 888 transitions. Second operand 10 states. [2018-09-19 05:03:21,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 05:03:21,178 INFO L93 Difference]: Finished difference Result 1742 states and 2412 transitions. [2018-09-19 05:03:21,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 05:03:21,180 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 132 [2018-09-19 05:03:21,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 05:03:21,189 INFO L225 Difference]: With dead ends: 1742 [2018-09-19 05:03:21,190 INFO L226 Difference]: Without dead ends: 1071 [2018-09-19 05:03:21,192 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 140 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-09-19 05:03:21,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2018-09-19 05:03:21,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1054. [2018-09-19 05:03:21,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2018-09-19 05:03:21,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1343 transitions. [2018-09-19 05:03:21,242 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1343 transitions. Word has length 132 [2018-09-19 05:03:21,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 05:03:21,243 INFO L480 AbstractCegarLoop]: Abstraction has 1054 states and 1343 transitions. [2018-09-19 05:03:21,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 05:03:21,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1343 transitions. [2018-09-19 05:03:21,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-19 05:03:21,248 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 05:03:21,250 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2018-09-19 05:03:21,250 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 05:03:21,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1019542654, now seen corresponding path program 1 times [2018-09-19 05:03:21,251 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 05:03:21,251 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 147 with the following transitions: [2018-09-19 05:03:21,251 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [575], [577], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-19 05:03:21,259 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 05:03:21,259 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 05:03:21,579 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 05:03:21,579 INFO L272 AbstractInterpreter]: Visited 118 different actions 468 times. Merged at 8 different actions 29 times. Never widened. Found 8 fixpoints after 2 different actions. Largest state had 38 variables. [2018-09-19 05:03:21,595 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 05:03:21,758 INFO L232 lantSequenceWeakener]: Weakened 143 states. On average, predicates are now at 80.89% of their original sizes. [2018-09-19 05:03:21,758 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 05:03:22,296 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 05:03:22,297 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 05:03:22,297 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 05:03:22,297 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 05:03:22,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 05:03:22,298 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 05:03:22,298 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 05:03:22,298 INFO L87 Difference]: Start difference. First operand 1054 states and 1343 transitions. Second operand 10 states. [2018-09-19 05:03:25,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 05:03:25,154 INFO L93 Difference]: Finished difference Result 2400 states and 3169 transitions. [2018-09-19 05:03:25,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 05:03:25,156 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 146 [2018-09-19 05:03:25,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 05:03:25,162 INFO L225 Difference]: With dead ends: 2400 [2018-09-19 05:03:25,163 INFO L226 Difference]: Without dead ends: 1352 [2018-09-19 05:03:25,166 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 154 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-09-19 05:03:25,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2018-09-19 05:03:25,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1326. [2018-09-19 05:03:25,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1326 states. [2018-09-19 05:03:25,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 1676 transitions. [2018-09-19 05:03:25,204 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 1676 transitions. Word has length 146 [2018-09-19 05:03:25,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 05:03:25,205 INFO L480 AbstractCegarLoop]: Abstraction has 1326 states and 1676 transitions. [2018-09-19 05:03:25,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 05:03:25,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1676 transitions. [2018-09-19 05:03:25,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-09-19 05:03:25,209 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 05:03:25,209 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-19 05:03:25,210 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 05:03:25,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1108370218, now seen corresponding path program 1 times [2018-09-19 05:03:25,210 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 05:03:25,210 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 151 with the following transitions: [2018-09-19 05:03:25,211 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [575], [577], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-19 05:03:25,215 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 05:03:25,215 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 05:03:25,454 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 05:03:25,455 INFO L272 AbstractInterpreter]: Visited 118 different actions 344 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-09-19 05:03:25,493 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 05:03:25,527 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 05:03:25,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 05:03:25 BoogieIcfgContainer [2018-09-19 05:03:25,527 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 05:03:25,528 INFO L168 Benchmark]: Toolchain (without parser) took 27570.04 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -883.9 MB). Peak memory consumption was 216.0 MB. Max. memory is 7.1 GB. [2018-09-19 05:03:25,530 INFO L168 Benchmark]: CDTParser took 0.21 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 05:03:25,531 INFO L168 Benchmark]: CACSL2BoogieTranslator took 696.53 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-19 05:03:25,532 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 05:03:25,532 INFO L168 Benchmark]: Boogie Preprocessor took 188.50 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -826.5 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2018-09-19 05:03:25,534 INFO L168 Benchmark]: RCFGBuilder took 3506.96 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: 108.5 MB). Peak memory consumption was 108.5 MB. Max. memory is 7.1 GB. [2018-09-19 05:03:25,534 INFO L168 Benchmark]: TraceAbstraction took 23085.25 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 345.0 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -197.6 MB). Peak memory consumption was 147.3 MB. Max. memory is 7.1 GB. [2018-09-19 05:03:25,540 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.21 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 696.53 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 85.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 188.50 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -826.5 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3506.96 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: 108.5 MB). Peak memory consumption was 108.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23085.25 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 345.0 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -197.6 MB). Peak memory consumption was 147.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 490]: 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 e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND TRUE ((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))) [L51] a28 = 11 [L52] a25 = 1 [L53] RET return 26; [L614] EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) [L99] COND TRUE ((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1)) [L100] a17 = 7 [L101] a25 = 0 [L102] a11 = 1 [L103] a28 = 10 [L104] a19 = 0 [L105] RET return -1; [L614] EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L414] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) [L417] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) [L420] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) [L423] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L426] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) [L429] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) [L432] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7))) [L435] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) [L438] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) [L441] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==8))&&(a19==1))&&(a21==1))&&(a17==8))) [L444] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==11))&&!(a19==1))&&(a21==1))&&(a17==8))) [L447] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L450] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==8))&&(a19==1))&&(a21==1))&&(a17==7))) [L453] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7))) [L456] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==11))&&(a19==1))&&(a21==1))&&(a17==7))) [L459] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==8))&&(a19==1))&&(a21==1))&&(a17==7))) [L462] COND FALSE !((((((!(a25==1)&&!(a11==1))&&(a28==8))&&(a19==1))&&(a21==1))&&(a17==7))) [L465] COND FALSE !((((((!(a25==1)&&!(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) [L468] COND FALSE !((((((!(a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L471] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==8))&&(a19==1))&&(a21==1))&&(a17==8))) [L474] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==8))) [L477] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==7))) [L480] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==11))&&!(a19==1))&&(a21==1))&&(a17==8))) [L483] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==8))&&!(a19==1))&&(a21==1))&&(a17==8))) [L486] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==8))) [L489] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==7)) [L490] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. UNKNOWN Result, 23.0s OverallTime, 6 OverallIterations, 4 TraceHistogramMax, 17.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1101 SDtfs, 3364 SDslu, 1928 SDs, 0 SdLazy, 9010 SolverSat, 970 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.3s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 674 GetRequests, 596 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1326occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.2s AbstIntTime, 6 AbstIntIterations, 5 AbstIntStrong, 0.9972658344883648 AbsIntWeakeningRatio, 0.23113207547169812 AbsIntAvgWeakeningVarsNumRemoved, 31.095911949685533 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 62 StatesRemovedByMinimization, 5 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/Problem02_label04_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_05-03-25-567.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label04_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_05-03-25-567.csv Received shutdown request...