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-fea9116 [2019-09-20 13:26:51,640 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:26:51,644 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:26:51,662 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:26:51,663 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:26:51,664 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:26:51,667 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:26:51,680 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:26:51,682 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:26:51,683 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:26:51,685 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:26:51,688 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:26:51,688 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:26:51,690 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:26:51,691 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:26:51,692 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:26:51,693 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:26:51,694 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:26:51,695 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:26:51,697 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:26:51,699 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:26:51,700 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:26:51,701 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:26:51,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:26:51,704 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:26:51,704 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:26:51,704 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:26:51,705 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:26:51,705 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:26:51,706 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:26:51,707 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:26:51,707 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:26:51,708 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:26:51,709 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:26:51,710 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:26:51,710 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:26:51,711 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:26:51,711 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:26:51,711 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:26:51,712 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:26:51,713 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:26:51,714 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-20 13:26:51,735 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:26:51,736 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:26:51,736 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:26:51,737 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:26:51,737 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:26:51,738 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:26:51,738 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:26:51,738 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:26:51,738 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:26:51,739 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:26:51,740 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:26:51,741 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:26:51,741 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:26:51,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:26:51,742 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:26:51,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:26:51,742 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:26:51,742 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:26:51,742 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:26:51,743 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:26:51,743 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:26:51,743 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:26:51,744 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:26:51,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:26:51,744 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:26:51,744 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:26:51,745 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:26:51,745 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:26:51,745 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:26:51,745 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:26:51,790 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:26:51,806 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:26:51,809 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:26:51,811 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:26:51,813 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:26:51,814 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-20 13:26:51,892 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de9f31944/e4bcae73cd794310b6021c1ad448a6c4/FLAGf716df3eb [2019-09-20 13:26:52,353 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:26:52,353 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2019-09-20 13:26:52,361 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de9f31944/e4bcae73cd794310b6021c1ad448a6c4/FLAGf716df3eb [2019-09-20 13:26:52,695 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de9f31944/e4bcae73cd794310b6021c1ad448a6c4 [2019-09-20 13:26:52,706 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:26:52,708 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:26:52,709 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:26:52,710 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:26:52,714 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:26:52,715 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:26:52" (1/1) ... [2019-09-20 13:26:52,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e91a4b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:52, skipping insertion in model container [2019-09-20 13:26:52,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:26:52" (1/1) ... [2019-09-20 13:26:52,727 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:26:52,751 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:26:52,908 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:26:52,913 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:26:52,936 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:26:52,952 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:26:52,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:52 WrapperNode [2019-09-20 13:26:52,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:26:52,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:26:52,954 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:26:52,954 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:26:53,060 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:52" (1/1) ... [2019-09-20 13:26:53,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:52" (1/1) ... [2019-09-20 13:26:53,067 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:52" (1/1) ... [2019-09-20 13:26:53,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:52" (1/1) ... [2019-09-20 13:26:53,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:52" (1/1) ... [2019-09-20 13:26:53,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:52" (1/1) ... [2019-09-20 13:26:53,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:52" (1/1) ... [2019-09-20 13:26:53,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:26:53,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:26:53,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:26:53,088 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:26:53,089 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:52" (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-20 13:26:53,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:26:53,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:26:53,158 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:26:53,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:26:53,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:26:53,158 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:26:53,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:26:53,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:26:53,445 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:26:53,446 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:26:53,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:26:53 BoogieIcfgContainer [2019-09-20 13:26:53,448 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:26:53,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:26:53,457 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:26:53,465 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:26:53,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:26:52" (1/3) ... [2019-09-20 13:26:53,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14389a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:26:53, skipping insertion in model container [2019-09-20 13:26:53,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:52" (2/3) ... [2019-09-20 13:26:53,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14389a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:26:53, skipping insertion in model container [2019-09-20 13:26:53,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:26:53" (3/3) ... [2019-09-20 13:26:53,471 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2019-09-20 13:26:53,485 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:26:53,492 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:26:53,504 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:26:53,529 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:26:53,529 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:26:53,530 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:26:53,530 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:26:53,530 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:26:53,530 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:26:53,530 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:26:53,531 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:26:53,544 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-09-20 13:26:53,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-20 13:26:53,554 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:53,554 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:53,557 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:53,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:53,562 INFO L82 PathProgramCache]: Analyzing trace with hash 316328318, now seen corresponding path program 1 times [2019-09-20 13:26:53,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:53,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:53,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:53,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:53,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:53,720 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-20 13:26:53,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:53,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:53,723 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:53,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:53,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:53,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:53,740 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2019-09-20 13:26:53,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:53,797 INFO L93 Difference]: Finished difference Result 50 states and 77 transitions. [2019-09-20 13:26:53,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:53,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-20 13:26:53,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:53,810 INFO L225 Difference]: With dead ends: 50 [2019-09-20 13:26:53,810 INFO L226 Difference]: Without dead ends: 42 [2019-09-20 13:26:53,812 INFO L636 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-20 13:26:53,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-20 13:26:53,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-09-20 13:26:53,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-20 13:26:53,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2019-09-20 13:26:53,846 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 15 [2019-09-20 13:26:53,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:53,847 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2019-09-20 13:26:53,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:53,847 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2019-09-20 13:26:53,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-20 13:26:53,848 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:53,848 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:53,848 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:53,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:53,849 INFO L82 PathProgramCache]: Analyzing trace with hash -493018308, now seen corresponding path program 1 times [2019-09-20 13:26:53,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:53,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:53,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:53,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:53,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:53,898 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-20 13:26:53,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:53,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:53,900 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:53,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:53,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:53,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:53,904 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 3 states. [2019-09-20 13:26:53,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:53,931 INFO L93 Difference]: Finished difference Result 42 states and 66 transitions. [2019-09-20 13:26:53,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:53,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-20 13:26:53,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:53,934 INFO L225 Difference]: With dead ends: 42 [2019-09-20 13:26:53,934 INFO L226 Difference]: Without dead ends: 42 [2019-09-20 13:26:53,935 INFO L636 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-20 13:26:53,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-20 13:26:53,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-09-20 13:26:53,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-20 13:26:53,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 65 transitions. [2019-09-20 13:26:53,943 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 65 transitions. Word has length 15 [2019-09-20 13:26:53,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:53,943 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 65 transitions. [2019-09-20 13:26:53,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:53,943 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 65 transitions. [2019-09-20 13:26:53,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-20 13:26:53,944 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:53,945 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:53,945 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:53,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:53,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1216458266, now seen corresponding path program 1 times [2019-09-20 13:26:53,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:53,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:53,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:53,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:53,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:54,019 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-20 13:26:54,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:54,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:54,020 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:54,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:54,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:54,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:54,024 INFO L87 Difference]: Start difference. First operand 40 states and 65 transitions. Second operand 3 states. [2019-09-20 13:26:54,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:54,049 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2019-09-20 13:26:54,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:54,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-20 13:26:54,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:54,056 INFO L225 Difference]: With dead ends: 45 [2019-09-20 13:26:54,056 INFO L226 Difference]: Without dead ends: 45 [2019-09-20 13:26:54,057 INFO L636 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-20 13:26:54,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-20 13:26:54,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-09-20 13:26:54,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-20 13:26:54,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2019-09-20 13:26:54,067 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 67 transitions. Word has length 16 [2019-09-20 13:26:54,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:54,067 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 67 transitions. [2019-09-20 13:26:54,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:54,068 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2019-09-20 13:26:54,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-20 13:26:54,069 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:54,069 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:54,069 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:54,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:54,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1896516636, now seen corresponding path program 1 times [2019-09-20 13:26:54,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:54,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:54,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:54,102 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-20 13:26:54,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:54,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:54,102 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:54,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:54,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:54,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:54,104 INFO L87 Difference]: Start difference. First operand 43 states and 67 transitions. Second operand 3 states. [2019-09-20 13:26:54,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:54,120 INFO L93 Difference]: Finished difference Result 74 states and 117 transitions. [2019-09-20 13:26:54,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:54,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-20 13:26:54,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:54,122 INFO L225 Difference]: With dead ends: 74 [2019-09-20 13:26:54,122 INFO L226 Difference]: Without dead ends: 74 [2019-09-20 13:26:54,122 INFO L636 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-20 13:26:54,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-20 13:26:54,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2019-09-20 13:26:54,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-20 13:26:54,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 88 transitions. [2019-09-20 13:26:54,130 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 88 transitions. Word has length 16 [2019-09-20 13:26:54,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:54,131 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 88 transitions. [2019-09-20 13:26:54,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:54,131 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 88 transitions. [2019-09-20 13:26:54,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-20 13:26:54,132 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:54,132 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:54,133 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:54,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:54,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1087170010, now seen corresponding path program 1 times [2019-09-20 13:26:54,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:54,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:54,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:54,171 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-20 13:26:54,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:54,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:54,172 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:54,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:54,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:54,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:54,174 INFO L87 Difference]: Start difference. First operand 56 states and 88 transitions. Second operand 3 states. [2019-09-20 13:26:54,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:54,205 INFO L93 Difference]: Finished difference Result 76 states and 115 transitions. [2019-09-20 13:26:54,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:54,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-20 13:26:54,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:54,207 INFO L225 Difference]: With dead ends: 76 [2019-09-20 13:26:54,207 INFO L226 Difference]: Without dead ends: 76 [2019-09-20 13:26:54,210 INFO L636 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-20 13:26:54,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-20 13:26:54,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-09-20 13:26:54,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-20 13:26:54,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 114 transitions. [2019-09-20 13:26:54,218 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 114 transitions. Word has length 16 [2019-09-20 13:26:54,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:54,219 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 114 transitions. [2019-09-20 13:26:54,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:54,219 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 114 transitions. [2019-09-20 13:26:54,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 13:26:54,220 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:54,220 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:54,220 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:54,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:54,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1337311087, now seen corresponding path program 1 times [2019-09-20 13:26:54,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:54,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:54,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:54,283 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-20 13:26:54,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:54,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:54,284 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:54,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:54,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:54,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:54,286 INFO L87 Difference]: Start difference. First operand 74 states and 114 transitions. Second operand 3 states. [2019-09-20 13:26:54,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:54,314 INFO L93 Difference]: Finished difference Result 78 states and 115 transitions. [2019-09-20 13:26:54,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:54,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-20 13:26:54,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:54,316 INFO L225 Difference]: With dead ends: 78 [2019-09-20 13:26:54,316 INFO L226 Difference]: Without dead ends: 78 [2019-09-20 13:26:54,316 INFO L636 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-20 13:26:54,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-20 13:26:54,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-09-20 13:26:54,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-20 13:26:54,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 114 transitions. [2019-09-20 13:26:54,329 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 114 transitions. Word has length 17 [2019-09-20 13:26:54,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:54,330 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 114 transitions. [2019-09-20 13:26:54,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:54,333 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 114 transitions. [2019-09-20 13:26:54,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 13:26:54,334 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:54,334 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:54,335 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:54,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:54,336 INFO L82 PathProgramCache]: Analyzing trace with hash -657252717, now seen corresponding path program 1 times [2019-09-20 13:26:54,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:54,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:54,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:54,367 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-20 13:26:54,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:54,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:54,368 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:54,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:54,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:54,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:54,370 INFO L87 Difference]: Start difference. First operand 76 states and 114 transitions. Second operand 3 states. [2019-09-20 13:26:54,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:54,384 INFO L93 Difference]: Finished difference Result 130 states and 195 transitions. [2019-09-20 13:26:54,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:54,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-20 13:26:54,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:54,386 INFO L225 Difference]: With dead ends: 130 [2019-09-20 13:26:54,387 INFO L226 Difference]: Without dead ends: 130 [2019-09-20 13:26:54,387 INFO L636 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-20 13:26:54,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-20 13:26:54,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 104. [2019-09-20 13:26:54,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-20 13:26:54,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2019-09-20 13:26:54,397 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 17 [2019-09-20 13:26:54,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:54,397 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2019-09-20 13:26:54,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:54,398 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2019-09-20 13:26:54,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 13:26:54,399 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:54,399 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:54,399 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:54,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:54,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1466599343, now seen corresponding path program 1 times [2019-09-20 13:26:54,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:54,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:54,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:54,430 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-20 13:26:54,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:54,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:54,432 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:54,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:54,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:54,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:54,433 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand 3 states. [2019-09-20 13:26:54,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:54,472 INFO L93 Difference]: Finished difference Result 138 states and 195 transitions. [2019-09-20 13:26:54,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:54,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-20 13:26:54,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:54,475 INFO L225 Difference]: With dead ends: 138 [2019-09-20 13:26:54,476 INFO L226 Difference]: Without dead ends: 138 [2019-09-20 13:26:54,476 INFO L636 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-20 13:26:54,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-20 13:26:54,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-09-20 13:26:54,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-20 13:26:54,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 194 transitions. [2019-09-20 13:26:54,498 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 194 transitions. Word has length 17 [2019-09-20 13:26:54,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:54,498 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 194 transitions. [2019-09-20 13:26:54,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:54,499 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 194 transitions. [2019-09-20 13:26:54,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 13:26:54,507 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:54,507 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:54,507 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:54,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:54,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1100217935, now seen corresponding path program 1 times [2019-09-20 13:26:54,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:54,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:54,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:54,552 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-20 13:26:54,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:54,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:54,553 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:54,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:54,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:54,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:54,554 INFO L87 Difference]: Start difference. First operand 136 states and 194 transitions. Second operand 3 states. [2019-09-20 13:26:54,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:54,579 INFO L93 Difference]: Finished difference Result 142 states and 195 transitions. [2019-09-20 13:26:54,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:54,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-20 13:26:54,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:54,583 INFO L225 Difference]: With dead ends: 142 [2019-09-20 13:26:54,583 INFO L226 Difference]: Without dead ends: 142 [2019-09-20 13:26:54,584 INFO L636 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-20 13:26:54,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-20 13:26:54,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2019-09-20 13:26:54,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-20 13:26:54,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2019-09-20 13:26:54,592 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 18 [2019-09-20 13:26:54,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:54,592 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2019-09-20 13:26:54,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:54,593 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2019-09-20 13:26:54,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 13:26:54,594 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:54,594 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:54,595 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:54,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:54,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1780276305, now seen corresponding path program 1 times [2019-09-20 13:26:54,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:54,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:54,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:54,636 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-20 13:26:54,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:54,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:54,637 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:54,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:54,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:54,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:54,638 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand 3 states. [2019-09-20 13:26:54,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:54,652 INFO L93 Difference]: Finished difference Result 234 states and 319 transitions. [2019-09-20 13:26:54,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:54,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-20 13:26:54,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:54,655 INFO L225 Difference]: With dead ends: 234 [2019-09-20 13:26:54,655 INFO L226 Difference]: Without dead ends: 234 [2019-09-20 13:26:54,655 INFO L636 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-20 13:26:54,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-09-20 13:26:54,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 200. [2019-09-20 13:26:54,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-20 13:26:54,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 270 transitions. [2019-09-20 13:26:54,666 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 270 transitions. Word has length 18 [2019-09-20 13:26:54,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:54,666 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 270 transitions. [2019-09-20 13:26:54,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:54,666 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 270 transitions. [2019-09-20 13:26:54,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 13:26:54,668 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:54,668 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:54,669 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:54,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:54,669 INFO L82 PathProgramCache]: Analyzing trace with hash 970929679, now seen corresponding path program 1 times [2019-09-20 13:26:54,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:54,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:54,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:54,695 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-20 13:26:54,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:54,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:54,696 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:54,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:54,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:54,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:54,698 INFO L87 Difference]: Start difference. First operand 200 states and 270 transitions. Second operand 3 states. [2019-09-20 13:26:54,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:54,714 INFO L93 Difference]: Finished difference Result 258 states and 327 transitions. [2019-09-20 13:26:54,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:54,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-20 13:26:54,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:54,716 INFO L225 Difference]: With dead ends: 258 [2019-09-20 13:26:54,716 INFO L226 Difference]: Without dead ends: 258 [2019-09-20 13:26:54,717 INFO L636 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-20 13:26:54,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-09-20 13:26:54,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-09-20 13:26:54,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:26:54,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 326 transitions. [2019-09-20 13:26:54,726 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 326 transitions. Word has length 18 [2019-09-20 13:26:54,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:54,726 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 326 transitions. [2019-09-20 13:26:54,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:54,727 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 326 transitions. [2019-09-20 13:26:54,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:26:54,728 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:54,728 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:54,729 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:54,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:54,729 INFO L82 PathProgramCache]: Analyzing trace with hash -645793370, now seen corresponding path program 1 times [2019-09-20 13:26:54,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:54,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:54,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:54,758 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-20 13:26:54,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:54,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:54,758 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:54,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:54,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:54,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:54,760 INFO L87 Difference]: Start difference. First operand 256 states and 326 transitions. Second operand 3 states. [2019-09-20 13:26:54,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:54,772 INFO L93 Difference]: Finished difference Result 266 states and 327 transitions. [2019-09-20 13:26:54,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:54,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-20 13:26:54,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:54,774 INFO L225 Difference]: With dead ends: 266 [2019-09-20 13:26:54,785 INFO L226 Difference]: Without dead ends: 266 [2019-09-20 13:26:54,785 INFO L636 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-20 13:26:54,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-09-20 13:26:54,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2019-09-20 13:26:54,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-20 13:26:54,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 326 transitions. [2019-09-20 13:26:54,794 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 326 transitions. Word has length 19 [2019-09-20 13:26:54,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:54,795 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 326 transitions. [2019-09-20 13:26:54,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:54,795 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 326 transitions. [2019-09-20 13:26:54,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:26:54,796 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:54,796 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:54,796 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:54,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:54,797 INFO L82 PathProgramCache]: Analyzing trace with hash 34265000, now seen corresponding path program 1 times [2019-09-20 13:26:54,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:54,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:54,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,799 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:54,817 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-20 13:26:54,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:54,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:54,818 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:54,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:54,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:54,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:54,819 INFO L87 Difference]: Start difference. First operand 264 states and 326 transitions. Second operand 3 states. [2019-09-20 13:26:54,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:54,841 INFO L93 Difference]: Finished difference Result 424 states and 502 transitions. [2019-09-20 13:26:54,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:54,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-20 13:26:54,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:54,844 INFO L225 Difference]: With dead ends: 424 [2019-09-20 13:26:54,846 INFO L226 Difference]: Without dead ends: 424 [2019-09-20 13:26:54,846 INFO L636 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-20 13:26:54,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-09-20 13:26:54,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 392. [2019-09-20 13:26:54,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-09-20 13:26:54,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 470 transitions. [2019-09-20 13:26:54,858 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 470 transitions. Word has length 19 [2019-09-20 13:26:54,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:54,858 INFO L475 AbstractCegarLoop]: Abstraction has 392 states and 470 transitions. [2019-09-20 13:26:54,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:54,859 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 470 transitions. [2019-09-20 13:26:54,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:26:54,860 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:54,860 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:54,860 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:54,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:54,861 INFO L82 PathProgramCache]: Analyzing trace with hash -775081626, now seen corresponding path program 1 times [2019-09-20 13:26:54,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:54,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:54,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:54,897 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-20 13:26:54,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:54,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:54,898 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:54,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:54,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:54,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:54,899 INFO L87 Difference]: Start difference. First operand 392 states and 470 transitions. Second operand 3 states. [2019-09-20 13:26:54,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:54,919 INFO L93 Difference]: Finished difference Result 486 states and 533 transitions. [2019-09-20 13:26:54,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:54,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-20 13:26:54,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:54,920 INFO L225 Difference]: With dead ends: 486 [2019-09-20 13:26:54,920 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:26:54,922 INFO L636 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-20 13:26:54,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:26:54,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:26:54,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:26:54,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:26:54,925 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-09-20 13:26:54,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:54,925 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:26:54,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:54,925 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:26:54,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:26:54,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:26:54 BoogieIcfgContainer [2019-09-20 13:26:54,933 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:26:54,936 INFO L168 Benchmark]: Toolchain (without parser) took 2227.03 ms. Allocated memory was 128.5 MB in the beginning and 211.8 MB in the end (delta: 83.4 MB). Free memory was 84.6 MB in the beginning and 164.1 MB in the end (delta: -79.5 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:54,939 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 128.5 MB. Free memory was 102.6 MB in the beginning and 102.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 13:26:54,941 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.80 ms. Allocated memory is still 128.5 MB. Free memory was 84.4 MB in the beginning and 74.5 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:54,948 INFO L168 Benchmark]: Boogie Preprocessor took 134.05 ms. Allocated memory was 128.5 MB in the beginning and 196.6 MB in the end (delta: 68.2 MB). Free memory was 74.5 MB in the beginning and 172.8 MB in the end (delta: -98.3 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:54,949 INFO L168 Benchmark]: RCFGBuilder took 360.10 ms. Allocated memory is still 196.6 MB. Free memory was 172.8 MB in the beginning and 157.6 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:54,950 INFO L168 Benchmark]: TraceAbstraction took 1476.74 ms. Allocated memory was 196.6 MB in the beginning and 211.8 MB in the end (delta: 15.2 MB). Free memory was 157.6 MB in the beginning and 164.1 MB in the end (delta: -6.5 MB). Peak memory consumption was 8.7 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:54,961 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.23 ms. Allocated memory is still 128.5 MB. Free memory was 102.6 MB in the beginning and 102.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 243.80 ms. Allocated memory is still 128.5 MB. Free memory was 84.4 MB in the beginning and 74.5 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 134.05 ms. Allocated memory was 128.5 MB in the beginning and 196.6 MB in the end (delta: 68.2 MB). Free memory was 74.5 MB in the beginning and 172.8 MB in the end (delta: -98.3 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 360.10 ms. Allocated memory is still 196.6 MB. Free memory was 172.8 MB in the beginning and 157.6 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1476.74 ms. Allocated memory was 196.6 MB in the beginning and 211.8 MB in the end (delta: 15.2 MB). Free memory was 157.6 MB in the beginning and 164.1 MB in the end (delta: -6.5 MB). Peak memory consumption was 8.7 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.4s 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.1s 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...