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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label56_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 01:21:41,113 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 01:21:41,118 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 01:21:41,133 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 01:21:41,133 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 01:21:41,134 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 01:21:41,135 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 01:21:41,137 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 01:21:41,139 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 01:21:41,140 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 01:21:41,141 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 01:21:41,141 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 01:21:41,142 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 01:21:41,143 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 01:21:41,144 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 01:21:41,145 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 01:21:41,146 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 01:21:41,148 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 01:21:41,150 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 01:21:41,151 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 01:21:41,153 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 01:21:41,154 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 01:21:41,156 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 01:21:41,157 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 01:21:41,157 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 01:21:41,158 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 01:21:41,159 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 01:21:41,160 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 01:21:41,161 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 01:21:41,162 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 01:21:41,162 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 01:21:41,163 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 01:21:41,163 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 01:21:41,163 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 01:21:41,164 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 01:21:41,165 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 01:21:41,165 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 01:21:41,196 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 01:21:41,197 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 01:21:41,198 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 01:21:41,198 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 01:21:41,198 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 01:21:41,198 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 01:21:41,198 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 01:21:41,199 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 01:21:41,199 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 01:21:41,199 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 01:21:41,199 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 01:21:41,199 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 01:21:41,200 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 01:21:41,201 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 01:21:41,201 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 01:21:41,201 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 01:21:41,201 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 01:21:41,201 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 01:21:41,202 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 01:21:41,202 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 01:21:41,202 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 01:21:41,202 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 01:21:41,202 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 01:21:41,204 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 01:21:41,204 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 01:21:41,204 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 01:21:41,204 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 01:21:41,205 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 01:21:41,205 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 01:21:41,205 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 01:21:41,205 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 01:21:41,205 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 01:21:41,205 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 01:21:41,206 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 01:21:41,258 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 01:21:41,274 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 01:21:41,278 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 01:21:41,280 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 01:21:41,280 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 01:21:41,281 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label56_true-unreach-call_false-termination.c [2018-11-07 01:21:41,350 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f976891f/9c00174ed9b947d8927884101b654e79/FLAG0e878ca06 [2018-11-07 01:21:41,951 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 01:21:41,953 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label56_true-unreach-call_false-termination.c [2018-11-07 01:21:41,978 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f976891f/9c00174ed9b947d8927884101b654e79/FLAG0e878ca06 [2018-11-07 01:21:41,998 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f976891f/9c00174ed9b947d8927884101b654e79 [2018-11-07 01:21:42,011 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 01:21:42,014 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 01:21:42,015 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 01:21:42,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 01:21:42,022 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 01:21:42,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:21:42" (1/1) ... [2018-11-07 01:21:42,027 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49b7df7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:21:42, skipping insertion in model container [2018-11-07 01:21:42,028 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:21:42" (1/1) ... [2018-11-07 01:21:42,040 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 01:21:42,124 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 01:21:42,673 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 01:21:42,678 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 01:21:42,811 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 01:21:42,831 INFO L193 MainTranslator]: Completed translation [2018-11-07 01:21:42,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:21:42 WrapperNode [2018-11-07 01:21:42,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 01:21:42,833 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 01:21:42,833 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 01:21:42,833 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 01:21:42,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:21:42" (1/1) ... [2018-11-07 01:21:42,973 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:21:42" (1/1) ... [2018-11-07 01:21:42,983 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 01:21:42,983 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 01:21:42,983 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 01:21:42,984 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 01:21:42,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:21:42" (1/1) ... [2018-11-07 01:21:42,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:21:42" (1/1) ... [2018-11-07 01:21:43,009 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:21:42" (1/1) ... [2018-11-07 01:21:43,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:21:42" (1/1) ... [2018-11-07 01:21:43,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:21:42" (1/1) ... [2018-11-07 01:21:43,080 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:21:42" (1/1) ... [2018-11-07 01:21:43,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:21:42" (1/1) ... [2018-11-07 01:21:43,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 01:21:43,090 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 01:21:43,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 01:21:43,091 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 01:21:43,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:21:42" (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-11-07 01:21:43,176 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 01:21:43,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 01:21:43,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 01:21:43,177 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 01:21:43,177 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 01:21:43,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 01:21:43,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 01:21:43,180 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 01:21:43,180 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 01:21:46,323 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 01:21:46,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:21:46 BoogieIcfgContainer [2018-11-07 01:21:46,325 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 01:21:46,326 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 01:21:46,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 01:21:46,329 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 01:21:46,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:21:42" (1/3) ... [2018-11-07 01:21:46,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca5f8a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:21:46, skipping insertion in model container [2018-11-07 01:21:46,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:21:42" (2/3) ... [2018-11-07 01:21:46,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca5f8a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:21:46, skipping insertion in model container [2018-11-07 01:21:46,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:21:46" (3/3) ... [2018-11-07 01:21:46,334 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label56_true-unreach-call_false-termination.c [2018-11-07 01:21:46,344 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 01:21:46,354 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 01:21:46,372 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 01:21:46,411 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 01:21:46,412 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 01:21:46,412 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 01:21:46,412 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 01:21:46,412 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 01:21:46,413 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 01:21:46,413 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 01:21:46,413 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 01:21:46,442 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-07 01:21:46,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-07 01:21:46,458 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:21:46,459 INFO L375 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] [2018-11-07 01:21:46,462 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:21:46,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:21:46,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1901339872, now seen corresponding path program 1 times [2018-11-07 01:21:46,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:21:46,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:21:46,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:21:46,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:21:46,527 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:21:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:21:47,120 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 01:21:47,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:21:47,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 01:21:47,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 01:21:47,196 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:21:47,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 01:21:47,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 01:21:47,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 01:21:47,222 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-07 01:21:48,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:21:48,716 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-11-07 01:21:48,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 01:21:48,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2018-11-07 01:21:48,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:21:48,740 INFO L225 Difference]: With dead ends: 621 [2018-11-07 01:21:48,740 INFO L226 Difference]: Without dead ends: 382 [2018-11-07 01:21:48,747 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 01:21:48,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-07 01:21:48,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-11-07 01:21:48,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-07 01:21:48,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-11-07 01:21:48,835 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 130 [2018-11-07 01:21:48,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:21:48,837 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-11-07 01:21:48,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 01:21:48,837 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-11-07 01:21:48,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-07 01:21:48,844 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:21:48,844 INFO L375 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] [2018-11-07 01:21:48,845 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:21:48,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:21:48,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1819679469, now seen corresponding path program 1 times [2018-11-07 01:21:48,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:21:48,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:21:48,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:21:48,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:21:48,847 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:21:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:21:49,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:21:49,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 01:21:49,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 01:21:49,313 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:21:49,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 01:21:49,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 01:21:49,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 01:21:49,316 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-11-07 01:21:50,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:21:50,708 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-11-07 01:21:50,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 01:21:50,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2018-11-07 01:21:50,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:21:50,713 INFO L225 Difference]: With dead ends: 903 [2018-11-07 01:21:50,713 INFO L226 Difference]: Without dead ends: 381 [2018-11-07 01:21:50,720 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 01:21:50,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-11-07 01:21:50,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-11-07 01:21:50,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-11-07 01:21:50,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-11-07 01:21:50,749 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 139 [2018-11-07 01:21:50,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:21:50,749 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-11-07 01:21:50,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 01:21:50,750 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-11-07 01:21:50,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-07 01:21:50,754 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:21:50,754 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 01:21:50,754 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:21:50,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:21:50,755 INFO L82 PathProgramCache]: Analyzing trace with hash 484067553, now seen corresponding path program 1 times [2018-11-07 01:21:50,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:21:50,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:21:50,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:21:50,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:21:50,757 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:21:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:21:51,264 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:21:51,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 01:21:51,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 01:21:51,265 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:21:51,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 01:21:51,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 01:21:51,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 01:21:51,267 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-11-07 01:21:52,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:21:52,968 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-11-07 01:21:52,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 01:21:52,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2018-11-07 01:21:52,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:21:52,975 INFO L225 Difference]: With dead ends: 901 [2018-11-07 01:21:52,975 INFO L226 Difference]: Without dead ends: 380 [2018-11-07 01:21:52,981 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 01:21:52,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-11-07 01:21:53,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-11-07 01:21:53,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-07 01:21:53,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-11-07 01:21:53,021 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 145 [2018-11-07 01:21:53,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:21:53,022 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-11-07 01:21:53,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 01:21:53,022 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-11-07 01:21:53,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-07 01:21:53,025 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:21:53,026 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 01:21:53,026 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:21:53,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:21:53,026 INFO L82 PathProgramCache]: Analyzing trace with hash 191966186, now seen corresponding path program 1 times [2018-11-07 01:21:53,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:21:53,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:21:53,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:21:53,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:21:53,028 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:21:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:21:53,280 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 01:21:53,657 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:21:53,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 01:21:53,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 01:21:53,658 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:21:53,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 01:21:53,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 01:21:53,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 01:21:53,660 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-11-07 01:21:56,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:21:56,264 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-11-07 01:21:56,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 01:21:56,267 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2018-11-07 01:21:56,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:21:56,273 INFO L225 Difference]: With dead ends: 1193 [2018-11-07 01:21:56,273 INFO L226 Difference]: Without dead ends: 819 [2018-11-07 01:21:56,275 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 01:21:56,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-11-07 01:21:56,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-11-07 01:21:56,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-11-07 01:21:56,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-11-07 01:21:56,308 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 153 [2018-11-07 01:21:56,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:21:56,309 INFO L480 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-11-07 01:21:56,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 01:21:56,309 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-11-07 01:21:56,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-07 01:21:56,312 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:21:56,313 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 01:21:56,313 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:21:56,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:21:56,313 INFO L82 PathProgramCache]: Analyzing trace with hash -684578330, now seen corresponding path program 1 times [2018-11-07 01:21:56,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:21:56,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:21:56,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:21:56,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:21:56,315 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:21:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:21:56,549 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:21:56,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 01:21:56,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 01:21:56,550 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:21:56,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 01:21:56,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 01:21:56,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 01:21:56,551 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-11-07 01:21:57,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:21:57,537 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-11-07 01:21:57,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 01:21:57,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2018-11-07 01:21:57,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:21:57,545 INFO L225 Difference]: With dead ends: 1753 [2018-11-07 01:21:57,546 INFO L226 Difference]: Without dead ends: 804 [2018-11-07 01:21:57,550 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 01:21:57,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-11-07 01:21:57,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-11-07 01:21:57,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-11-07 01:21:57,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-11-07 01:21:57,592 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 155 [2018-11-07 01:21:57,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:21:57,593 INFO L480 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-11-07 01:21:57,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 01:21:57,593 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-11-07 01:21:57,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-07 01:21:57,597 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:21:57,597 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:21:57,597 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:21:57,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:21:57,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1228371938, now seen corresponding path program 1 times [2018-11-07 01:21:57,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:21:57,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:21:57,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:21:57,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:21:57,599 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:21:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:21:58,006 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-07 01:21:58,083 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:21:58,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 01:21:58,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 01:21:58,084 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:21:58,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 01:21:58,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 01:21:58,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 01:21:58,085 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-11-07 01:21:59,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:21:59,181 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-11-07 01:21:59,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 01:21:59,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2018-11-07 01:21:59,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:21:59,193 INFO L225 Difference]: With dead ends: 1747 [2018-11-07 01:21:59,193 INFO L226 Difference]: Without dead ends: 801 [2018-11-07 01:21:59,197 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 01:21:59,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-11-07 01:21:59,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-11-07 01:21:59,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-11-07 01:21:59,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-11-07 01:21:59,219 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 157 [2018-11-07 01:21:59,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:21:59,220 INFO L480 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-11-07 01:21:59,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 01:21:59,220 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-11-07 01:21:59,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-07 01:21:59,224 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:21:59,224 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:21:59,224 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:21:59,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:21:59,225 INFO L82 PathProgramCache]: Analyzing trace with hash -977337382, now seen corresponding path program 1 times [2018-11-07 01:21:59,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:21:59,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:21:59,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:21:59,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:21:59,227 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:21:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:21:59,413 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:21:59,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 01:21:59,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 01:21:59,414 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:21:59,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 01:21:59,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 01:21:59,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 01:21:59,415 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-11-07 01:22:01,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:22:01,409 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-11-07 01:22:01,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 01:22:01,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2018-11-07 01:22:01,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:22:01,438 INFO L225 Difference]: With dead ends: 2381 [2018-11-07 01:22:01,439 INFO L226 Difference]: Without dead ends: 1586 [2018-11-07 01:22:01,443 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 01:22:01,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-11-07 01:22:01,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-11-07 01:22:01,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-11-07 01:22:01,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-11-07 01:22:01,502 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 161 [2018-11-07 01:22:01,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:22:01,503 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-11-07 01:22:01,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 01:22:01,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-11-07 01:22:01,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-07 01:22:01,509 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:22:01,510 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 01:22:01,510 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:22:01,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:22:01,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1994030385, now seen corresponding path program 1 times [2018-11-07 01:22:01,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:22:01,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:22:01,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:22:01,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:22:01,512 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:22:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:22:01,786 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-11-07 01:22:01,980 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-07 01:22:02,126 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:22:02,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 01:22:02,127 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 01:22:02,128 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 168 with the following transitions: [2018-11-07 01:22:02,131 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], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [711], [713], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 01:22:02,220 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 01:22:02,221 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 01:23:00,177 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 01:23:00,179 INFO L272 AbstractInterpreter]: Visited 134 different actions 398 times. Merged at 7 different actions 18 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 01:23:00,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:23:00,226 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 01:23:06,472 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 86.67% of their original sizes. [2018-11-07 01:23:06,472 INFO L413 sIntCurrentIteration]: Unifying AI predicates Received shutdown request... [2018-11-07 01:26:06,578 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 01:26:06,584 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 01:26:06,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:26:06 BoogieIcfgContainer [2018-11-07 01:26:06,585 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 01:26:06,586 INFO L168 Benchmark]: Toolchain (without parser) took 264573.81 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.1 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -897.1 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-11-07 01:26:06,587 INFO L168 Benchmark]: CDTParser took 0.24 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-11-07 01:26:06,588 INFO L168 Benchmark]: CACSL2BoogieTranslator took 817.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-07 01:26:06,589 INFO L168 Benchmark]: Boogie Procedure Inliner took 150.27 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -815.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. [2018-11-07 01:26:06,590 INFO L168 Benchmark]: Boogie Preprocessor took 106.77 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 01:26:06,591 INFO L168 Benchmark]: RCFGBuilder took 3234.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: 103.7 MB). Peak memory consumption was 103.7 MB. Max. memory is 7.1 GB. [2018-11-07 01:26:06,592 INFO L168 Benchmark]: TraceAbstraction took 260259.33 ms. Allocated memory was 2.3 GB in the beginning and 3.6 GB in the end (delta: 1.3 GB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -217.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-11-07 01:26:06,598 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.24 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 817.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 150.27 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -815.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 106.77 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3234.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: 103.7 MB). Peak memory consumption was 103.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 260259.33 ms. Allocated memory was 2.3 GB in the beginning and 3.6 GB in the end (delta: 1.3 GB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -217.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 541]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 168 with TraceHistMax 3,while AbsIntCurrentIteration was generating AI predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. TIMEOUT Result, 260.1s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 11.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 854 SDtfs, 3992 SDslu, 687 SDs, 0 SdLazy, 5049 SolverSat, 1075 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1558occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 58.0s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9944214982261911 AbsIntWeakeningRatio, 0.19879518072289157 AbsIntAvgWeakeningVarsNumRemoved, 1269.578313253012 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 40 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1040 NumberOfCodeBlocks, 1040 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1033 ConstructedInterpolants, 0 QuantifiedInterpolants, 1204986 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 112/112 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown