java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/locks/test_locks_5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:49:51,869 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:49:51,871 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:49:51,883 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:49:51,884 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:49:51,885 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:49:51,886 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:49:51,888 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:49:51,890 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:49:51,891 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:49:51,892 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:49:51,893 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:49:51,893 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:49:51,894 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:49:51,895 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:49:51,896 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:49:51,897 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:49:51,898 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:49:51,900 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:49:51,902 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:49:51,903 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:49:51,905 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:49:51,906 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:49:51,907 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:49:51,909 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:49:51,909 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:49:51,909 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:49:51,910 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:49:51,911 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:49:51,912 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:49:51,912 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:49:51,913 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:49:51,913 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:49:51,914 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:49:51,915 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:49:51,915 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:49:51,916 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:49:51,916 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:49:51,916 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:49:51,917 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:49:51,918 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:49:51,919 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-09 05:49:51,933 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:49:51,934 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:49:51,934 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:49:51,934 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:49:51,935 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:49:51,935 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:49:51,935 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:49:51,935 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:49:51,936 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:49:51,936 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:49:51,937 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:49:51,937 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:49:51,937 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:49:51,937 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:49:51,937 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:49:51,938 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:49:51,938 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:49:51,938 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:49:51,938 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:49:51,938 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:49:51,939 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:49:51,939 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:49:51,939 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:49:51,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:49:51,940 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:49:51,940 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:49:51,940 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:49:51,940 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:49:51,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:49:51,940 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:49:51,969 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:49:51,980 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:49:51,983 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:49:51,985 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:49:51,985 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:49:51,986 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_5.c [2019-09-09 05:49:52,063 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3d6d6123/5afb7f9cd2ba4295a1215f5e6e0bd344/FLAG7d265f5b4 [2019-09-09 05:49:52,542 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:49:52,543 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2019-09-09 05:49:52,550 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3d6d6123/5afb7f9cd2ba4295a1215f5e6e0bd344/FLAG7d265f5b4 [2019-09-09 05:49:52,890 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3d6d6123/5afb7f9cd2ba4295a1215f5e6e0bd344 [2019-09-09 05:49:52,901 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:49:52,902 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:49:52,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:49:52,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:49:52,909 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:49:52,910 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:49:52" (1/1) ... [2019-09-09 05:49:52,913 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d3cdb20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:52, skipping insertion in model container [2019-09-09 05:49:52,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:49:52" (1/1) ... [2019-09-09 05:49:52,921 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:49:52,940 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:49:53,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:49:53,130 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:49:53,153 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:49:53,170 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:49:53,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:53 WrapperNode [2019-09-09 05:49:53,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:49:53,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:49:53,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:49:53,173 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:49:53,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:53" (1/1) ... [2019-09-09 05:49:53,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:53" (1/1) ... [2019-09-09 05:49:53,329 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:53" (1/1) ... [2019-09-09 05:49:53,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:53" (1/1) ... [2019-09-09 05:49:53,341 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:53" (1/1) ... [2019-09-09 05:49:53,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:53" (1/1) ... [2019-09-09 05:49:53,356 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:53" (1/1) ... [2019-09-09 05:49:53,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:49:53,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:49:53,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:49:53,362 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:49:53,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49: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 [2019-09-09 05:49:53,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:49:53,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:49:53,433 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:49:53,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:49:53,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:49:53,434 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:49:53,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:49:53,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:49:53,752 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:49:53,753 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:49:53,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:49:53 BoogieIcfgContainer [2019-09-09 05:49:53,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:49:53,755 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:49:53,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:49:53,758 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:49:53,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:49:52" (1/3) ... [2019-09-09 05:49:53,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bca0b20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:49:53, skipping insertion in model container [2019-09-09 05:49:53,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:53" (2/3) ... [2019-09-09 05:49:53,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bca0b20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:49:53, skipping insertion in model container [2019-09-09 05:49:53,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:49:53" (3/3) ... [2019-09-09 05:49:53,762 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2019-09-09 05:49:53,772 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:49:53,785 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:49:53,800 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:49:53,827 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:49:53,827 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:49:53,827 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:49:53,828 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:49:53,828 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:49:53,829 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:49:53,829 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:49:53,829 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:49:53,848 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-09-09 05:49:53,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-09 05:49:53,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:53,858 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:53,861 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:53,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:53,867 INFO L82 PathProgramCache]: Analyzing trace with hash 316328318, now seen corresponding path program 1 times [2019-09-09 05:49:53,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:53,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:53,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:53,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:53,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:54,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:54,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:54,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:54,054 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:54,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:54,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:54,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:54,073 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2019-09-09 05:49:54,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:54,136 INFO L93 Difference]: Finished difference Result 50 states and 77 transitions. [2019-09-09 05:49:54,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:54,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-09 05:49:54,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:54,149 INFO L225 Difference]: With dead ends: 50 [2019-09-09 05:49:54,150 INFO L226 Difference]: Without dead ends: 42 [2019-09-09 05:49:54,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:54,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-09 05:49:54,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-09-09 05:49:54,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-09 05:49:54,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2019-09-09 05:49:54,193 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 15 [2019-09-09 05:49:54,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:54,194 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2019-09-09 05:49:54,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:54,195 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2019-09-09 05:49:54,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-09 05:49:54,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:54,196 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:54,196 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:54,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:54,197 INFO L82 PathProgramCache]: Analyzing trace with hash -493018308, now seen corresponding path program 1 times [2019-09-09 05:49:54,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:54,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:54,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:54,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:54,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:54,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:54,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:54,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:54,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:54,256 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:54,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:54,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:54,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:54,260 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 3 states. [2019-09-09 05:49:54,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:54,307 INFO L93 Difference]: Finished difference Result 42 states and 66 transitions. [2019-09-09 05:49:54,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:54,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-09 05:49:54,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:54,309 INFO L225 Difference]: With dead ends: 42 [2019-09-09 05:49:54,309 INFO L226 Difference]: Without dead ends: 42 [2019-09-09 05:49:54,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:54,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-09 05:49:54,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-09-09 05:49:54,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-09 05:49:54,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 65 transitions. [2019-09-09 05:49:54,318 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 65 transitions. Word has length 15 [2019-09-09 05:49:54,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:54,319 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 65 transitions. [2019-09-09 05:49:54,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:54,319 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 65 transitions. [2019-09-09 05:49:54,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-09 05:49:54,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:54,321 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:54,321 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:54,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:54,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1216458266, now seen corresponding path program 1 times [2019-09-09 05:49:54,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:54,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:54,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:54,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:54,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:54,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:54,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:54,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:54,376 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:54,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:54,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:54,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:54,378 INFO L87 Difference]: Start difference. First operand 40 states and 65 transitions. Second operand 3 states. [2019-09-09 05:49:54,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:54,410 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2019-09-09 05:49:54,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:54,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-09 05:49:54,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:54,412 INFO L225 Difference]: With dead ends: 45 [2019-09-09 05:49:54,412 INFO L226 Difference]: Without dead ends: 45 [2019-09-09 05:49:54,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:54,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-09 05:49:54,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-09-09 05:49:54,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-09 05:49:54,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2019-09-09 05:49:54,427 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 67 transitions. Word has length 16 [2019-09-09 05:49:54,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:54,427 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 67 transitions. [2019-09-09 05:49:54,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:54,428 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2019-09-09 05:49:54,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-09 05:49:54,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:54,430 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:54,431 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:54,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:54,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1896516636, now seen corresponding path program 1 times [2019-09-09 05:49:54,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:54,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:54,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:54,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:54,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:54,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:54,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:54,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:54,477 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:54,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:54,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:54,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:54,479 INFO L87 Difference]: Start difference. First operand 43 states and 67 transitions. Second operand 3 states. [2019-09-09 05:49:54,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:54,511 INFO L93 Difference]: Finished difference Result 74 states and 117 transitions. [2019-09-09 05:49:54,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:54,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-09 05:49:54,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:54,514 INFO L225 Difference]: With dead ends: 74 [2019-09-09 05:49:54,516 INFO L226 Difference]: Without dead ends: 74 [2019-09-09 05:49:54,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:54,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-09 05:49:54,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2019-09-09 05:49:54,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-09 05:49:54,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 88 transitions. [2019-09-09 05:49:54,530 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 88 transitions. Word has length 16 [2019-09-09 05:49:54,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:54,531 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 88 transitions. [2019-09-09 05:49:54,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:54,531 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 88 transitions. [2019-09-09 05:49:54,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-09 05:49:54,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:54,534 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:54,535 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:54,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:54,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1087170010, now seen corresponding path program 1 times [2019-09-09 05:49:54,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:54,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:54,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:54,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:54,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:54,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:54,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:54,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:54,593 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:54,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:54,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:54,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:54,594 INFO L87 Difference]: Start difference. First operand 56 states and 88 transitions. Second operand 3 states. [2019-09-09 05:49:54,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:54,612 INFO L93 Difference]: Finished difference Result 76 states and 115 transitions. [2019-09-09 05:49:54,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:54,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-09 05:49:54,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:54,614 INFO L225 Difference]: With dead ends: 76 [2019-09-09 05:49:54,615 INFO L226 Difference]: Without dead ends: 76 [2019-09-09 05:49:54,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:54,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-09 05:49:54,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-09-09 05:49:54,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-09 05:49:54,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 114 transitions. [2019-09-09 05:49:54,625 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 114 transitions. Word has length 16 [2019-09-09 05:49:54,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:54,625 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 114 transitions. [2019-09-09 05:49:54,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:54,625 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 114 transitions. [2019-09-09 05:49:54,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-09 05:49:54,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:54,627 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:54,627 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:54,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:54,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1337311087, now seen corresponding path program 1 times [2019-09-09 05:49:54,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:54,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:54,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:54,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:54,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:54,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:54,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:54,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:54,672 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:54,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:54,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:54,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:54,674 INFO L87 Difference]: Start difference. First operand 74 states and 114 transitions. Second operand 3 states. [2019-09-09 05:49:54,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:54,696 INFO L93 Difference]: Finished difference Result 78 states and 115 transitions. [2019-09-09 05:49:54,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:54,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-09 05:49:54,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:54,698 INFO L225 Difference]: With dead ends: 78 [2019-09-09 05:49:54,698 INFO L226 Difference]: Without dead ends: 78 [2019-09-09 05:49:54,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:54,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-09 05:49:54,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-09-09 05:49:54,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-09 05:49:54,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 114 transitions. [2019-09-09 05:49:54,714 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 114 transitions. Word has length 17 [2019-09-09 05:49:54,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:54,714 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 114 transitions. [2019-09-09 05:49:54,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:54,715 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 114 transitions. [2019-09-09 05:49:54,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-09 05:49:54,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:54,716 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:54,716 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:54,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:54,717 INFO L82 PathProgramCache]: Analyzing trace with hash -657252717, now seen corresponding path program 1 times [2019-09-09 05:49:54,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:54,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:54,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:54,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:54,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:54,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:54,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:54,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:54,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:54,743 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:54,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:54,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:54,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:54,745 INFO L87 Difference]: Start difference. First operand 76 states and 114 transitions. Second operand 3 states. [2019-09-09 05:49:54,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:54,759 INFO L93 Difference]: Finished difference Result 130 states and 195 transitions. [2019-09-09 05:49:54,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:54,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-09 05:49:54,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:54,761 INFO L225 Difference]: With dead ends: 130 [2019-09-09 05:49:54,761 INFO L226 Difference]: Without dead ends: 130 [2019-09-09 05:49:54,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:54,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-09 05:49:54,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 104. [2019-09-09 05:49:54,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-09 05:49:54,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2019-09-09 05:49:54,771 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 17 [2019-09-09 05:49:54,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:54,772 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2019-09-09 05:49:54,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:54,772 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2019-09-09 05:49:54,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-09 05:49:54,773 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:54,773 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:54,774 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:54,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:54,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1466599343, now seen corresponding path program 1 times [2019-09-09 05:49:54,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:54,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:54,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:54,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:54,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:54,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:54,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:54,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:54,804 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:54,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:54,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:54,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:54,806 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand 3 states. [2019-09-09 05:49:54,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:54,838 INFO L93 Difference]: Finished difference Result 138 states and 195 transitions. [2019-09-09 05:49:54,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:54,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-09 05:49:54,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:54,841 INFO L225 Difference]: With dead ends: 138 [2019-09-09 05:49:54,841 INFO L226 Difference]: Without dead ends: 138 [2019-09-09 05:49:54,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:54,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-09 05:49:54,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-09-09 05:49:54,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-09 05:49:54,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 194 transitions. [2019-09-09 05:49:54,862 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 194 transitions. Word has length 17 [2019-09-09 05:49:54,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:54,868 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 194 transitions. [2019-09-09 05:49:54,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:54,868 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 194 transitions. [2019-09-09 05:49:54,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-09 05:49:54,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:54,870 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:54,870 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:54,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:54,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1100217935, now seen corresponding path program 1 times [2019-09-09 05:49:54,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:54,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:54,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:54,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:54,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:54,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:54,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:54,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:54,910 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:54,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:54,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:54,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:54,914 INFO L87 Difference]: Start difference. First operand 136 states and 194 transitions. Second operand 3 states. [2019-09-09 05:49:54,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:54,936 INFO L93 Difference]: Finished difference Result 142 states and 195 transitions. [2019-09-09 05:49:54,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:54,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-09 05:49:54,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:54,938 INFO L225 Difference]: With dead ends: 142 [2019-09-09 05:49:54,939 INFO L226 Difference]: Without dead ends: 142 [2019-09-09 05:49:54,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:54,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-09 05:49:54,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2019-09-09 05:49:54,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-09 05:49:54,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2019-09-09 05:49:54,954 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 18 [2019-09-09 05:49:54,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:54,954 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2019-09-09 05:49:54,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:54,955 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2019-09-09 05:49:54,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-09 05:49:54,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:54,957 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:54,957 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:54,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:54,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1780276305, now seen corresponding path program 1 times [2019-09-09 05:49:54,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:54,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:54,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:54,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:54,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:54,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:54,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:54,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:54,999 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:55,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:55,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:55,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:55,001 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand 3 states. [2019-09-09 05:49:55,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:55,020 INFO L93 Difference]: Finished difference Result 234 states and 319 transitions. [2019-09-09 05:49:55,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:55,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-09 05:49:55,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:55,025 INFO L225 Difference]: With dead ends: 234 [2019-09-09 05:49:55,025 INFO L226 Difference]: Without dead ends: 234 [2019-09-09 05:49:55,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:55,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-09-09 05:49:55,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 200. [2019-09-09 05:49:55,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-09 05:49:55,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 270 transitions. [2019-09-09 05:49:55,048 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 270 transitions. Word has length 18 [2019-09-09 05:49:55,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:55,049 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 270 transitions. [2019-09-09 05:49:55,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:55,052 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 270 transitions. [2019-09-09 05:49:55,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-09 05:49:55,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:55,058 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:55,058 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:55,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:55,059 INFO L82 PathProgramCache]: Analyzing trace with hash 970929679, now seen corresponding path program 1 times [2019-09-09 05:49:55,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:55,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:55,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:55,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:55,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:55,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:55,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:55,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:55,111 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:55,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:55,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:55,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:55,112 INFO L87 Difference]: Start difference. First operand 200 states and 270 transitions. Second operand 3 states. [2019-09-09 05:49:55,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:55,136 INFO L93 Difference]: Finished difference Result 258 states and 327 transitions. [2019-09-09 05:49:55,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:55,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-09 05:49:55,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:55,139 INFO L225 Difference]: With dead ends: 258 [2019-09-09 05:49:55,139 INFO L226 Difference]: Without dead ends: 258 [2019-09-09 05:49:55,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:55,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-09-09 05:49:55,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-09-09 05:49:55,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-09 05:49:55,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 326 transitions. [2019-09-09 05:49:55,147 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 326 transitions. Word has length 18 [2019-09-09 05:49:55,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:55,148 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 326 transitions. [2019-09-09 05:49:55,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:55,148 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 326 transitions. [2019-09-09 05:49:55,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-09 05:49:55,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:55,151 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:55,152 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:55,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:55,152 INFO L82 PathProgramCache]: Analyzing trace with hash -645793370, now seen corresponding path program 1 times [2019-09-09 05:49:55,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:55,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:55,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:55,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:55,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:55,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:55,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:55,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:55,192 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:55,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:55,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:55,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:55,192 INFO L87 Difference]: Start difference. First operand 256 states and 326 transitions. Second operand 3 states. [2019-09-09 05:49:55,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:55,212 INFO L93 Difference]: Finished difference Result 266 states and 327 transitions. [2019-09-09 05:49:55,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:55,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-09 05:49:55,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:55,214 INFO L225 Difference]: With dead ends: 266 [2019-09-09 05:49:55,214 INFO L226 Difference]: Without dead ends: 266 [2019-09-09 05:49:55,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:55,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-09-09 05:49:55,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2019-09-09 05:49:55,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-09 05:49:55,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 326 transitions. [2019-09-09 05:49:55,222 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 326 transitions. Word has length 19 [2019-09-09 05:49:55,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:55,223 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 326 transitions. [2019-09-09 05:49:55,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:55,223 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 326 transitions. [2019-09-09 05:49:55,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-09 05:49:55,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:55,224 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:55,225 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:55,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:55,225 INFO L82 PathProgramCache]: Analyzing trace with hash 34265000, now seen corresponding path program 1 times [2019-09-09 05:49:55,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:55,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:55,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:55,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:55,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:55,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:55,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:55,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:55,246 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:55,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:55,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:55,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:55,247 INFO L87 Difference]: Start difference. First operand 264 states and 326 transitions. Second operand 3 states. [2019-09-09 05:49:55,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:55,265 INFO L93 Difference]: Finished difference Result 424 states and 502 transitions. [2019-09-09 05:49:55,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:55,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-09 05:49:55,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:55,270 INFO L225 Difference]: With dead ends: 424 [2019-09-09 05:49:55,270 INFO L226 Difference]: Without dead ends: 424 [2019-09-09 05:49:55,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:55,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-09-09 05:49:55,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 392. [2019-09-09 05:49:55,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-09-09 05:49:55,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 470 transitions. [2019-09-09 05:49:55,281 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 470 transitions. Word has length 19 [2019-09-09 05:49:55,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:55,282 INFO L475 AbstractCegarLoop]: Abstraction has 392 states and 470 transitions. [2019-09-09 05:49:55,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:55,282 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 470 transitions. [2019-09-09 05:49:55,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-09 05:49:55,283 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:55,284 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:55,284 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:55,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:55,284 INFO L82 PathProgramCache]: Analyzing trace with hash -775081626, now seen corresponding path program 1 times [2019-09-09 05:49:55,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:55,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:55,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:55,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:55,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:55,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:55,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:55,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:55,325 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:55,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:55,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:55,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:55,326 INFO L87 Difference]: Start difference. First operand 392 states and 470 transitions. Second operand 3 states. [2019-09-09 05:49:55,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:55,343 INFO L93 Difference]: Finished difference Result 486 states and 533 transitions. [2019-09-09 05:49:55,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:55,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-09 05:49:55,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:55,344 INFO L225 Difference]: With dead ends: 486 [2019-09-09 05:49:55,344 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:49:55,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:55,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:49:55,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:49:55,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:49:55,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:49:55,345 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-09-09 05:49:55,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:55,345 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:49:55,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:55,346 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:49:55,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:49:55,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:49:55 BoogieIcfgContainer [2019-09-09 05:49:55,351 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:49:55,354 INFO L168 Benchmark]: Toolchain (without parser) took 2451.18 ms. Allocated memory was 135.8 MB in the beginning and 233.8 MB in the end (delta: 98.0 MB). Free memory was 92.5 MB in the beginning and 174.2 MB in the end (delta: -81.7 MB). Peak memory consumption was 16.4 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:55,355 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 135.8 MB. Free memory was 110.3 MB in the beginning and 110.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 05:49:55,357 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.46 ms. Allocated memory is still 135.8 MB. Free memory was 92.3 MB in the beginning and 82.5 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:55,358 INFO L168 Benchmark]: Boogie Preprocessor took 188.92 ms. Allocated memory was 135.8 MB in the beginning and 204.5 MB in the end (delta: 68.7 MB). Free memory was 82.5 MB in the beginning and 181.2 MB in the end (delta: -98.6 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:55,359 INFO L168 Benchmark]: RCFGBuilder took 392.73 ms. Allocated memory is still 204.5 MB. Free memory was 181.2 MB in the beginning and 166.9 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:55,363 INFO L168 Benchmark]: TraceAbstraction took 1596.42 ms. Allocated memory was 204.5 MB in the beginning and 233.8 MB in the end (delta: 29.4 MB). Free memory was 166.3 MB in the beginning and 174.2 MB in the end (delta: -7.8 MB). Peak memory consumption was 21.5 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:55,367 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 135.8 MB. Free memory was 110.3 MB in the beginning and 110.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 268.46 ms. Allocated memory is still 135.8 MB. Free memory was 92.3 MB in the beginning and 82.5 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 188.92 ms. Allocated memory was 135.8 MB in the beginning and 204.5 MB in the end (delta: 68.7 MB). Free memory was 82.5 MB in the beginning and 181.2 MB in the end (delta: -98.6 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 392.73 ms. Allocated memory is still 204.5 MB. Free memory was 181.2 MB in the beginning and 166.9 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1596.42 ms. Allocated memory was 204.5 MB in the beginning and 233.8 MB in the end (delta: 29.4 MB). Free memory was 166.3 MB in the beginning and 174.2 MB in the end (delta: -7.8 MB). Peak memory consumption was 21.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. SAFE Result, 1.5s OverallTime, 14 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 654 SDtfs, 285 SDslu, 428 SDs, 0 SdLazy, 75 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=392occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 138 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 6424 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...