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/Problem03_label17_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 13:01:51,874 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 13:01:51,877 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 13:01:51,889 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 13:01:51,890 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 13:01:51,891 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 13:01:51,892 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 13:01:51,894 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 13:01:51,896 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 13:01:51,896 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 13:01:51,897 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 13:01:51,898 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 13:01:51,899 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 13:01:51,900 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 13:01:51,901 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 13:01:51,902 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 13:01:51,902 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 13:01:51,908 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 13:01:51,912 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 13:01:51,914 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 13:01:51,917 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 13:01:51,921 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 13:01:51,927 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 13:01:51,927 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 13:01:51,927 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 13:01:51,928 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 13:01:51,932 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 13:01:51,933 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 13:01:51,933 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 13:01:51,936 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 13:01:51,936 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 13:01:51,936 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 13:01:51,938 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 13:01:51,938 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 13:01:51,939 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 13:01:51,940 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 13:01:51,941 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 13:01:51,960 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 13:01:51,961 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 13:01:51,962 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 13:01:51,962 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 13:01:51,962 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 13:01:51,962 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 13:01:51,962 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 13:01:51,963 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 13:01:51,963 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 13:01:51,963 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 13:01:51,963 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 13:01:51,963 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 13:01:51,964 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 13:01:51,964 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 13:01:51,964 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 13:01:51,965 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 13:01:51,965 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 13:01:51,965 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 13:01:51,965 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 13:01:51,965 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 13:01:51,966 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 13:01:51,966 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 13:01:51,966 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 13:01:51,966 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 13:01:51,966 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 13:01:51,967 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 13:01:51,967 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 13:01:51,967 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 13:01:51,967 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 13:01:51,967 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 13:01:51,968 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 13:01:51,968 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 13:01:51,968 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 13:01:51,968 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 13:01:52,015 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 13:01:52,034 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 13:01:52,038 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 13:01:52,039 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 13:01:52,040 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 13:01:52,040 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label17_true-unreach-call.c [2018-11-07 13:01:52,111 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74b141ea9/001560ae4300460fa95975559692ac15/FLAGc86d63f91 [2018-11-07 13:01:52,786 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 13:01:52,787 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label17_true-unreach-call.c [2018-11-07 13:01:52,805 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74b141ea9/001560ae4300460fa95975559692ac15/FLAGc86d63f91 [2018-11-07 13:01:52,821 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74b141ea9/001560ae4300460fa95975559692ac15 [2018-11-07 13:01:52,832 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 13:01:52,834 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 13:01:52,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 13:01:52,835 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 13:01:52,839 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 13:01:52,840 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:01:52" (1/1) ... [2018-11-07 13:01:52,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e99bbe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:01:52, skipping insertion in model container [2018-11-07 13:01:52,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:01:52" (1/1) ... [2018-11-07 13:01:52,854 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 13:01:52,939 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 13:01:53,628 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 13:01:53,634 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 13:01:53,969 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 13:01:53,994 INFO L193 MainTranslator]: Completed translation [2018-11-07 13:01:53,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:01:53 WrapperNode [2018-11-07 13:01:53,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 13:01:53,996 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 13:01:53,996 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 13:01:53,996 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 13:01:54,007 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:01:53" (1/1) ... [2018-11-07 13:01:54,203 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:01:53" (1/1) ... [2018-11-07 13:01:54,218 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 13:01:54,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 13:01:54,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 13:01:54,219 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 13:01:54,230 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:01:53" (1/1) ... [2018-11-07 13:01:54,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:01:53" (1/1) ... [2018-11-07 13:01:54,238 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:01:53" (1/1) ... [2018-11-07 13:01:54,238 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:01:53" (1/1) ... [2018-11-07 13:01:54,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:01:53" (1/1) ... [2018-11-07 13:01:54,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:01:53" (1/1) ... [2018-11-07 13:01:54,352 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:01:53" (1/1) ... [2018-11-07 13:01:54,368 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 13:01:54,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 13:01:54,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 13:01:54,369 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 13:01:54,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:01:53" (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 13:01:54,439 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 13:01:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 13:01:54,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 13:01:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 13:01:54,440 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 13:01:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 13:01:54,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 13:01:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 13:01:54,442 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 13:01:59,652 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 13:01:59,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:01:59 BoogieIcfgContainer [2018-11-07 13:01:59,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 13:01:59,659 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 13:01:59,659 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 13:01:59,663 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 13:01:59,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:01:52" (1/3) ... [2018-11-07 13:01:59,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12c3d577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:01:59, skipping insertion in model container [2018-11-07 13:01:59,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:01:53" (2/3) ... [2018-11-07 13:01:59,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12c3d577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:01:59, skipping insertion in model container [2018-11-07 13:01:59,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:01:59" (3/3) ... [2018-11-07 13:01:59,668 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label17_true-unreach-call.c [2018-11-07 13:01:59,681 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 13:01:59,699 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 13:01:59,720 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 13:01:59,774 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 13:01:59,774 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 13:01:59,774 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 13:01:59,774 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 13:01:59,774 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 13:01:59,775 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 13:01:59,775 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 13:01:59,775 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 13:01:59,809 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states. [2018-11-07 13:01:59,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-07 13:01:59,832 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 13:01:59,834 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:01:59,837 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 13:01:59,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 13:01:59,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1877378719, now seen corresponding path program 1 times [2018-11-07 13:01:59,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 13:01:59,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 13:01:59,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 13:01:59,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 13:01:59,897 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 13:02:00,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 13:02:01,079 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 13:02:01,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 13:02:01,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 13:02:01,082 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 13:02:01,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 13:02:01,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 13:02:01,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 13:02:01,108 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 4 states. [2018-11-07 13:02:05,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 13:02:05,011 INFO L93 Difference]: Finished difference Result 1066 states and 1924 transitions. [2018-11-07 13:02:05,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 13:02:05,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2018-11-07 13:02:05,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 13:02:05,040 INFO L225 Difference]: With dead ends: 1066 [2018-11-07 13:02:05,040 INFO L226 Difference]: Without dead ends: 748 [2018-11-07 13:02:05,050 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 13:02:05,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2018-11-07 13:02:05,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 527. [2018-11-07 13:02:05,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-11-07 13:02:05,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 902 transitions. [2018-11-07 13:02:05,153 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 902 transitions. Word has length 206 [2018-11-07 13:02:05,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 13:02:05,154 INFO L480 AbstractCegarLoop]: Abstraction has 527 states and 902 transitions. [2018-11-07 13:02:05,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 13:02:05,155 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 902 transitions. [2018-11-07 13:02:05,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-07 13:02:05,164 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 13:02:05,164 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:02:05,165 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 13:02:05,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 13:02:05,165 INFO L82 PathProgramCache]: Analyzing trace with hash -360788856, now seen corresponding path program 1 times [2018-11-07 13:02:05,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 13:02:05,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 13:02:05,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 13:02:05,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 13:02:05,168 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 13:02:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 13:02:05,563 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-11-07 13:02:05,938 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 13:02:05,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 13:02:05,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 13:02:05,939 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 13:02:05,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 13:02:05,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 13:02:05,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 13:02:05,946 INFO L87 Difference]: Start difference. First operand 527 states and 902 transitions. Second operand 6 states. [2018-11-07 13:02:08,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 13:02:08,865 INFO L93 Difference]: Finished difference Result 1590 states and 2793 transitions. [2018-11-07 13:02:08,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 13:02:08,868 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 216 [2018-11-07 13:02:08,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 13:02:08,880 INFO L225 Difference]: With dead ends: 1590 [2018-11-07 13:02:08,880 INFO L226 Difference]: Without dead ends: 1069 [2018-11-07 13:02:08,886 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 13:02:08,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2018-11-07 13:02:08,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1024. [2018-11-07 13:02:08,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-11-07 13:02:08,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1746 transitions. [2018-11-07 13:02:08,967 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1746 transitions. Word has length 216 [2018-11-07 13:02:08,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 13:02:08,967 INFO L480 AbstractCegarLoop]: Abstraction has 1024 states and 1746 transitions. [2018-11-07 13:02:08,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 13:02:08,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1746 transitions. [2018-11-07 13:02:08,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-11-07 13:02:08,975 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 13:02:08,975 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:02:08,975 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 13:02:08,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 13:02:08,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1375336592, now seen corresponding path program 1 times [2018-11-07 13:02:08,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 13:02:08,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 13:02:08,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 13:02:08,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 13:02:08,978 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 13:02:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 13:02:09,255 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 13:02:09,380 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 13:02:09,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 13:02:09,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 13:02:09,381 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 13:02:09,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 13:02:09,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 13:02:09,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 13:02:09,382 INFO L87 Difference]: Start difference. First operand 1024 states and 1746 transitions. Second operand 5 states. [2018-11-07 13:02:12,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 13:02:12,529 INFO L93 Difference]: Finished difference Result 3166 states and 5674 transitions. [2018-11-07 13:02:12,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 13:02:12,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2018-11-07 13:02:12,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 13:02:12,552 INFO L225 Difference]: With dead ends: 3166 [2018-11-07 13:02:12,552 INFO L226 Difference]: Without dead ends: 2148 [2018-11-07 13:02:12,560 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 13:02:12,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2018-11-07 13:02:12,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 2105. [2018-11-07 13:02:12,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2105 states. [2018-11-07 13:02:12,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 3422 transitions. [2018-11-07 13:02:12,660 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 3422 transitions. Word has length 217 [2018-11-07 13:02:12,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 13:02:12,661 INFO L480 AbstractCegarLoop]: Abstraction has 2105 states and 3422 transitions. [2018-11-07 13:02:12,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 13:02:12,661 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 3422 transitions. [2018-11-07 13:02:12,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-07 13:02:12,670 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 13:02:12,670 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:02:12,671 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 13:02:12,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 13:02:12,671 INFO L82 PathProgramCache]: Analyzing trace with hash 809544677, now seen corresponding path program 1 times [2018-11-07 13:02:12,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 13:02:12,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 13:02:12,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 13:02:12,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 13:02:12,673 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 13:02:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 13:02:13,166 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 13:02:13,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 13:02:13,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 13:02:13,167 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 13:02:13,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 13:02:13,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 13:02:13,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 13:02:13,168 INFO L87 Difference]: Start difference. First operand 2105 states and 3422 transitions. Second operand 3 states. [2018-11-07 13:02:15,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 13:02:15,166 INFO L93 Difference]: Finished difference Result 6108 states and 10330 transitions. [2018-11-07 13:02:15,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 13:02:15,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2018-11-07 13:02:15,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 13:02:15,191 INFO L225 Difference]: With dead ends: 6108 [2018-11-07 13:02:15,191 INFO L226 Difference]: Without dead ends: 4009 [2018-11-07 13:02:15,202 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 13:02:15,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2018-11-07 13:02:15,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 3973. [2018-11-07 13:02:15,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3973 states. [2018-11-07 13:02:15,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3973 states to 3973 states and 6514 transitions. [2018-11-07 13:02:15,320 INFO L78 Accepts]: Start accepts. Automaton has 3973 states and 6514 transitions. Word has length 219 [2018-11-07 13:02:15,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 13:02:15,320 INFO L480 AbstractCegarLoop]: Abstraction has 3973 states and 6514 transitions. [2018-11-07 13:02:15,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 13:02:15,320 INFO L276 IsEmpty]: Start isEmpty. Operand 3973 states and 6514 transitions. [2018-11-07 13:02:15,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-11-07 13:02:15,335 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 13:02:15,336 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:02:15,336 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 13:02:15,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 13:02:15,337 INFO L82 PathProgramCache]: Analyzing trace with hash -703936903, now seen corresponding path program 1 times [2018-11-07 13:02:15,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 13:02:15,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 13:02:15,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 13:02:15,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 13:02:15,338 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 13:02:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 13:02:15,822 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-07 13:02:16,020 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 13:02:16,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 13:02:16,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-07 13:02:16,021 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 13:02:16,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 13:02:16,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 13:02:16,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-07 13:02:16,022 INFO L87 Difference]: Start difference. First operand 3973 states and 6514 transitions. Second operand 7 states. [2018-11-07 13:02:18,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 13:02:18,150 INFO L93 Difference]: Finished difference Result 12096 states and 22014 transitions. [2018-11-07 13:02:18,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 13:02:18,159 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 225 [2018-11-07 13:02:18,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 13:02:18,223 INFO L225 Difference]: With dead ends: 12096 [2018-11-07 13:02:18,224 INFO L226 Difference]: Without dead ends: 8129 [2018-11-07 13:02:18,244 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-07 13:02:18,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8129 states. [2018-11-07 13:02:18,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8129 to 7942. [2018-11-07 13:02:18,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7942 states. [2018-11-07 13:02:18,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7942 states to 7942 states and 13503 transitions. [2018-11-07 13:02:18,600 INFO L78 Accepts]: Start accepts. Automaton has 7942 states and 13503 transitions. Word has length 225 [2018-11-07 13:02:18,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 13:02:18,600 INFO L480 AbstractCegarLoop]: Abstraction has 7942 states and 13503 transitions. [2018-11-07 13:02:18,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 13:02:18,601 INFO L276 IsEmpty]: Start isEmpty. Operand 7942 states and 13503 transitions. [2018-11-07 13:02:18,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-07 13:02:18,640 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 13:02:18,641 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:02:18,641 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 13:02:18,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 13:02:18,642 INFO L82 PathProgramCache]: Analyzing trace with hash -520261908, now seen corresponding path program 1 times [2018-11-07 13:02:18,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 13:02:18,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 13:02:18,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 13:02:18,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 13:02:18,644 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 13:02:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 13:02:18,929 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 13:02:19,232 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 13:02:19,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 13:02:19,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 13:02:19,232 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 13:02:19,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 13:02:19,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 13:02:19,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 13:02:19,233 INFO L87 Difference]: Start difference. First operand 7942 states and 13503 transitions. Second operand 6 states. [2018-11-07 13:02:21,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 13:02:21,721 INFO L93 Difference]: Finished difference Result 22960 states and 42530 transitions. [2018-11-07 13:02:21,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 13:02:21,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 230 [2018-11-07 13:02:21,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 13:02:21,829 INFO L225 Difference]: With dead ends: 22960 [2018-11-07 13:02:21,830 INFO L226 Difference]: Without dead ends: 15024 [2018-11-07 13:02:21,868 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 13:02:21,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15024 states. [2018-11-07 13:02:22,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15024 to 14866. [2018-11-07 13:02:22,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14866 states. [2018-11-07 13:02:22,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14866 states to 14866 states and 24364 transitions. [2018-11-07 13:02:22,390 INFO L78 Accepts]: Start accepts. Automaton has 14866 states and 24364 transitions. Word has length 230 [2018-11-07 13:02:22,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 13:02:22,390 INFO L480 AbstractCegarLoop]: Abstraction has 14866 states and 24364 transitions. [2018-11-07 13:02:22,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 13:02:22,391 INFO L276 IsEmpty]: Start isEmpty. Operand 14866 states and 24364 transitions. [2018-11-07 13:02:22,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-11-07 13:02:22,451 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 13:02:22,451 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:02:22,452 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 13:02:22,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 13:02:22,452 INFO L82 PathProgramCache]: Analyzing trace with hash -2136033641, now seen corresponding path program 1 times [2018-11-07 13:02:22,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 13:02:22,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 13:02:22,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 13:02:22,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 13:02:22,453 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 13:02:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 13:02:23,050 WARN L179 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-07 13:02:23,326 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-07 13:02:23,922 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-07 13:02:24,273 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-07 13:02:24,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 13:02:24,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 13:02:24,274 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 13:02:24,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 13:02:24,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 13:02:24,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-07 13:02:24,276 INFO L87 Difference]: Start difference. First operand 14866 states and 24364 transitions. Second operand 6 states. [2018-11-07 13:02:27,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 13:02:27,423 INFO L93 Difference]: Finished difference Result 31818 states and 52440 transitions. [2018-11-07 13:02:27,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 13:02:27,424 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 254 [2018-11-07 13:02:27,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 13:02:27,497 INFO L225 Difference]: With dead ends: 31818 [2018-11-07 13:02:27,497 INFO L226 Difference]: Without dead ends: 16918 [2018-11-07 13:02:27,550 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-07 13:02:27,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16918 states. [2018-11-07 13:02:27,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16918 to 16916. [2018-11-07 13:02:27,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16916 states. [2018-11-07 13:02:27,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16916 states to 16916 states and 26691 transitions. [2018-11-07 13:02:27,973 INFO L78 Accepts]: Start accepts. Automaton has 16916 states and 26691 transitions. Word has length 254 [2018-11-07 13:02:27,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 13:02:27,973 INFO L480 AbstractCegarLoop]: Abstraction has 16916 states and 26691 transitions. [2018-11-07 13:02:27,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 13:02:27,974 INFO L276 IsEmpty]: Start isEmpty. Operand 16916 states and 26691 transitions. [2018-11-07 13:02:28,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-11-07 13:02:28,038 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 13:02:28,039 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 13:02:28,039 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 13:02:28,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 13:02:28,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1208828973, now seen corresponding path program 1 times [2018-11-07 13:02:28,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 13:02:28,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 13:02:28,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 13:02:28,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 13:02:28,041 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 13:02:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 13:02:28,424 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 13:02:28,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 13:02:28,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 13:02:28,425 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 13:02:28,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 13:02:28,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 13:02:28,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 13:02:28,427 INFO L87 Difference]: Start difference. First operand 16916 states and 26691 transitions. Second operand 3 states. [2018-11-07 13:02:30,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 13:02:30,348 INFO L93 Difference]: Finished difference Result 46520 states and 75721 transitions. [2018-11-07 13:02:30,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 13:02:30,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 285 [2018-11-07 13:02:30,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 13:02:30,494 INFO L225 Difference]: With dead ends: 46520 [2018-11-07 13:02:30,494 INFO L226 Difference]: Without dead ends: 29610 [2018-11-07 13:02:30,554 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 13:02:30,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29610 states. [2018-11-07 13:02:31,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29610 to 29560. [2018-11-07 13:02:31,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29560 states. [2018-11-07 13:02:31,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29560 states to 29560 states and 45643 transitions. [2018-11-07 13:02:31,278 INFO L78 Accepts]: Start accepts. Automaton has 29560 states and 45643 transitions. Word has length 285 [2018-11-07 13:02:31,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 13:02:31,279 INFO L480 AbstractCegarLoop]: Abstraction has 29560 states and 45643 transitions. [2018-11-07 13:02:31,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 13:02:31,279 INFO L276 IsEmpty]: Start isEmpty. Operand 29560 states and 45643 transitions. [2018-11-07 13:02:31,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-11-07 13:02:31,348 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 13:02:31,348 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:02:31,348 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 13:02:31,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 13:02:31,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1586453435, now seen corresponding path program 1 times [2018-11-07 13:02:31,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 13:02:31,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 13:02:31,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 13:02:31,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 13:02:31,351 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 13:02:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 13:02:31,690 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 13:02:32,098 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 85 proven. 50 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 13:02:32,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 13:02:32,099 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 13:02:32,100 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 297 with the following transitions: [2018-11-07 13:02:32,103 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [25], [29], [33], [37], [41], [45], [49], [52], [53], [57], [61], [65], [68], [71], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [174], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [857], [865], [873], [881], [889], [897], [905], [913], [921], [929], [937], [945], [953], [961], [969], [977], [985], [993], [1001], [1009], [1017], [1025], [1033], [1041], [1049], [1057], [1065], [1073], [1081], [1089], [1097], [1105], [1109], [1111], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-11-07 13:02:32,177 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 13:02:32,177 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 13:02:50,052 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 13:02:50,054 INFO L272 AbstractInterpreter]: Visited 208 different actions 208 times. Never merged. Never widened. Never found a fixpoint. Largest state had 88 variables. [2018-11-07 13:02:50,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 13:02:50,075 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 13:03:02,813 INFO L227 lantSequenceWeakener]: Weakened 282 states. On average, predicates are now at 73.78% of their original sizes. [2018-11-07 13:03:02,814 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 13:03:03,251 INFO L415 sIntCurrentIteration]: We unified 295 AI predicates to 295 [2018-11-07 13:03:03,251 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 13:03:03,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 13:03:03,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [10] total 26 [2018-11-07 13:03:03,253 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 13:03:03,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 13:03:03,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 13:03:03,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2018-11-07 13:03:03,254 INFO L87 Difference]: Start difference. First operand 29560 states and 45643 transitions. Second operand 18 states. [2018-11-07 13:03:51,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 13:03:51,534 INFO L93 Difference]: Finished difference Result 59324 states and 91543 transitions. [2018-11-07 13:03:51,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 13:03:51,534 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 296 [2018-11-07 13:03:51,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 13:03:51,657 INFO L225 Difference]: With dead ends: 59324 [2018-11-07 13:03:51,658 INFO L226 Difference]: Without dead ends: 29770 [2018-11-07 13:03:51,733 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 298 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2018-11-07 13:03:51,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29770 states. [2018-11-07 13:03:52,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29770 to 29768. [2018-11-07 13:03:52,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29768 states. [2018-11-07 13:03:52,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29768 states to 29768 states and 45861 transitions. [2018-11-07 13:03:52,454 INFO L78 Accepts]: Start accepts. Automaton has 29768 states and 45861 transitions. Word has length 296 [2018-11-07 13:03:52,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 13:03:52,454 INFO L480 AbstractCegarLoop]: Abstraction has 29768 states and 45861 transitions. [2018-11-07 13:03:52,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 13:03:52,454 INFO L276 IsEmpty]: Start isEmpty. Operand 29768 states and 45861 transitions. [2018-11-07 13:03:52,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-11-07 13:03:52,521 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 13:03:52,521 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:03:52,522 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 13:03:52,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 13:03:52,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1257760584, now seen corresponding path program 1 times [2018-11-07 13:03:52,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 13:03:52,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 13:03:52,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 13:03:52,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 13:03:52,530 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 13:03:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 13:03:52,911 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 13:03:53,184 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 121 proven. 38 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 13:03:53,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 13:03:53,184 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 13:03:53,185 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 309 with the following transitions: [2018-11-07 13:03:53,187 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [24], [25], [29], [33], [37], [41], [45], [49], [52], [53], [57], [61], [65], [68], [71], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [174], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [857], [865], [873], [881], [889], [897], [905], [913], [921], [929], [937], [945], [953], [961], [969], [977], [985], [993], [1001], [1009], [1017], [1025], [1033], [1041], [1049], [1057], [1065], [1073], [1081], [1089], [1097], [1105], [1109], [1111], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-11-07 13:03:53,197 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 13:03:53,198 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 13:04:55,206 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 13:04:55,206 INFO L272 AbstractInterpreter]: Visited 212 different actions 418 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 88 variables. [2018-11-07 13:04:55,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 13:04:55,222 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 13:05:32,492 INFO L227 lantSequenceWeakener]: Weakened 107 states. On average, predicates are now at 81.11% of their original sizes. [2018-11-07 13:05:32,492 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 13:05:37,405 INFO L415 sIntCurrentIteration]: We unified 307 AI predicates to 307 [2018-11-07 13:05:37,406 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 13:05:37,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 13:05:37,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [8] total 31 [2018-11-07 13:05:37,406 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 13:05:37,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 13:05:37,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 13:05:37,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2018-11-07 13:05:37,408 INFO L87 Difference]: Start difference. First operand 29768 states and 45861 transitions. Second operand 25 states. Received shutdown request... [2018-11-07 13:05:56,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 13:05:56,708 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 13:05:56,715 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 13:05:56,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:05:56 BoogieIcfgContainer [2018-11-07 13:05:56,715 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 13:05:56,716 INFO L168 Benchmark]: Toolchain (without parser) took 243883.14 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -954.7 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-11-07 13:05:56,717 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 13:05:56,718 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1160.54 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-11-07 13:05:56,719 INFO L168 Benchmark]: Boogie Procedure Inliner took 222.51 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 691.5 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -817.5 MB). Peak memory consumption was 38.8 MB. Max. memory is 7.1 GB. [2018-11-07 13:05:56,720 INFO L168 Benchmark]: Boogie Preprocessor took 149.76 ms. Allocated memory is still 2.2 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 13:05:56,720 INFO L168 Benchmark]: RCFGBuilder took 5288.89 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 247.7 MB). Peak memory consumption was 247.7 MB. Max. memory is 7.1 GB. [2018-11-07 13:05:56,721 INFO L168 Benchmark]: TraceAbstraction took 237056.47 ms. Allocated memory was 2.2 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 1.9 GB in the beginning and 2.3 GB in the end (delta: -469.4 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-11-07 13:05:56,726 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1160.54 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 222.51 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 691.5 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -817.5 MB). Peak memory consumption was 38.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 149.76 ms. Allocated memory is still 2.2 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 5288.89 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 247.7 MB). Peak memory consumption was 247.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 237056.47 ms. Allocated memory was 2.2 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 1.9 GB in the beginning and 2.3 GB in the end (delta: -469.4 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1632]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1632). Cancelled while BasicCegarLoop was constructing difference of abstraction (29768states) and FLOYD_HOARE automaton (currently 18 states, 25 states before enhancement),while ReachableStatesComputation was computing reachable states (303 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 312 locations, 1 error locations. TIMEOUT Result, 236.9s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 90.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1760 SDtfs, 7590 SDslu, 1603 SDs, 0 SdLazy, 10867 SolverSat, 1773 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 70.7s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 675 GetRequests, 543 SyntacticMatches, 47 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 9.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29768occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 80.0s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.9989355519160722 AbsIntWeakeningRatio, 0.2707641196013289 AbsIntAvgWeakeningVarsNumRemoved, 41.10963455149502 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 744 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 2456 NumberOfCodeBlocks, 2456 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 2446 ConstructedInterpolants, 0 QuantifiedInterpolants, 2455848 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 427/515 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown