java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label05_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 14:57:55,831 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 14:57:55,833 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 14:57:55,844 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 14:57:55,845 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 14:57:55,846 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 14:57:55,847 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 14:57:55,849 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 14:57:55,851 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 14:57:55,854 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 14:57:55,855 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 14:57:55,856 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 14:57:55,858 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 14:57:55,859 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 14:57:55,862 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 14:57:55,863 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 14:57:55,864 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 14:57:55,865 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 14:57:55,872 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 14:57:55,874 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 14:57:55,880 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 14:57:55,882 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 14:57:55,885 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 14:57:55,885 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 14:57:55,885 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 14:57:55,886 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 14:57:55,887 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 14:57:55,888 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 14:57:55,891 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 14:57:55,892 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 14:57:55,892 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 14:57:55,893 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 14:57:55,893 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 14:57:55,893 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 14:57:55,897 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 14:57:55,898 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 14:57:55,899 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 14:57:55,923 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 14:57:55,923 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 14:57:55,925 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 14:57:55,926 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 14:57:55,926 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 14:57:55,926 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 14:57:55,926 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 14:57:55,926 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 14:57:55,927 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 14:57:55,927 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 14:57:55,928 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 14:57:55,928 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 14:57:55,928 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 14:57:55,929 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 14:57:55,929 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 14:57:55,929 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 14:57:55,929 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 14:57:55,929 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 14:57:55,929 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 14:57:55,931 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 14:57:55,931 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 14:57:55,931 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 14:57:55,931 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 14:57:55,931 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 14:57:55,932 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 14:57:55,932 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 14:57:55,932 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 14:57:55,932 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 14:57:55,933 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 14:57:55,933 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 14:57:55,933 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 14:57:55,933 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 14:57:55,933 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 14:57:55,934 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 14:57:55,978 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 14:57:55,993 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 14:57:55,997 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 14:57:55,999 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 14:57:55,999 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 14:57:56,000 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label05_true-unreach-call_false-termination.c [2018-11-07 14:57:56,072 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2c128854/8fa8d5681bf7437ea974fe1b714737c7/FLAG01a13d3a9 [2018-11-07 14:57:56,602 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 14:57:56,603 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label05_true-unreach-call_false-termination.c [2018-11-07 14:57:56,620 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2c128854/8fa8d5681bf7437ea974fe1b714737c7/FLAG01a13d3a9 [2018-11-07 14:57:56,649 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2c128854/8fa8d5681bf7437ea974fe1b714737c7 [2018-11-07 14:57:56,664 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 14:57:56,665 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 14:57:56,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 14:57:56,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 14:57:56,671 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 14:57:56,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:57:56" (1/1) ... [2018-11-07 14:57:56,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bd1f13b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:56, skipping insertion in model container [2018-11-07 14:57:56,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:57:56" (1/1) ... [2018-11-07 14:57:56,687 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 14:57:56,770 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 14:57:57,294 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 14:57:57,302 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 14:57:57,458 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 14:57:57,475 INFO L193 MainTranslator]: Completed translation [2018-11-07 14:57:57,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:57 WrapperNode [2018-11-07 14:57:57,475 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 14:57:57,476 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 14:57:57,476 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 14:57:57,477 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 14:57:57,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:57" (1/1) ... [2018-11-07 14:57:57,602 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:57" (1/1) ... [2018-11-07 14:57:57,610 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 14:57:57,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 14:57:57,611 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 14:57:57,611 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 14:57:57,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:57" (1/1) ... [2018-11-07 14:57:57,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:57" (1/1) ... [2018-11-07 14:57:57,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:57" (1/1) ... [2018-11-07 14:57:57,631 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:57" (1/1) ... [2018-11-07 14:57:57,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:57" (1/1) ... [2018-11-07 14:57:57,706 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:57" (1/1) ... [2018-11-07 14:57:57,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:57" (1/1) ... [2018-11-07 14:57:57,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 14:57:57,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 14:57:57,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 14:57:57,726 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 14:57:57,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 14:57:57,799 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 14:57:57,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 14:57:57,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 14:57:57,799 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 14:57:57,800 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 14:57:57,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 14:57:57,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 14:57:57,800 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 14:57:57,800 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 14:58:01,415 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 14:58:01,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:58:01 BoogieIcfgContainer [2018-11-07 14:58:01,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 14:58:01,418 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 14:58:01,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 14:58:01,425 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 14:58:01,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:57:56" (1/3) ... [2018-11-07 14:58:01,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776a27be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:58:01, skipping insertion in model container [2018-11-07 14:58:01,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:57" (2/3) ... [2018-11-07 14:58:01,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776a27be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:58:01, skipping insertion in model container [2018-11-07 14:58:01,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:58:01" (3/3) ... [2018-11-07 14:58:01,430 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label05_true-unreach-call_false-termination.c [2018-11-07 14:58:01,443 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 14:58:01,459 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 14:58:01,482 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 14:58:01,537 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 14:58:01,537 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 14:58:01,537 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 14:58:01,538 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 14:58:01,538 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 14:58:01,538 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 14:58:01,538 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 14:58:01,539 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 14:58:01,585 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-11-07 14:58:01,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-07 14:58:01,598 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 14:58:01,600 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] [2018-11-07 14:58:01,602 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 14:58:01,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 14:58:01,610 INFO L82 PathProgramCache]: Analyzing trace with hash 638958820, now seen corresponding path program 1 times [2018-11-07 14:58:01,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 14:58:01,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 14:58:01,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 14:58:01,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 14:58:01,675 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 14:58:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 14:58:02,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 14:58:02,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 14:58:02,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 14:58:02,210 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 14:58:02,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 14:58:02,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 14:58:02,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 14:58:02,239 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2018-11-07 14:58:03,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 14:58:03,998 INFO L93 Difference]: Finished difference Result 691 states and 1226 transitions. [2018-11-07 14:58:04,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 14:58:04,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-11-07 14:58:04,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 14:58:04,021 INFO L225 Difference]: With dead ends: 691 [2018-11-07 14:58:04,021 INFO L226 Difference]: Without dead ends: 434 [2018-11-07 14:58:04,030 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 14:58:04,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-11-07 14:58:04,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-11-07 14:58:04,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-11-07 14:58:04,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 765 transitions. [2018-11-07 14:58:04,117 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 765 transitions. Word has length 70 [2018-11-07 14:58:04,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 14:58:04,118 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 765 transitions. [2018-11-07 14:58:04,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 14:58:04,118 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 765 transitions. [2018-11-07 14:58:04,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-07 14:58:04,127 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 14:58:04,127 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, 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] [2018-11-07 14:58:04,128 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 14:58:04,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 14:58:04,128 INFO L82 PathProgramCache]: Analyzing trace with hash 781618536, now seen corresponding path program 1 times [2018-11-07 14:58:04,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 14:58:04,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 14:58:04,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 14:58:04,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 14:58:04,130 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 14:58:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 14:58:04,493 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 14:58:04,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 14:58:04,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 14:58:04,494 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 14:58:04,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 14:58:04,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 14:58:04,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 14:58:04,497 INFO L87 Difference]: Start difference. First operand 434 states and 765 transitions. Second operand 6 states. [2018-11-07 14:58:08,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 14:58:08,090 INFO L93 Difference]: Finished difference Result 1588 states and 2935 transitions. [2018-11-07 14:58:08,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 14:58:08,095 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2018-11-07 14:58:08,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 14:58:08,107 INFO L225 Difference]: With dead ends: 1588 [2018-11-07 14:58:08,107 INFO L226 Difference]: Without dead ends: 1160 [2018-11-07 14:58:08,111 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 14:58:08,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2018-11-07 14:58:08,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1153. [2018-11-07 14:58:08,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2018-11-07 14:58:08,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1887 transitions. [2018-11-07 14:58:08,174 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1887 transitions. Word has length 140 [2018-11-07 14:58:08,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 14:58:08,175 INFO L480 AbstractCegarLoop]: Abstraction has 1153 states and 1887 transitions. [2018-11-07 14:58:08,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 14:58:08,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1887 transitions. [2018-11-07 14:58:08,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-07 14:58:08,183 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 14:58:08,184 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, 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] [2018-11-07 14:58:08,184 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 14:58:08,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 14:58:08,184 INFO L82 PathProgramCache]: Analyzing trace with hash 386881263, now seen corresponding path program 1 times [2018-11-07 14:58:08,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 14:58:08,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 14:58:08,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 14:58:08,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 14:58:08,186 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 14:58:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 14:58:08,488 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 14:58:08,519 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 14:58:08,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 14:58:08,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 14:58:08,520 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 14:58:08,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 14:58:08,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 14:58:08,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 14:58:08,521 INFO L87 Difference]: Start difference. First operand 1153 states and 1887 transitions. Second operand 5 states. [2018-11-07 14:58:11,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 14:58:11,087 INFO L93 Difference]: Finished difference Result 2716 states and 4601 transitions. [2018-11-07 14:58:11,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 14:58:11,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2018-11-07 14:58:11,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 14:58:11,106 INFO L225 Difference]: With dead ends: 2716 [2018-11-07 14:58:11,106 INFO L226 Difference]: Without dead ends: 1569 [2018-11-07 14:58:11,114 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 14:58:11,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2018-11-07 14:58:11,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1538. [2018-11-07 14:58:11,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1538 states. [2018-11-07 14:58:11,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 2356 transitions. [2018-11-07 14:58:11,202 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 2356 transitions. Word has length 141 [2018-11-07 14:58:11,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 14:58:11,203 INFO L480 AbstractCegarLoop]: Abstraction has 1538 states and 2356 transitions. [2018-11-07 14:58:11,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 14:58:11,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 2356 transitions. [2018-11-07 14:58:11,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-07 14:58:11,206 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 14:58:11,206 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, 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] [2018-11-07 14:58:11,207 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 14:58:11,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 14:58:11,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1814928629, now seen corresponding path program 1 times [2018-11-07 14:58:11,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 14:58:11,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 14:58:11,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 14:58:11,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 14:58:11,209 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 14:58:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 14:58:11,459 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 14:58:11,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 14:58:11,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 14:58:11,459 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 14:58:11,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 14:58:11,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 14:58:11,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 14:58:11,461 INFO L87 Difference]: Start difference. First operand 1538 states and 2356 transitions. Second operand 5 states. [2018-11-07 14:58:13,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 14:58:13,911 INFO L93 Difference]: Finished difference Result 4198 states and 6461 transitions. [2018-11-07 14:58:13,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 14:58:13,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2018-11-07 14:58:13,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 14:58:13,931 INFO L225 Difference]: With dead ends: 4198 [2018-11-07 14:58:13,932 INFO L226 Difference]: Without dead ends: 2666 [2018-11-07 14:58:13,943 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 14:58:13,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2018-11-07 14:58:14,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2560. [2018-11-07 14:58:14,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2560 states. [2018-11-07 14:58:14,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 3629 transitions. [2018-11-07 14:58:14,024 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 3629 transitions. Word has length 143 [2018-11-07 14:58:14,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 14:58:14,025 INFO L480 AbstractCegarLoop]: Abstraction has 2560 states and 3629 transitions. [2018-11-07 14:58:14,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 14:58:14,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 3629 transitions. [2018-11-07 14:58:14,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-07 14:58:14,028 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 14:58:14,028 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, 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] [2018-11-07 14:58:14,029 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 14:58:14,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 14:58:14,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1367995872, now seen corresponding path program 1 times [2018-11-07 14:58:14,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 14:58:14,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 14:58:14,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 14:58:14,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 14:58:14,031 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 14:58:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 14:58:14,227 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 14:58:14,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 14:58:14,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 14:58:14,228 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 14:58:14,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 14:58:14,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 14:58:14,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 14:58:14,229 INFO L87 Difference]: Start difference. First operand 2560 states and 3629 transitions. Second operand 4 states. [2018-11-07 14:58:16,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 14:58:16,721 INFO L93 Difference]: Finished difference Result 7180 states and 10578 transitions. [2018-11-07 14:58:16,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 14:58:16,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2018-11-07 14:58:16,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 14:58:16,748 INFO L225 Difference]: With dead ends: 7180 [2018-11-07 14:58:16,748 INFO L226 Difference]: Without dead ends: 4626 [2018-11-07 14:58:16,768 INFO L604 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-11-07 14:58:16,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4626 states. [2018-11-07 14:58:16,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4626 to 4626. [2018-11-07 14:58:16,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4626 states. [2018-11-07 14:58:16,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4626 states to 4626 states and 6381 transitions. [2018-11-07 14:58:16,888 INFO L78 Accepts]: Start accepts. Automaton has 4626 states and 6381 transitions. Word has length 144 [2018-11-07 14:58:16,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 14:58:16,889 INFO L480 AbstractCegarLoop]: Abstraction has 4626 states and 6381 transitions. [2018-11-07 14:58:16,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 14:58:16,889 INFO L276 IsEmpty]: Start isEmpty. Operand 4626 states and 6381 transitions. [2018-11-07 14:58:16,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-11-07 14:58:16,920 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 14:58:16,920 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-11-07 14:58:16,921 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 14:58:16,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 14:58:16,921 INFO L82 PathProgramCache]: Analyzing trace with hash 2115072535, now seen corresponding path program 1 times [2018-11-07 14:58:16,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 14:58:16,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 14:58:16,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 14:58:16,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 14:58:16,923 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 14:58:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 14:58:17,433 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 126 proven. 108 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 14:58:17,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 14:58:17,434 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 14:58:17,435 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 338 with the following transitions: [2018-11-07 14:58:17,437 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [830], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 14:58:17,490 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 14:58:17,491 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 14:58:18,523 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 14:58:29,846 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 14:58:29,848 INFO L272 AbstractInterpreter]: Visited 159 different actions 159 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-11-07 14:58:29,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 14:58:29,896 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 14:58:39,991 INFO L227 lantSequenceWeakener]: Weakened 328 states. On average, predicates are now at 77.98% of their original sizes. [2018-11-07 14:58:39,992 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 14:58:40,434 INFO L415 sIntCurrentIteration]: We unified 336 AI predicates to 336 [2018-11-07 14:58:40,434 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 14:58:40,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 14:58:40,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2018-11-07 14:58:40,436 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 14:58:40,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 14:58:40,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 14:58:40,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-07 14:58:40,437 INFO L87 Difference]: Start difference. First operand 4626 states and 6381 transitions. Second operand 8 states. [2018-11-07 15:01:09,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 15:01:09,044 INFO L93 Difference]: Finished difference Result 9246 states and 12759 transitions. [2018-11-07 15:01:09,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 15:01:09,044 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 337 [2018-11-07 15:01:09,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 15:01:09,068 INFO L225 Difference]: With dead ends: 9246 [2018-11-07 15:01:09,069 INFO L226 Difference]: Without dead ends: 4626 [2018-11-07 15:01:09,089 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 338 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-07 15:01:09,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4626 states. [2018-11-07 15:01:09,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4626 to 4624. [2018-11-07 15:01:09,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4624 states. [2018-11-07 15:01:09,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4624 states to 4624 states and 6343 transitions. [2018-11-07 15:01:09,221 INFO L78 Accepts]: Start accepts. Automaton has 4624 states and 6343 transitions. Word has length 337 [2018-11-07 15:01:09,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 15:01:09,222 INFO L480 AbstractCegarLoop]: Abstraction has 4624 states and 6343 transitions. [2018-11-07 15:01:09,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 15:01:09,222 INFO L276 IsEmpty]: Start isEmpty. Operand 4624 states and 6343 transitions. [2018-11-07 15:01:09,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-11-07 15:01:09,251 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 15:01:09,251 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 15:01:09,252 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 15:01:09,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 15:01:09,253 INFO L82 PathProgramCache]: Analyzing trace with hash 65139688, now seen corresponding path program 1 times [2018-11-07 15:01:09,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 15:01:09,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 15:01:09,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 15:01:09,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 15:01:09,254 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 15:01:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 15:01:10,482 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 277 proven. 190 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 15:01:10,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 15:01:10,483 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 15:01:10,483 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 423 with the following transitions: [2018-11-07 15:01:10,484 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [830], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 15:01:10,491 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 15:01:10,491 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 15:01:10,738 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 15:01:28,643 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 15:01:28,643 INFO L272 AbstractInterpreter]: Visited 163 different actions 319 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 15:01:28,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 15:01:28,650 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 15:01:38,398 INFO L227 lantSequenceWeakener]: Weakened 231 states. On average, predicates are now at 77.9% of their original sizes. [2018-11-07 15:01:38,398 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 15:01:39,483 INFO L415 sIntCurrentIteration]: We unified 421 AI predicates to 421 [2018-11-07 15:01:39,484 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 15:01:39,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 15:01:39,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [12] total 36 [2018-11-07 15:01:39,484 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 15:01:39,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 15:01:39,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 15:01:39,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2018-11-07 15:01:39,487 INFO L87 Difference]: Start difference. First operand 4624 states and 6343 transitions. Second operand 26 states. Received shutdown request... [2018-11-07 15:02:09,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 15:02:09,595 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 15:02:09,601 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 15:02:09,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:02:09 BoogieIcfgContainer [2018-11-07 15:02:09,601 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 15:02:09,602 INFO L168 Benchmark]: Toolchain (without parser) took 252937.65 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.7 GB in the end (delta: -2.3 GB). Peak memory consumption was 311.4 MB. Max. memory is 7.1 GB. [2018-11-07 15:02:09,603 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 15:02:09,604 INFO L168 Benchmark]: CACSL2BoogieTranslator took 809.43 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-11-07 15:02:09,604 INFO L168 Benchmark]: Boogie Procedure Inliner took 134.18 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -848.2 MB). Peak memory consumption was 19.6 MB. Max. memory is 7.1 GB. [2018-11-07 15:02:09,606 INFO L168 Benchmark]: Boogie Preprocessor took 114.12 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 15:02:09,606 INFO L168 Benchmark]: RCFGBuilder took 3691.28 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: 129.5 MB). Peak memory consumption was 129.5 MB. Max. memory is 7.1 GB. [2018-11-07 15:02:09,610 INFO L168 Benchmark]: TraceAbstraction took 248183.62 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 237.6 MB. Max. memory is 7.1 GB. [2018-11-07 15:02:09,618 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.23 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 809.43 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 134.18 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -848.2 MB). Peak memory consumption was 19.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 114.12 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 3691.28 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: 129.5 MB). Peak memory consumption was 129.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 248183.62 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 237.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 193]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 193). Cancelled while BasicCegarLoop was constructing difference of abstraction (4624states) and FLOYD_HOARE automaton (currently 22 states, 26 states before enhancement),while ReachableStatesComputation was computing reachable states (1122 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. TIMEOUT Result, 248.0s OverallTime, 7 OverallIterations, 4 TraceHistogramMax, 191.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 935 SDtfs, 6820 SDslu, 716 SDs, 0 SdLazy, 7832 SolverSat, 1580 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 172.3s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 805 GetRequests, 739 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4626occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 30.6s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.9979335102131038 AbsIntWeakeningRatio, 0.07661822985468957 AbsIntAvgWeakeningVarsNumRemoved, 16.940554821664463 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 6 MinimizatonAttempts, 146 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1397 NumberOfCodeBlocks, 1397 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1390 ConstructedInterpolants, 0 QuantifiedInterpolants, 2981897 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 665/963 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown