java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label49_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 01:19:38,886 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 01:19:38,888 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 01:19:38,902 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 01:19:38,903 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 01:19:38,904 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 01:19:38,905 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 01:19:38,907 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 01:19:38,909 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 01:19:38,909 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 01:19:38,910 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 01:19:38,911 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 01:19:38,912 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 01:19:38,913 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 01:19:38,914 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 01:19:38,915 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 01:19:38,916 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 01:19:38,918 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 01:19:38,920 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 01:19:38,921 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 01:19:38,923 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 01:19:38,924 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 01:19:38,926 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 01:19:38,926 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 01:19:38,927 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 01:19:38,928 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 01:19:38,929 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 01:19:38,929 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 01:19:38,930 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 01:19:38,931 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 01:19:38,931 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 01:19:38,932 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 01:19:38,932 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 01:19:38,933 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 01:19:38,933 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 01:19:38,936 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 01:19:38,936 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 01:19:38,968 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 01:19:38,968 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 01:19:38,969 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 01:19:38,969 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 01:19:38,969 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 01:19:38,970 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 01:19:38,970 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 01:19:38,970 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 01:19:38,970 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 01:19:38,970 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 01:19:38,971 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 01:19:38,971 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 01:19:38,971 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 01:19:38,972 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 01:19:38,972 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 01:19:38,972 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 01:19:38,972 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 01:19:38,972 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 01:19:38,973 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 01:19:38,973 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 01:19:38,973 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 01:19:38,973 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 01:19:38,973 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 01:19:38,974 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 01:19:38,974 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 01:19:38,974 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 01:19:38,974 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 01:19:38,974 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 01:19:38,975 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 01:19:38,975 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 01:19:38,975 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 01:19:38,975 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 01:19:38,975 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 01:19:38,975 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 01:19:39,020 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 01:19:39,033 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 01:19:39,037 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 01:19:39,039 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 01:19:39,039 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 01:19:39,040 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label49_true-unreach-call_false-termination.c [2018-11-07 01:19:39,107 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/319dd0510/5c4135630c4c4c5cb775de0e99fb2b74/FLAG108c34d7b [2018-11-07 01:19:39,694 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 01:19:39,699 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label49_true-unreach-call_false-termination.c [2018-11-07 01:19:39,725 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/319dd0510/5c4135630c4c4c5cb775de0e99fb2b74/FLAG108c34d7b [2018-11-07 01:19:39,749 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/319dd0510/5c4135630c4c4c5cb775de0e99fb2b74 [2018-11-07 01:19:39,764 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 01:19:39,766 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 01:19:39,767 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 01:19:39,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 01:19:39,773 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 01:19:39,774 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:19:39" (1/1) ... [2018-11-07 01:19:39,777 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75e3b70b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:19:39, skipping insertion in model container [2018-11-07 01:19:39,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:19:39" (1/1) ... [2018-11-07 01:19:39,788 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 01:19:39,864 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 01:19:40,355 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 01:19:40,360 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 01:19:40,457 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 01:19:40,482 INFO L193 MainTranslator]: Completed translation [2018-11-07 01:19:40,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:19:40 WrapperNode [2018-11-07 01:19:40,482 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 01:19:40,483 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 01:19:40,484 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 01:19:40,484 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 01:19:40,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:19:40" (1/1) ... [2018-11-07 01:19:40,614 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:19:40" (1/1) ... [2018-11-07 01:19:40,622 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 01:19:40,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 01:19:40,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 01:19:40,623 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 01:19:40,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:19:40" (1/1) ... [2018-11-07 01:19:40,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:19:40" (1/1) ... [2018-11-07 01:19:40,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:19:40" (1/1) ... [2018-11-07 01:19:40,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:19:40" (1/1) ... [2018-11-07 01:19:40,710 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:19:40" (1/1) ... [2018-11-07 01:19:40,741 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:19:40" (1/1) ... [2018-11-07 01:19:40,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:19:40" (1/1) ... [2018-11-07 01:19:40,768 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 01:19:40,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 01:19:40,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 01:19:40,770 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 01:19:40,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:19:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 01:19:40,832 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 01:19:40,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 01:19:40,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 01:19:40,833 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 01:19:40,833 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 01:19:40,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 01:19:40,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 01:19:40,833 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 01:19:40,834 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 01:19:44,405 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 01:19:44,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:19:44 BoogieIcfgContainer [2018-11-07 01:19:44,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 01:19:44,410 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 01:19:44,410 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 01:19:44,419 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 01:19:44,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:19:39" (1/3) ... [2018-11-07 01:19:44,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44398d1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:19:44, skipping insertion in model container [2018-11-07 01:19:44,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:19:40" (2/3) ... [2018-11-07 01:19:44,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44398d1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:19:44, skipping insertion in model container [2018-11-07 01:19:44,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:19:44" (3/3) ... [2018-11-07 01:19:44,424 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label49_true-unreach-call_false-termination.c [2018-11-07 01:19:44,436 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 01:19:44,448 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 01:19:44,466 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 01:19:44,508 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 01:19:44,508 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 01:19:44,509 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 01:19:44,509 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 01:19:44,509 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 01:19:44,509 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 01:19:44,510 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 01:19:44,510 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 01:19:44,539 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-07 01:19:44,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-07 01:19:44,555 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:19:44,557 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 01:19:44,560 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:19:44,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:19:44,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1826364152, now seen corresponding path program 1 times [2018-11-07 01:19:44,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:19:44,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:19:44,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:19:44,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:19:44,622 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:19:44,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:19:45,218 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 01:19:45,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:19:45,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 01:19:45,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 01:19:45,376 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:19:45,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 01:19:45,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 01:19:45,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 01:19:45,404 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-07 01:19:46,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:19:46,944 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-11-07 01:19:46,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 01:19:46,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2018-11-07 01:19:46,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:19:46,969 INFO L225 Difference]: With dead ends: 621 [2018-11-07 01:19:46,969 INFO L226 Difference]: Without dead ends: 382 [2018-11-07 01:19:46,977 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 01:19:47,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-07 01:19:47,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-11-07 01:19:47,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-07 01:19:47,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-11-07 01:19:47,076 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 132 [2018-11-07 01:19:47,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:19:47,078 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-11-07 01:19:47,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 01:19:47,078 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-11-07 01:19:47,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-07 01:19:47,088 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:19:47,089 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 01:19:47,089 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:19:47,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:19:47,090 INFO L82 PathProgramCache]: Analyzing trace with hash 660432277, now seen corresponding path program 1 times [2018-11-07 01:19:47,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:19:47,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:19:47,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:19:47,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:19:47,094 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:19:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:19:47,585 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-07 01:19:47,733 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:19:47,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 01:19:47,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 01:19:47,734 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:19:47,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 01:19:47,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 01:19:47,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 01:19:47,738 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-11-07 01:19:49,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:19:49,500 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-11-07 01:19:49,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 01:19:49,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2018-11-07 01:19:49,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:19:49,509 INFO L225 Difference]: With dead ends: 903 [2018-11-07 01:19:49,509 INFO L226 Difference]: Without dead ends: 381 [2018-11-07 01:19:49,514 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 01:19:49,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-11-07 01:19:49,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-11-07 01:19:49,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-11-07 01:19:49,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-11-07 01:19:49,550 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 141 [2018-11-07 01:19:49,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:19:49,551 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-11-07 01:19:49,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 01:19:49,551 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-11-07 01:19:49,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-07 01:19:49,555 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:19:49,556 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 01:19:49,556 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:19:49,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:19:49,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1332602505, now seen corresponding path program 1 times [2018-11-07 01:19:49,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:19:49,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:19:49,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:19:49,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:19:49,559 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:19:49,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:19:49,996 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:19:49,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 01:19:49,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 01:19:49,998 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:19:49,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 01:19:49,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 01:19:49,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 01:19:50,000 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-11-07 01:19:51,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:19:51,883 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-11-07 01:19:51,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 01:19:51,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2018-11-07 01:19:51,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:19:51,887 INFO L225 Difference]: With dead ends: 901 [2018-11-07 01:19:51,887 INFO L226 Difference]: Without dead ends: 380 [2018-11-07 01:19:51,891 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 01:19:51,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-11-07 01:19:51,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-11-07 01:19:51,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-07 01:19:51,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-11-07 01:19:51,935 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 147 [2018-11-07 01:19:51,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:19:51,935 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-11-07 01:19:51,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 01:19:51,936 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-11-07 01:19:51,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-07 01:19:51,938 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:19:51,939 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 01:19:51,939 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:19:51,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:19:51,940 INFO L82 PathProgramCache]: Analyzing trace with hash -203936942, now seen corresponding path program 1 times [2018-11-07 01:19:51,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:19:51,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:19:51,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:19:51,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:19:51,942 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:19:51,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:19:52,155 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:19:52,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 01:19:52,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 01:19:52,156 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:19:52,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 01:19:52,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 01:19:52,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 01:19:52,157 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-11-07 01:19:55,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:19:55,191 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-11-07 01:19:55,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 01:19:55,192 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2018-11-07 01:19:55,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:19:55,199 INFO L225 Difference]: With dead ends: 1193 [2018-11-07 01:19:55,199 INFO L226 Difference]: Without dead ends: 819 [2018-11-07 01:19:55,202 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 01:19:55,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-11-07 01:19:55,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-11-07 01:19:55,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-11-07 01:19:55,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-11-07 01:19:55,240 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 155 [2018-11-07 01:19:55,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:19:55,240 INFO L480 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-11-07 01:19:55,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 01:19:55,241 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-11-07 01:19:55,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-07 01:19:55,245 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:19:55,245 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 01:19:55,246 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:19:55,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:19:55,246 INFO L82 PathProgramCache]: Analyzing trace with hash -749626802, now seen corresponding path program 1 times [2018-11-07 01:19:55,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:19:55,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:19:55,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:19:55,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:19:55,248 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:19:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:19:55,528 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:19:55,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 01:19:55,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 01:19:55,529 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:19:55,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 01:19:55,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 01:19:55,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 01:19:55,530 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-11-07 01:19:56,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:19:56,697 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-11-07 01:19:56,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 01:19:56,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2018-11-07 01:19:56,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:19:56,716 INFO L225 Difference]: With dead ends: 1753 [2018-11-07 01:19:56,716 INFO L226 Difference]: Without dead ends: 804 [2018-11-07 01:19:56,720 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 01:19:56,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-11-07 01:19:56,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-11-07 01:19:56,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-11-07 01:19:56,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-11-07 01:19:56,753 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 157 [2018-11-07 01:19:56,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:19:56,754 INFO L480 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-11-07 01:19:56,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 01:19:56,754 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-11-07 01:19:56,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-07 01:19:56,758 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:19:56,758 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 01:19:56,758 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:19:56,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:19:56,759 INFO L82 PathProgramCache]: Analyzing trace with hash -650421942, now seen corresponding path program 1 times [2018-11-07 01:19:56,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:19:56,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:19:56,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:19:56,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:19:56,760 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:19:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:19:57,114 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-07 01:19:57,195 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:19:57,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 01:19:57,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 01:19:57,196 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:19:57,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 01:19:57,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 01:19:57,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 01:19:57,197 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-11-07 01:19:58,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:19:58,284 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-11-07 01:19:58,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 01:19:58,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2018-11-07 01:19:58,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:19:58,301 INFO L225 Difference]: With dead ends: 1747 [2018-11-07 01:19:58,301 INFO L226 Difference]: Without dead ends: 801 [2018-11-07 01:19:58,305 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 01:19:58,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-11-07 01:19:58,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-11-07 01:19:58,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-11-07 01:19:58,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-11-07 01:19:58,329 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 159 [2018-11-07 01:19:58,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:19:58,330 INFO L480 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-11-07 01:19:58,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 01:19:58,330 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-11-07 01:19:58,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-07 01:19:58,334 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:19:58,335 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 01:19:58,335 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:19:58,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:19:58,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1376765762, now seen corresponding path program 1 times [2018-11-07 01:19:58,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:19:58,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:19:58,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:19:58,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:19:58,337 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:19:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:19:58,477 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:19:58,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 01:19:58,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 01:19:58,478 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:19:58,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 01:19:58,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 01:19:58,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 01:19:58,479 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-11-07 01:20:00,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:20:00,577 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-11-07 01:20:00,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 01:20:00,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2018-11-07 01:20:00,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:20:00,590 INFO L225 Difference]: With dead ends: 2381 [2018-11-07 01:20:00,591 INFO L226 Difference]: Without dead ends: 1586 [2018-11-07 01:20:00,596 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 01:20:00,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-11-07 01:20:00,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-11-07 01:20:00,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-11-07 01:20:00,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-11-07 01:20:00,648 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 163 [2018-11-07 01:20:00,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:20:00,648 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-11-07 01:20:00,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 01:20:00,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-11-07 01:20:00,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-07 01:20:00,656 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:20:00,656 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 01:20:00,657 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:20:00,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:20:00,657 INFO L82 PathProgramCache]: Analyzing trace with hash 213430480, now seen corresponding path program 1 times [2018-11-07 01:20:00,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:20:00,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:20:00,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:20:00,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:20:00,659 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:20:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:20:00,842 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:20:00,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 01:20:00,842 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 01:20:00,843 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 199 with the following transitions: [2018-11-07 01:20:00,846 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [727], [729], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 01:20:00,946 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 01:20:00,946 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 01:20:31,225 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 01:20:31,227 INFO L272 AbstractInterpreter]: Visited 136 different actions 266 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-07 01:20:31,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:20:31,238 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 01:20:38,276 INFO L227 lantSequenceWeakener]: Weakened 73 states. On average, predicates are now at 82.53% of their original sizes. [2018-11-07 01:20:38,276 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 01:21:39,524 INFO L415 sIntCurrentIteration]: We unified 197 AI predicates to 197 [2018-11-07 01:21:39,525 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 01:21:39,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 01:21:39,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [6] total 26 [2018-11-07 01:21:39,526 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:21:39,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 01:21:39,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 01:21:39,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2018-11-07 01:21:39,528 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 22 states. Received shutdown request... [2018-11-07 01:23:52,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-07 01:23:52,829 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 01:23:52,835 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 01:23:52,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:23:52 BoogieIcfgContainer [2018-11-07 01:23:52,836 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 01:23:52,837 INFO L168 Benchmark]: Toolchain (without parser) took 253071.97 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-11-07 01:23:52,838 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 01:23:52,839 INFO L168 Benchmark]: CACSL2BoogieTranslator took 715.50 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-07 01:23:52,839 INFO L168 Benchmark]: Boogie Procedure Inliner took 139.19 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -810.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. [2018-11-07 01:23:52,840 INFO L168 Benchmark]: Boogie Preprocessor took 146.67 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 01:23:52,841 INFO L168 Benchmark]: RCFGBuilder took 3636.53 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: 105.3 MB). Peak memory consumption was 105.3 MB. Max. memory is 7.1 GB. [2018-11-07 01:23:52,842 INFO L168 Benchmark]: TraceAbstraction took 248426.17 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.7 GB in the end (delta: -583.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-11-07 01:23:52,847 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 715.50 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 139.19 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -810.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 146.67 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 3636.53 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: 105.3 MB). Peak memory consumption was 105.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 248426.17 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.7 GB in the end (delta: -583.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 547]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 30 states, 22 states before enhancement),while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. TIMEOUT Result, 248.3s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 146.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 950 SDtfs, 5064 SDslu, 762 SDs, 0 SdLazy, 5943 SolverSat, 1175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 68.7s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 261 GetRequests, 188 SyntacticMatches, 17 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 67.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1558occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 30.3s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9952993335306991 AbsIntWeakeningRatio, 0.16751269035532995 AbsIntAvgWeakeningVarsNumRemoved, 919.8934010152284 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 40 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1252 NumberOfCodeBlocks, 1252 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1244 ConstructedInterpolants, 0 QuantifiedInterpolants, 1293759 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 201/203 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown