java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-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_label48_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 19:32:20,964 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 19:32:20,966 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 19:32:20,983 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 19:32:20,983 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 19:32:20,985 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 19:32:20,986 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 19:32:20,988 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 19:32:20,991 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 19:32:20,992 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 19:32:20,998 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 19:32:20,998 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 19:32:20,999 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 19:32:21,002 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 19:32:21,004 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 19:32:21,008 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 19:32:21,009 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 19:32:21,012 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 19:32:21,017 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 19:32:21,022 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 19:32:21,024 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 19:32:21,025 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 19:32:21,028 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 19:32:21,028 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 19:32:21,028 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 19:32:21,029 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 19:32:21,031 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 19:32:21,033 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 19:32:21,034 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 19:32:21,036 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 19:32:21,036 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 19:32:21,037 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 19:32:21,039 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 19:32:21,039 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 19:32:21,040 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 19:32:21,041 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 19:32:21,041 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-10-24 19:32:21,073 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 19:32:21,074 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 19:32:21,075 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 19:32:21,076 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 19:32:21,076 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 19:32:21,076 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 19:32:21,076 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 19:32:21,076 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 19:32:21,076 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 19:32:21,077 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 19:32:21,077 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 19:32:21,078 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 19:32:21,078 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 19:32:21,078 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 19:32:21,079 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 19:32:21,079 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 19:32:21,079 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 19:32:21,079 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 19:32:21,079 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 19:32:21,079 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 19:32:21,081 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 19:32:21,082 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 19:32:21,082 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 19:32:21,082 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 19:32:21,082 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 19:32:21,082 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 19:32:21,083 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 19:32:21,083 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 19:32:21,083 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 19:32:21,083 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 19:32:21,083 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 19:32:21,084 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 19:32:21,084 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 19:32:21,084 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 19:32:21,155 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 19:32:21,168 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 19:32:21,172 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 19:32:21,174 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 19:32:21,175 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 19:32:21,175 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label48_true-unreach-call_false-termination.c [2018-10-24 19:32:21,236 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ab4721604/5f052c971e1249fe8480ffa09f748735/FLAGa42ce4467 [2018-10-24 19:32:21,787 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 19:32:21,788 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label48_true-unreach-call_false-termination.c [2018-10-24 19:32:21,818 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ab4721604/5f052c971e1249fe8480ffa09f748735/FLAGa42ce4467 [2018-10-24 19:32:21,840 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ab4721604/5f052c971e1249fe8480ffa09f748735 [2018-10-24 19:32:21,854 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 19:32:21,857 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 19:32:21,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 19:32:21,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 19:32:21,865 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 19:32:21,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:32:21" (1/1) ... [2018-10-24 19:32:21,870 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53c03dbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:32:21, skipping insertion in model container [2018-10-24 19:32:21,871 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:32:21" (1/1) ... [2018-10-24 19:32:21,883 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 19:32:21,953 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 19:32:22,420 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 19:32:22,427 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 19:32:22,560 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 19:32:22,585 INFO L193 MainTranslator]: Completed translation [2018-10-24 19:32:22,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:32:22 WrapperNode [2018-10-24 19:32:22,586 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 19:32:22,587 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 19:32:22,587 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 19:32:22,588 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 19:32:22,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:32:22" (1/1) ... [2018-10-24 19:32:22,641 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:32:22" (1/1) ... [2018-10-24 19:32:22,818 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 19:32:22,818 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 19:32:22,818 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 19:32:22,819 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 19:32:22,832 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:32:22" (1/1) ... [2018-10-24 19:32:22,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:32:22" (1/1) ... [2018-10-24 19:32:22,843 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:32:22" (1/1) ... [2018-10-24 19:32:22,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:32:22" (1/1) ... [2018-10-24 19:32:22,885 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:32:22" (1/1) ... [2018-10-24 19:32:22,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:32:22" (1/1) ... [2018-10-24 19:32:22,911 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:32:22" (1/1) ... [2018-10-24 19:32:22,918 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 19:32:22,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 19:32:22,919 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 19:32:22,919 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 19:32:22,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:32:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 19:32:22,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 19:32:22,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 19:32:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 19:32:22,999 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 19:32:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 19:32:22,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 19:32:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 19:32:23,000 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 19:32:26,201 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 19:32:26,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:32:26 BoogieIcfgContainer [2018-10-24 19:32:26,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 19:32:26,203 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 19:32:26,203 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 19:32:26,207 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 19:32:26,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:32:21" (1/3) ... [2018-10-24 19:32:26,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@471655b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:32:26, skipping insertion in model container [2018-10-24 19:32:26,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:32:22" (2/3) ... [2018-10-24 19:32:26,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@471655b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:32:26, skipping insertion in model container [2018-10-24 19:32:26,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:32:26" (3/3) ... [2018-10-24 19:32:26,211 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label48_true-unreach-call_false-termination.c [2018-10-24 19:32:26,222 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 19:32:26,231 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 19:32:26,250 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 19:32:26,286 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 19:32:26,287 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 19:32:26,287 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 19:32:26,287 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 19:32:26,287 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 19:32:26,288 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 19:32:26,288 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 19:32:26,288 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 19:32:26,316 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-24 19:32:26,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-24 19:32:26,334 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:32:26,335 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 19:32:26,338 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:32:26,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:32:26,345 INFO L82 PathProgramCache]: Analyzing trace with hash -549296008, now seen corresponding path program 1 times [2018-10-24 19:32:26,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:32:26,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:32:26,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:32:26,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:32:26,400 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:32:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:32:27,088 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 19:32:27,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:32:27,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:32:27,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 19:32:27,267 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:32:27,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 19:32:27,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 19:32:27,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 19:32:27,299 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-24 19:32:29,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:32:29,258 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-10-24 19:32:29,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 19:32:29,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2018-10-24 19:32:29,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:32:29,282 INFO L225 Difference]: With dead ends: 621 [2018-10-24 19:32:29,282 INFO L226 Difference]: Without dead ends: 382 [2018-10-24 19:32:29,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 19:32:29,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-10-24 19:32:29,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-10-24 19:32:29,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-24 19:32:29,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-10-24 19:32:29,369 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 144 [2018-10-24 19:32:29,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:32:29,370 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-10-24 19:32:29,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 19:32:29,370 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-10-24 19:32:29,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-24 19:32:29,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:32:29,378 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 19:32:29,379 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:32:29,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:32:29,379 INFO L82 PathProgramCache]: Analyzing trace with hash -949584507, now seen corresponding path program 1 times [2018-10-24 19:32:29,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:32:29,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:32:29,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:32:29,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:32:29,382 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:32:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:32:29,986 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-24 19:32:30,215 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-24 19:32:30,338 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:32:30,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:32:30,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 19:32:30,339 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:32:30,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 19:32:30,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 19:32:30,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:32:30,344 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-10-24 19:32:32,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:32:32,179 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-10-24 19:32:32,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 19:32:32,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2018-10-24 19:32:32,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:32:32,184 INFO L225 Difference]: With dead ends: 903 [2018-10-24 19:32:32,185 INFO L226 Difference]: Without dead ends: 381 [2018-10-24 19:32:32,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:32:32,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-10-24 19:32:32,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-10-24 19:32:32,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-24 19:32:32,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-10-24 19:32:32,216 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 153 [2018-10-24 19:32:32,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:32:32,217 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-10-24 19:32:32,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 19:32:32,217 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-10-24 19:32:32,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-24 19:32:32,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:32:32,221 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 19:32:32,221 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:32:32,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:32:32,222 INFO L82 PathProgramCache]: Analyzing trace with hash 798568569, now seen corresponding path program 1 times [2018-10-24 19:32:32,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:32:32,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:32:32,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:32:32,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:32:32,224 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:32:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:32:32,718 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:32:32,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:32:32,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 19:32:32,719 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:32:32,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 19:32:32,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 19:32:32,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:32:32,721 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-10-24 19:32:34,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:32:34,375 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-10-24 19:32:34,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 19:32:34,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2018-10-24 19:32:34,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:32:34,381 INFO L225 Difference]: With dead ends: 901 [2018-10-24 19:32:34,382 INFO L226 Difference]: Without dead ends: 380 [2018-10-24 19:32:34,385 INFO L605 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-10-24 19:32:34,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-24 19:32:34,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-10-24 19:32:34,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-24 19:32:34,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-10-24 19:32:34,426 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 159 [2018-10-24 19:32:34,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:32:34,427 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-10-24 19:32:34,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 19:32:34,427 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-10-24 19:32:34,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-24 19:32:34,431 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:32:34,431 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 19:32:34,432 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:32:34,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:32:34,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1751281726, now seen corresponding path program 1 times [2018-10-24 19:32:34,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:32:34,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:32:34,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:32:34,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:32:34,434 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:32:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:32:34,714 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 19:32:34,790 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:32:34,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:32:34,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 19:32:34,791 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:32:34,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 19:32:34,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 19:32:34,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 19:32:34,792 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-10-24 19:32:37,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:32:37,919 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-10-24 19:32:37,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 19:32:37,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2018-10-24 19:32:37,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:32:37,925 INFO L225 Difference]: With dead ends: 1193 [2018-10-24 19:32:37,925 INFO L226 Difference]: Without dead ends: 819 [2018-10-24 19:32:37,928 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 19:32:37,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-10-24 19:32:37,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-10-24 19:32:37,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-10-24 19:32:37,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-10-24 19:32:37,965 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 167 [2018-10-24 19:32:37,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:32:37,966 INFO L481 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-10-24 19:32:37,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 19:32:37,966 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-10-24 19:32:37,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-24 19:32:37,971 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:32:37,971 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 19:32:37,971 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:32:37,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:32:37,972 INFO L82 PathProgramCache]: Analyzing trace with hash 526148798, now seen corresponding path program 1 times [2018-10-24 19:32:37,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:32:37,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:32:37,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:32:37,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:32:37,974 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:32:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:32:38,346 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-24 19:32:38,581 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-24 19:32:38,661 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:32:38,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:32:38,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 19:32:38,662 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:32:38,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 19:32:38,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 19:32:38,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:32:38,664 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-10-24 19:32:40,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:32:40,332 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-10-24 19:32:40,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 19:32:40,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2018-10-24 19:32:40,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:32:40,351 INFO L225 Difference]: With dead ends: 1753 [2018-10-24 19:32:40,352 INFO L226 Difference]: Without dead ends: 804 [2018-10-24 19:32:40,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:32:40,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-10-24 19:32:40,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-10-24 19:32:40,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-10-24 19:32:40,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-10-24 19:32:40,390 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 169 [2018-10-24 19:32:40,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:32:40,390 INFO L481 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-10-24 19:32:40,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 19:32:40,391 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-10-24 19:32:40,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-24 19:32:40,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:32:40,395 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 19:32:40,395 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:32:40,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:32:40,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1751938630, now seen corresponding path program 1 times [2018-10-24 19:32:40,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:32:40,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:32:40,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:32:40,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:32:40,398 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:32:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:32:40,700 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:32:40,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:32:40,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 19:32:40,700 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:32:40,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 19:32:40,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 19:32:40,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:32:40,702 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-10-24 19:32:42,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:32:42,365 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-10-24 19:32:42,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 19:32:42,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2018-10-24 19:32:42,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:32:42,372 INFO L225 Difference]: With dead ends: 1747 [2018-10-24 19:32:42,372 INFO L226 Difference]: Without dead ends: 801 [2018-10-24 19:32:42,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-10-24 19:32:42,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-10-24 19:32:42,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-10-24 19:32:42,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-10-24 19:32:42,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-10-24 19:32:42,442 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 171 [2018-10-24 19:32:42,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:32:42,444 INFO L481 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-10-24 19:32:42,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 19:32:42,444 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-10-24 19:32:42,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-24 19:32:42,449 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:32:42,449 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 19:32:42,450 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:32:42,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:32:42,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1260045234, now seen corresponding path program 1 times [2018-10-24 19:32:42,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:32:42,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:32:42,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:32:42,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:32:42,460 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:32:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:32:42,701 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 19:32:43,063 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:32:43,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:32:43,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 19:32:43,064 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:32:43,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 19:32:43,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 19:32:43,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 19:32:43,065 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-10-24 19:32:44,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:32:44,632 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-10-24 19:32:44,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 19:32:44,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 175 [2018-10-24 19:32:44,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:32:44,642 INFO L225 Difference]: With dead ends: 2381 [2018-10-24 19:32:44,642 INFO L226 Difference]: Without dead ends: 1586 [2018-10-24 19:32:44,647 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 19:32:44,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-10-24 19:32:44,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-10-24 19:32:44,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-10-24 19:32:44,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-10-24 19:32:44,697 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 175 [2018-10-24 19:32:44,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:32:44,697 INFO L481 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-10-24 19:32:44,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 19:32:44,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-10-24 19:32:44,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-24 19:32:44,703 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:32:44,704 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 19:32:44,704 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:32:44,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:32:44,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1346398007, now seen corresponding path program 1 times [2018-10-24 19:32:44,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:32:44,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:32:44,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:32:44,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:32:44,707 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:32:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:32:45,002 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:32:45,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 19:32:45,002 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 19:32:45,003 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 182 with the following transitions: [2018-10-24 19:32:45,006 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], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [823], [825], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-24 19:32:45,078 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 19:32:45,078 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 19:34:17,853 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 19:34:17,855 INFO L272 AbstractInterpreter]: Visited 148 different actions 580 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-24 19:34:17,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:34:17,891 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 19:34:24,245 INFO L232 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 88.89% of their original sizes. [2018-10-24 19:34:24,246 INFO L411 sIntCurrentIteration]: Unifying AI predicates Received shutdown request... [2018-10-24 19:36:42,618 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 19:36:42,626 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 19:36:42,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:36:42 BoogieIcfgContainer [2018-10-24 19:36:42,627 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 19:36:42,628 INFO L168 Benchmark]: Toolchain (without parser) took 260772.60 ms. Allocated memory was 1.5 GB in the beginning and 3.7 GB in the end (delta: 2.2 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.3 GB). Peak memory consumption was 902.4 MB. Max. memory is 7.1 GB. [2018-10-24 19:36:42,629 INFO L168 Benchmark]: CDTParser took 0.20 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-10-24 19:36:42,630 INFO L168 Benchmark]: CACSL2BoogieTranslator took 728.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-24 19:36:42,630 INFO L168 Benchmark]: Boogie Procedure Inliner took 230.77 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 698.9 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -792.3 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. [2018-10-24 19:36:42,631 INFO L168 Benchmark]: Boogie Preprocessor took 99.75 ms. Allocated memory is still 2.2 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 19:36:42,632 INFO L168 Benchmark]: RCFGBuilder took 3283.65 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 107.4 MB). Peak memory consumption was 107.4 MB. Max. memory is 7.1 GB. [2018-10-24 19:36:42,633 INFO L168 Benchmark]: TraceAbstraction took 256423.68 ms. Allocated memory was 2.2 GB in the beginning and 3.7 GB in the end (delta: 1.5 GB). Free memory was 2.0 GB in the beginning and 2.6 GB in the end (delta: -618.3 MB). Peak memory consumption was 846.1 MB. Max. memory is 7.1 GB. [2018-10-24 19:36:42,641 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.20 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. * CACSL2BoogieTranslator took 728.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 230.77 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 698.9 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -792.3 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 99.75 ms. Allocated memory is still 2.2 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3283.65 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 107.4 MB). Peak memory consumption was 107.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 256423.68 ms. Allocated memory was 2.2 GB in the beginning and 3.7 GB in the end (delta: 1.5 GB). Free memory was 2.0 GB in the beginning and 2.6 GB in the end (delta: -618.3 MB). Peak memory consumption was 846.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 583]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 583). Cancelled while BasicCegarLoop was analyzing trace of length 182 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, 256.3s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 13.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 854 SDtfs, 3978 SDslu, 687 SDs, 0 SdLazy, 5049 SolverSat, 1075 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.5s 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, 92.8s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9948553816974874 AbsIntWeakeningRatio, 0.18333333333333332 AbsIntAvgWeakeningVarsNumRemoved, 1325.8833333333334 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 40 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1138 NumberOfCodeBlocks, 1138 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1131 ConstructedInterpolants, 0 QuantifiedInterpolants, 1341290 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