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/Problem01_label47_false-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 22:38:06,847 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 22:38:06,849 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 22:38:06,862 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 22:38:06,862 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 22:38:06,863 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 22:38:06,864 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 22:38:06,866 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 22:38:06,868 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 22:38:06,869 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 22:38:06,870 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 22:38:06,870 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 22:38:06,871 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 22:38:06,872 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 22:38:06,873 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 22:38:06,874 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 22:38:06,875 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 22:38:06,877 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 22:38:06,879 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 22:38:06,881 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 22:38:06,882 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 22:38:06,883 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 22:38:06,886 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 22:38:06,886 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 22:38:06,886 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 22:38:06,887 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 22:38:06,888 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 22:38:06,889 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 22:38:06,890 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 22:38:06,891 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 22:38:06,892 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 22:38:06,892 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 22:38:06,893 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 22:38:06,893 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 22:38:06,894 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 22:38:06,895 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 22:38:06,895 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-26 22:38:06,912 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 22:38:06,912 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 22:38:06,913 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 22:38:06,913 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 22:38:06,913 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 22:38:06,913 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 22:38:06,914 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 22:38:06,914 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 22:38:06,914 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-26 22:38:06,914 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 22:38:06,914 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 22:38:06,915 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 22:38:06,915 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 22:38:06,916 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 22:38:06,916 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 22:38:06,916 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 22:38:06,916 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 22:38:06,916 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 22:38:06,917 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 22:38:06,917 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 22:38:06,917 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 22:38:06,917 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 22:38:06,917 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 22:38:06,918 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 22:38:06,918 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:38:06,918 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 22:38:06,918 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 22:38:06,919 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 22:38:06,919 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 22:38:06,919 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 22:38:06,919 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 22:38:06,919 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 22:38:06,920 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 22:38:06,920 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-26 22:38:06,997 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 22:38:07,010 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 22:38:07,014 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 22:38:07,016 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 22:38:07,017 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 22:38:07,017 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label47_false-unreach-call_false-termination.c [2018-10-26 22:38:07,081 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4db8834f1/8a84f3163fae4d77bace239c15cff8a9/FLAG0f72eeabd [2018-10-26 22:38:07,683 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 22:38:07,685 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label47_false-unreach-call_false-termination.c [2018-10-26 22:38:07,708 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4db8834f1/8a84f3163fae4d77bace239c15cff8a9/FLAG0f72eeabd [2018-10-26 22:38:07,731 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4db8834f1/8a84f3163fae4d77bace239c15cff8a9 [2018-10-26 22:38:07,744 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 22:38:07,746 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 22:38:07,747 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 22:38:07,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 22:38:07,755 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 22:38:07,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:38:07" (1/1) ... [2018-10-26 22:38:07,759 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34957d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:38:07, skipping insertion in model container [2018-10-26 22:38:07,759 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:38:07" (1/1) ... [2018-10-26 22:38:07,771 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 22:38:07,848 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 22:38:08,339 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:38:08,344 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 22:38:08,495 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:38:08,515 INFO L193 MainTranslator]: Completed translation [2018-10-26 22:38:08,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:38:08 WrapperNode [2018-10-26 22:38:08,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 22:38:08,517 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 22:38:08,517 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 22:38:08,517 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 22:38:08,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:38:08" (1/1) ... [2018-10-26 22:38:08,550 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:38:08" (1/1) ... [2018-10-26 22:38:08,713 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 22:38:08,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 22:38:08,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 22:38:08,714 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 22:38:08,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:38:08" (1/1) ... [2018-10-26 22:38:08,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:38:08" (1/1) ... [2018-10-26 22:38:08,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:38:08" (1/1) ... [2018-10-26 22:38:08,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:38:08" (1/1) ... [2018-10-26 22:38:08,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:38:08" (1/1) ... [2018-10-26 22:38:08,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:38:08" (1/1) ... [2018-10-26 22:38:08,817 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:38:08" (1/1) ... [2018-10-26 22:38:08,835 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 22:38:08,836 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 22:38:08,836 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 22:38:08,836 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 22:38:08,837 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:38:08" (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-26 22:38:08,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 22:38:08,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 22:38:08,914 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-26 22:38:08,914 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-26 22:38:08,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 22:38:08,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 22:38:08,915 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 22:38:08,915 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 22:38:12,167 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 22:38:12,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:38:12 BoogieIcfgContainer [2018-10-26 22:38:12,168 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 22:38:12,171 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 22:38:12,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 22:38:12,175 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 22:38:12,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:38:07" (1/3) ... [2018-10-26 22:38:12,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d5fe5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:38:12, skipping insertion in model container [2018-10-26 22:38:12,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:38:08" (2/3) ... [2018-10-26 22:38:12,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d5fe5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:38:12, skipping insertion in model container [2018-10-26 22:38:12,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:38:12" (3/3) ... [2018-10-26 22:38:12,180 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label47_false-unreach-call_false-termination.c [2018-10-26 22:38:12,191 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 22:38:12,203 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 22:38:12,222 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 22:38:12,270 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 22:38:12,271 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 22:38:12,271 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 22:38:12,271 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 22:38:12,271 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 22:38:12,271 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 22:38:12,272 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 22:38:12,272 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 22:38:12,298 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-10-26 22:38:12,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-26 22:38:12,312 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:38:12,313 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] [2018-10-26 22:38:12,316 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:38:12,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:38:12,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1092811080, now seen corresponding path program 1 times [2018-10-26 22:38:12,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:38:12,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:38:12,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:38:12,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:38:12,385 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:38:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:38:12,950 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-26 22:38:12,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:38:12,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 22:38:12,953 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:38:12,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 22:38:12,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 22:38:12,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:38:12,982 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-10-26 22:38:14,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:38:14,547 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-10-26 22:38:14,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 22:38:14,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-10-26 22:38:14,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:38:14,570 INFO L225 Difference]: With dead ends: 550 [2018-10-26 22:38:14,570 INFO L226 Difference]: Without dead ends: 340 [2018-10-26 22:38:14,577 INFO L605 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-10-26 22:38:14,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-26 22:38:14,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-10-26 22:38:14,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-26 22:38:14,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-10-26 22:38:14,657 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 80 [2018-10-26 22:38:14,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:38:14,658 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-10-26 22:38:14,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 22:38:14,659 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-10-26 22:38:14,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-26 22:38:14,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:38:14,664 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-26 22:38:14,665 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:38:14,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:38:14,665 INFO L82 PathProgramCache]: Analyzing trace with hash 480701735, now seen corresponding path program 1 times [2018-10-26 22:38:14,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:38:14,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:38:14,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:38:14,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:38:14,668 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:38:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:38:14,960 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-26 22:38:15,112 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:38:15,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:38:15,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 22:38:15,113 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:38:15,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 22:38:15,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 22:38:15,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-26 22:38:15,115 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-10-26 22:38:17,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:38:17,021 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-10-26 22:38:17,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 22:38:17,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-10-26 22:38:17,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:38:17,030 INFO L225 Difference]: With dead ends: 888 [2018-10-26 22:38:17,030 INFO L226 Difference]: Without dead ends: 554 [2018-10-26 22:38:17,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-26 22:38:17,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-10-26 22:38:17,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-10-26 22:38:17,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-10-26 22:38:17,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-10-26 22:38:17,082 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 91 [2018-10-26 22:38:17,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:38:17,083 INFO L481 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-10-26 22:38:17,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 22:38:17,083 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-10-26 22:38:17,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-26 22:38:17,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:38:17,088 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:38:17,089 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:38:17,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:38:17,089 INFO L82 PathProgramCache]: Analyzing trace with hash -900509829, now seen corresponding path program 1 times [2018-10-26 22:38:17,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:38:17,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:38:17,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:38:17,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:38:17,091 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:38:17,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:38:17,342 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:38:17,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:38:17,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 22:38:17,343 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:38:17,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 22:38:17,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 22:38:17,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:38:17,347 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 3 states. [2018-10-26 22:38:18,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:38:18,535 INFO L93 Difference]: Finished difference Result 1530 states and 2434 transitions. [2018-10-26 22:38:18,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 22:38:18,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2018-10-26 22:38:18,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:38:18,547 INFO L225 Difference]: With dead ends: 1530 [2018-10-26 22:38:18,547 INFO L226 Difference]: Without dead ends: 997 [2018-10-26 22:38:18,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:38:18,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2018-10-26 22:38:18,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 994. [2018-10-26 22:38:18,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 994 states. [2018-10-26 22:38:18,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1454 transitions. [2018-10-26 22:38:18,603 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1454 transitions. Word has length 92 [2018-10-26 22:38:18,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:38:18,604 INFO L481 AbstractCegarLoop]: Abstraction has 994 states and 1454 transitions. [2018-10-26 22:38:18,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 22:38:18,605 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1454 transitions. [2018-10-26 22:38:18,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-26 22:38:18,612 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:38:18,612 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-26 22:38:18,613 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:38:18,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:38:18,613 INFO L82 PathProgramCache]: Analyzing trace with hash 909671971, now seen corresponding path program 1 times [2018-10-26 22:38:18,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:38:18,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:38:18,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:38:18,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:38:18,615 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:38:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:38:18,802 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:38:18,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:38:18,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 22:38:18,803 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:38:18,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 22:38:18,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 22:38:18,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 22:38:18,805 INFO L87 Difference]: Start difference. First operand 994 states and 1454 transitions. Second operand 4 states. [2018-10-26 22:38:21,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:38:21,643 INFO L93 Difference]: Finished difference Result 3376 states and 5191 transitions. [2018-10-26 22:38:21,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 22:38:21,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-10-26 22:38:21,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:38:21,662 INFO L225 Difference]: With dead ends: 3376 [2018-10-26 22:38:21,663 INFO L226 Difference]: Without dead ends: 2388 [2018-10-26 22:38:21,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 22:38:21,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2388 states. [2018-10-26 22:38:21,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2388 to 2388. [2018-10-26 22:38:21,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2388 states. [2018-10-26 22:38:21,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 3423 transitions. [2018-10-26 22:38:21,761 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 3423 transitions. Word has length 93 [2018-10-26 22:38:21,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:38:21,761 INFO L481 AbstractCegarLoop]: Abstraction has 2388 states and 3423 transitions. [2018-10-26 22:38:21,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 22:38:21,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 3423 transitions. [2018-10-26 22:38:21,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-26 22:38:21,769 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:38:21,770 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-26 22:38:21,770 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:38:21,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:38:21,770 INFO L82 PathProgramCache]: Analyzing trace with hash 433238511, now seen corresponding path program 1 times [2018-10-26 22:38:21,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:38:21,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:38:21,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:38:21,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:38:21,772 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:38:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:38:22,034 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:38:22,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:38:22,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 22:38:22,034 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:38:22,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 22:38:22,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 22:38:22,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:38:22,036 INFO L87 Difference]: Start difference. First operand 2388 states and 3423 transitions. Second operand 3 states. [2018-10-26 22:38:22,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:38:22,886 INFO L93 Difference]: Finished difference Result 7070 states and 10548 transitions. [2018-10-26 22:38:22,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 22:38:22,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-10-26 22:38:22,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:38:22,928 INFO L225 Difference]: With dead ends: 7070 [2018-10-26 22:38:22,928 INFO L226 Difference]: Without dead ends: 4688 [2018-10-26 22:38:22,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:38:22,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4688 states. [2018-10-26 22:38:23,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4688 to 4688. [2018-10-26 22:38:23,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4688 states. [2018-10-26 22:38:23,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4688 states to 4688 states and 6621 transitions. [2018-10-26 22:38:23,121 INFO L78 Accepts]: Start accepts. Automaton has 4688 states and 6621 transitions. Word has length 98 [2018-10-26 22:38:23,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:38:23,122 INFO L481 AbstractCegarLoop]: Abstraction has 4688 states and 6621 transitions. [2018-10-26 22:38:23,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 22:38:23,122 INFO L276 IsEmpty]: Start isEmpty. Operand 4688 states and 6621 transitions. [2018-10-26 22:38:23,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 22:38:23,133 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:38:23,133 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, 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] [2018-10-26 22:38:23,133 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:38:23,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:38:23,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1885605347, now seen corresponding path program 1 times [2018-10-26 22:38:23,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:38:23,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:38:23,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:38:23,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:38:23,136 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:38:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:38:23,390 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-26 22:38:23,454 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:38:23,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:38:23,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 22:38:23,455 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:38:23,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 22:38:23,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 22:38:23,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-26 22:38:23,456 INFO L87 Difference]: Start difference. First operand 4688 states and 6621 transitions. Second operand 6 states. [2018-10-26 22:38:24,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:38:24,797 INFO L93 Difference]: Finished difference Result 8749 states and 12593 transitions. [2018-10-26 22:38:24,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 22:38:24,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2018-10-26 22:38:24,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:38:24,826 INFO L225 Difference]: With dead ends: 8749 [2018-10-26 22:38:24,827 INFO L226 Difference]: Without dead ends: 4067 [2018-10-26 22:38:24,853 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-26 22:38:24,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4067 states. [2018-10-26 22:38:24,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4067 to 4001. [2018-10-26 22:38:24,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4001 states. [2018-10-26 22:38:24,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4001 states to 4001 states and 5002 transitions. [2018-10-26 22:38:24,979 INFO L78 Accepts]: Start accepts. Automaton has 4001 states and 5002 transitions. Word has length 125 [2018-10-26 22:38:24,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:38:24,980 INFO L481 AbstractCegarLoop]: Abstraction has 4001 states and 5002 transitions. [2018-10-26 22:38:24,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 22:38:24,980 INFO L276 IsEmpty]: Start isEmpty. Operand 4001 states and 5002 transitions. [2018-10-26 22:38:24,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-26 22:38:24,990 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:38:24,990 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 22:38:24,990 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:38:24,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:38:24,991 INFO L82 PathProgramCache]: Analyzing trace with hash 832089744, now seen corresponding path program 1 times [2018-10-26 22:38:24,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:38:24,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:38:24,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:38:24,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:38:24,993 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:38:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:38:25,188 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:38:25,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:38:25,188 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:38:25,190 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 138 with the following transitions: [2018-10-26 22:38:25,192 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [149], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [277], [279], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-26 22:38:25,265 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:38:25,265 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:39:04,817 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 22:39:04,818 INFO L272 AbstractInterpreter]: Visited 84 different actions 149 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-26 22:39:04,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:39:04,840 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 22:39:12,006 INFO L227 lantSequenceWeakener]: Weakened 110 states. On average, predicates are now at 80.22% of their original sizes. [2018-10-26 22:39:12,006 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 22:39:38,828 INFO L415 sIntCurrentIteration]: We unified 136 AI predicates to 136 [2018-10-26 22:39:38,829 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 22:39:38,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:39:38,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-10-26 22:39:38,830 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:39:38,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-26 22:39:38,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-26 22:39:38,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-10-26 22:39:38,831 INFO L87 Difference]: Start difference. First operand 4001 states and 5002 transitions. Second operand 18 states. Received shutdown request... [2018-10-26 22:42:24,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-26 22:42:24,168 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 22:42:24,174 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 22:42:24,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 10:42:24 BoogieIcfgContainer [2018-10-26 22:42:24,175 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 22:42:24,176 INFO L168 Benchmark]: Toolchain (without parser) took 256430.92 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -410.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-10-26 22:42:24,177 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 22:42:24,177 INFO L168 Benchmark]: CACSL2BoogieTranslator took 769.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-26 22:42:24,178 INFO L168 Benchmark]: Boogie Procedure Inliner took 196.45 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -825.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-10-26 22:42:24,179 INFO L168 Benchmark]: Boogie Preprocessor took 121.41 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-10-26 22:42:24,180 INFO L168 Benchmark]: RCFGBuilder took 3332.64 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.5 MB). Peak memory consumption was 103.5 MB. Max. memory is 7.1 GB. [2018-10-26 22:42:24,180 INFO L168 Benchmark]: TraceAbstraction took 252003.86 ms. Allocated memory was 2.3 GB in the beginning and 3.5 GB in the end (delta: 1.2 GB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 268.3 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-10-26 22:42:24,185 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 769.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 196.45 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -825.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 121.41 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 3332.64 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.5 MB). Peak memory consumption was 103.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 252003.86 ms. Allocated memory was 2.3 GB in the beginning and 3.5 GB in the end (delta: 1.2 GB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 268.3 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 395]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 395). Cancelled while BasicCegarLoop was constructing difference of abstraction (4001states) and FLOYD_HOARE automaton (currently 24 states, 18 states before enhancement),while ReachableStatesComputation was computing reachable states (1114 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. TIMEOUT Result, 251.9s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 175.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1039 SDtfs, 2369 SDslu, 395 SDs, 0 SdLazy, 4179 SolverSat, 960 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 76.6s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 186 GetRequests, 134 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 45.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4688occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 39.6s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9934925189588031 AbsIntWeakeningRatio, 0.25735294117647056 AbsIntAvgWeakeningVarsNumRemoved, 179.14705882352942 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 6 MinimizatonAttempts, 84 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 716 NumberOfCodeBlocks, 716 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 709 ConstructedInterpolants, 0 QuantifiedInterpolants, 214636 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 145/147 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown