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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:07:59,790 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:07:59,793 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:07:59,805 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:07:59,805 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:07:59,806 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:07:59,808 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:07:59,809 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:07:59,811 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:07:59,812 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:07:59,813 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:07:59,814 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:07:59,814 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:07:59,815 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:07:59,816 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:07:59,817 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:07:59,818 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:07:59,819 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:07:59,821 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:07:59,823 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:07:59,824 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:07:59,825 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:07:59,826 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:07:59,827 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:07:59,829 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:07:59,830 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:07:59,830 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:07:59,834 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:07:59,835 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:07:59,835 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:07:59,836 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:07:59,838 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:07:59,839 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:07:59,840 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:07:59,841 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:07:59,841 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:07:59,842 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:07:59,842 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:07:59,845 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:07:59,846 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:07:59,846 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:07:59,850 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 11:07:59,875 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:07:59,876 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:07:59,878 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:07:59,878 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:07:59,878 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:07:59,879 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:07:59,879 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:07:59,879 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:07:59,879 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:07:59,879 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:07:59,881 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:07:59,881 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:07:59,881 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:07:59,881 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:07:59,882 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:07:59,882 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:07:59,882 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:07:59,883 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:07:59,883 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:07:59,883 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:07:59,884 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:07:59,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:07:59,884 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:07:59,884 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:07:59,885 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:07:59,885 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:07:59,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:07:59,885 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:07:59,886 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:07:59,916 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:07:59,933 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:07:59,938 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:07:59,939 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:07:59,939 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:07:59,940 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-10-02 11:08:00,015 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a559dc205/daefba30a6f746b8956096880e6149dd/FLAG074d3e79b [2019-10-02 11:08:00,435 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:08:00,436 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2019-10-02 11:08:00,443 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a559dc205/daefba30a6f746b8956096880e6149dd/FLAG074d3e79b [2019-10-02 11:08:00,779 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a559dc205/daefba30a6f746b8956096880e6149dd [2019-10-02 11:08:00,794 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:08:00,796 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:08:00,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:08:00,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:08:00,800 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:08:00,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:08:00" (1/1) ... [2019-10-02 11:08:00,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ac258e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:00, skipping insertion in model container [2019-10-02 11:08:00,805 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:08:00" (1/1) ... [2019-10-02 11:08:00,812 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:08:00,827 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:08:00,975 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:08:00,979 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:08:01,000 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:08:01,013 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:08:01,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:01 WrapperNode [2019-10-02 11:08:01,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:08:01,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:08:01,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:08:01,016 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:08:01,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:01" (1/1) ... [2019-10-02 11:08:01,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:01" (1/1) ... [2019-10-02 11:08:01,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:01" (1/1) ... [2019-10-02 11:08:01,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:01" (1/1) ... [2019-10-02 11:08:01,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:01" (1/1) ... [2019-10-02 11:08:01,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:01" (1/1) ... [2019-10-02 11:08:01,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:01" (1/1) ... [2019-10-02 11:08:01,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:08:01,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:08:01,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:08:01,134 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:08:01,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:01" (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-10-02 11:08:01,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:08:01,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:08:01,195 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:08:01,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:08:01,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:08:01,196 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:08:01,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:08:01,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:08:01,469 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:08:01,470 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 11:08:01,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:08:01 BoogieIcfgContainer [2019-10-02 11:08:01,473 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:08:01,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:08:01,480 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:08:01,483 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:08:01,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:08:00" (1/3) ... [2019-10-02 11:08:01,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f1b1647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:08:01, skipping insertion in model container [2019-10-02 11:08:01,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:01" (2/3) ... [2019-10-02 11:08:01,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f1b1647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:08:01, skipping insertion in model container [2019-10-02 11:08:01,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:08:01" (3/3) ... [2019-10-02 11:08:01,496 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2019-10-02 11:08:01,503 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:08:01,510 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:08:01,526 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:08:01,556 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:08:01,556 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:08:01,557 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:08:01,557 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:08:01,557 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:08:01,557 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:08:01,557 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:08:01,558 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:08:01,558 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:08:01,574 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-10-02 11:08:01,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-02 11:08:01,579 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:01,580 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:01,583 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:01,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:01,588 INFO L82 PathProgramCache]: Analyzing trace with hash 316328318, now seen corresponding path program 1 times [2019-10-02 11:08:01,590 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:01,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:01,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:01,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:01,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:01,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:01,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:01,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:01,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:01,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:01,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:01,765 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2019-10-02 11:08:01,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:01,857 INFO L93 Difference]: Finished difference Result 57 states and 90 transitions. [2019-10-02 11:08:01,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:01,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-02 11:08:01,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:01,882 INFO L225 Difference]: With dead ends: 57 [2019-10-02 11:08:01,883 INFO L226 Difference]: Without dead ends: 42 [2019-10-02 11:08:01,890 INFO L640 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-10-02 11:08:01,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-02 11:08:01,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-10-02 11:08:01,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-02 11:08:01,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2019-10-02 11:08:01,955 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 15 [2019-10-02 11:08:01,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:01,956 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2019-10-02 11:08:01,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:01,957 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2019-10-02 11:08:01,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-02 11:08:01,959 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:01,959 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:01,960 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:01,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:01,962 INFO L82 PathProgramCache]: Analyzing trace with hash -493018308, now seen corresponding path program 1 times [2019-10-02 11:08:01,962 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:01,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:01,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:01,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:01,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:02,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:02,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:02,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:02,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:02,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:02,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:02,079 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 3 states. [2019-10-02 11:08:02,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:02,112 INFO L93 Difference]: Finished difference Result 67 states and 112 transitions. [2019-10-02 11:08:02,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:02,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-02 11:08:02,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:02,114 INFO L225 Difference]: With dead ends: 67 [2019-10-02 11:08:02,114 INFO L226 Difference]: Without dead ends: 42 [2019-10-02 11:08:02,116 INFO L640 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-10-02 11:08:02,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-02 11:08:02,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-10-02 11:08:02,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-02 11:08:02,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 65 transitions. [2019-10-02 11:08:02,124 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 65 transitions. Word has length 15 [2019-10-02 11:08:02,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:02,125 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 65 transitions. [2019-10-02 11:08:02,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:02,125 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 65 transitions. [2019-10-02 11:08:02,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-02 11:08:02,126 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:02,126 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:02,126 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:02,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:02,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1216458266, now seen corresponding path program 1 times [2019-10-02 11:08:02,127 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:02,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:02,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:02,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:02,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:02,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:02,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:02,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:02,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:02,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:02,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:02,170 INFO L87 Difference]: Start difference. First operand 40 states and 65 transitions. Second operand 3 states. [2019-10-02 11:08:02,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:02,200 INFO L93 Difference]: Finished difference Result 63 states and 99 transitions. [2019-10-02 11:08:02,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:02,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-02 11:08:02,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:02,202 INFO L225 Difference]: With dead ends: 63 [2019-10-02 11:08:02,202 INFO L226 Difference]: Without dead ends: 45 [2019-10-02 11:08:02,203 INFO L640 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-10-02 11:08:02,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-02 11:08:02,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-10-02 11:08:02,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-02 11:08:02,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2019-10-02 11:08:02,212 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 67 transitions. Word has length 16 [2019-10-02 11:08:02,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:02,213 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 67 transitions. [2019-10-02 11:08:02,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:02,214 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2019-10-02 11:08:02,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-02 11:08:02,215 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:02,216 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:02,216 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:02,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:02,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1896516636, now seen corresponding path program 1 times [2019-10-02 11:08:02,218 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:02,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:02,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:02,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:02,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:02,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:02,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:02,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:02,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:02,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:02,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:02,282 INFO L87 Difference]: Start difference. First operand 43 states and 67 transitions. Second operand 3 states. [2019-10-02 11:08:02,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:02,300 INFO L93 Difference]: Finished difference Result 76 states and 120 transitions. [2019-10-02 11:08:02,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:02,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-02 11:08:02,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:02,303 INFO L225 Difference]: With dead ends: 76 [2019-10-02 11:08:02,303 INFO L226 Difference]: Without dead ends: 74 [2019-10-02 11:08:02,303 INFO L640 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-10-02 11:08:02,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-02 11:08:02,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2019-10-02 11:08:02,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-02 11:08:02,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 88 transitions. [2019-10-02 11:08:02,314 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 88 transitions. Word has length 16 [2019-10-02 11:08:02,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:02,315 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 88 transitions. [2019-10-02 11:08:02,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:02,316 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 88 transitions. [2019-10-02 11:08:02,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-02 11:08:02,317 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:02,317 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:02,317 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:02,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:02,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1087170010, now seen corresponding path program 1 times [2019-10-02 11:08:02,319 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:02,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:02,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:02,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:02,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:02,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:02,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:02,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:02,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:02,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:02,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:02,372 INFO L87 Difference]: Start difference. First operand 56 states and 88 transitions. Second operand 3 states. [2019-10-02 11:08:02,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:02,396 INFO L93 Difference]: Finished difference Result 124 states and 198 transitions. [2019-10-02 11:08:02,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:02,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-02 11:08:02,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:02,400 INFO L225 Difference]: With dead ends: 124 [2019-10-02 11:08:02,400 INFO L226 Difference]: Without dead ends: 76 [2019-10-02 11:08:02,401 INFO L640 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-10-02 11:08:02,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-02 11:08:02,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-10-02 11:08:02,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-02 11:08:02,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 114 transitions. [2019-10-02 11:08:02,411 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 114 transitions. Word has length 16 [2019-10-02 11:08:02,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:02,412 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 114 transitions. [2019-10-02 11:08:02,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:02,412 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 114 transitions. [2019-10-02 11:08:02,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-02 11:08:02,413 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:02,413 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:02,414 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:02,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:02,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1337311087, now seen corresponding path program 1 times [2019-10-02 11:08:02,414 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:02,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:02,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:02,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:02,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:02,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:02,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:02,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:02,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:02,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:02,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:02,463 INFO L87 Difference]: Start difference. First operand 74 states and 114 transitions. Second operand 3 states. [2019-10-02 11:08:02,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:02,484 INFO L93 Difference]: Finished difference Result 111 states and 169 transitions. [2019-10-02 11:08:02,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:02,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-02 11:08:02,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:02,486 INFO L225 Difference]: With dead ends: 111 [2019-10-02 11:08:02,486 INFO L226 Difference]: Without dead ends: 78 [2019-10-02 11:08:02,487 INFO L640 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-10-02 11:08:02,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-02 11:08:02,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-10-02 11:08:02,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-02 11:08:02,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 114 transitions. [2019-10-02 11:08:02,498 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 114 transitions. Word has length 17 [2019-10-02 11:08:02,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:02,498 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 114 transitions. [2019-10-02 11:08:02,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:02,499 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 114 transitions. [2019-10-02 11:08:02,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-02 11:08:02,500 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:02,500 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:02,500 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:02,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:02,501 INFO L82 PathProgramCache]: Analyzing trace with hash -657252717, now seen corresponding path program 1 times [2019-10-02 11:08:02,501 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:02,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:02,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:02,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:02,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:02,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:02,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:02,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:02,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:02,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:02,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:02,533 INFO L87 Difference]: Start difference. First operand 76 states and 114 transitions. Second operand 3 states. [2019-10-02 11:08:02,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:02,566 INFO L93 Difference]: Finished difference Result 132 states and 200 transitions. [2019-10-02 11:08:02,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:02,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-02 11:08:02,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:02,569 INFO L225 Difference]: With dead ends: 132 [2019-10-02 11:08:02,569 INFO L226 Difference]: Without dead ends: 130 [2019-10-02 11:08:02,569 INFO L640 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-10-02 11:08:02,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-02 11:08:02,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 104. [2019-10-02 11:08:02,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-02 11:08:02,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2019-10-02 11:08:02,581 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 17 [2019-10-02 11:08:02,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:02,582 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2019-10-02 11:08:02,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:02,582 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2019-10-02 11:08:02,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-02 11:08:02,584 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:02,584 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:02,584 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:02,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:02,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1466599343, now seen corresponding path program 1 times [2019-10-02 11:08:02,585 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:02,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:02,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:02,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:02,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:02,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:02,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:02,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:02,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:02,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:02,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:02,627 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand 3 states. [2019-10-02 11:08:02,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:02,659 INFO L93 Difference]: Finished difference Result 232 states and 344 transitions. [2019-10-02 11:08:02,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:02,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-02 11:08:02,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:02,662 INFO L225 Difference]: With dead ends: 232 [2019-10-02 11:08:02,662 INFO L226 Difference]: Without dead ends: 138 [2019-10-02 11:08:02,663 INFO L640 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-10-02 11:08:02,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-10-02 11:08:02,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-10-02 11:08:02,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-02 11:08:02,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 194 transitions. [2019-10-02 11:08:02,678 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 194 transitions. Word has length 17 [2019-10-02 11:08:02,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:02,678 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 194 transitions. [2019-10-02 11:08:02,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:02,679 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 194 transitions. [2019-10-02 11:08:02,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-02 11:08:02,680 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:02,680 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:02,681 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:02,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:02,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1100217935, now seen corresponding path program 1 times [2019-10-02 11:08:02,681 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:02,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:02,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:02,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:02,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:02,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:02,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:02,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:02,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:02,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:02,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:02,707 INFO L87 Difference]: Start difference. First operand 136 states and 194 transitions. Second operand 3 states. [2019-10-02 11:08:02,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:02,726 INFO L93 Difference]: Finished difference Result 204 states and 288 transitions. [2019-10-02 11:08:02,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:02,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-02 11:08:02,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:02,729 INFO L225 Difference]: With dead ends: 204 [2019-10-02 11:08:02,729 INFO L226 Difference]: Without dead ends: 142 [2019-10-02 11:08:02,730 INFO L640 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-10-02 11:08:02,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-10-02 11:08:02,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2019-10-02 11:08:02,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-02 11:08:02,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2019-10-02 11:08:02,742 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 18 [2019-10-02 11:08:02,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:02,743 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2019-10-02 11:08:02,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:02,743 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2019-10-02 11:08:02,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-02 11:08:02,748 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:02,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:02,748 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:02,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:02,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1780276305, now seen corresponding path program 1 times [2019-10-02 11:08:02,749 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:02,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:02,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:02,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:02,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:02,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:02,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:02,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:02,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:02,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:02,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:02,798 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand 3 states. [2019-10-02 11:08:02,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:02,835 INFO L93 Difference]: Finished difference Result 236 states and 328 transitions. [2019-10-02 11:08:02,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:02,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-02 11:08:02,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:02,838 INFO L225 Difference]: With dead ends: 236 [2019-10-02 11:08:02,838 INFO L226 Difference]: Without dead ends: 234 [2019-10-02 11:08:02,839 INFO L640 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-10-02 11:08:02,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-10-02 11:08:02,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 200. [2019-10-02 11:08:02,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-10-02 11:08:02,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 270 transitions. [2019-10-02 11:08:02,861 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 270 transitions. Word has length 18 [2019-10-02 11:08:02,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:02,861 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 270 transitions. [2019-10-02 11:08:02,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:02,873 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 270 transitions. [2019-10-02 11:08:02,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-02 11:08:02,877 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:02,878 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:02,878 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:02,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:02,879 INFO L82 PathProgramCache]: Analyzing trace with hash 970929679, now seen corresponding path program 1 times [2019-10-02 11:08:02,879 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:02,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:02,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:02,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:02,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:02,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:02,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:02,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:02,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:02,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:02,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:02,925 INFO L87 Difference]: Start difference. First operand 200 states and 270 transitions. Second operand 3 states. [2019-10-02 11:08:02,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:02,972 INFO L93 Difference]: Finished difference Result 444 states and 592 transitions. [2019-10-02 11:08:02,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:02,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-02 11:08:02,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:02,975 INFO L225 Difference]: With dead ends: 444 [2019-10-02 11:08:02,975 INFO L226 Difference]: Without dead ends: 258 [2019-10-02 11:08:02,976 INFO L640 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-10-02 11:08:02,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-10-02 11:08:02,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-10-02 11:08:02,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-10-02 11:08:02,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 326 transitions. [2019-10-02 11:08:02,997 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 326 transitions. Word has length 18 [2019-10-02 11:08:02,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:02,998 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 326 transitions. [2019-10-02 11:08:02,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:02,998 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 326 transitions. [2019-10-02 11:08:03,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-02 11:08:03,001 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:03,003 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:03,003 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:03,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:03,004 INFO L82 PathProgramCache]: Analyzing trace with hash -645793370, now seen corresponding path program 1 times [2019-10-02 11:08:03,004 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:03,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:03,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:03,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:03,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:03,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:03,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:03,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:03,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:03,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:03,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:03,029 INFO L87 Difference]: Start difference. First operand 256 states and 326 transitions. Second operand 3 states. [2019-10-02 11:08:03,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:03,051 INFO L93 Difference]: Finished difference Result 384 states and 484 transitions. [2019-10-02 11:08:03,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:03,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-02 11:08:03,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:03,054 INFO L225 Difference]: With dead ends: 384 [2019-10-02 11:08:03,054 INFO L226 Difference]: Without dead ends: 266 [2019-10-02 11:08:03,055 INFO L640 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-10-02 11:08:03,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-10-02 11:08:03,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2019-10-02 11:08:03,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-10-02 11:08:03,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 326 transitions. [2019-10-02 11:08:03,072 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 326 transitions. Word has length 19 [2019-10-02 11:08:03,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:03,072 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 326 transitions. [2019-10-02 11:08:03,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:03,072 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 326 transitions. [2019-10-02 11:08:03,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-02 11:08:03,073 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:03,073 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:03,074 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:03,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:03,074 INFO L82 PathProgramCache]: Analyzing trace with hash 34265000, now seen corresponding path program 1 times [2019-10-02 11:08:03,074 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:03,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:03,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:03,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:03,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:03,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:03,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:03,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:03,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:03,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:03,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:03,117 INFO L87 Difference]: Start difference. First operand 264 states and 326 transitions. Second operand 3 states. [2019-10-02 11:08:03,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:03,146 INFO L93 Difference]: Finished difference Result 426 states and 519 transitions. [2019-10-02 11:08:03,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:03,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-02 11:08:03,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:03,150 INFO L225 Difference]: With dead ends: 426 [2019-10-02 11:08:03,150 INFO L226 Difference]: Without dead ends: 424 [2019-10-02 11:08:03,151 INFO L640 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-10-02 11:08:03,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-10-02 11:08:03,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 392. [2019-10-02 11:08:03,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-10-02 11:08:03,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 470 transitions. [2019-10-02 11:08:03,165 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 470 transitions. Word has length 19 [2019-10-02 11:08:03,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:03,165 INFO L475 AbstractCegarLoop]: Abstraction has 392 states and 470 transitions. [2019-10-02 11:08:03,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:03,165 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 470 transitions. [2019-10-02 11:08:03,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-02 11:08:03,167 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:03,167 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:03,167 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:03,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:03,167 INFO L82 PathProgramCache]: Analyzing trace with hash -775081626, now seen corresponding path program 1 times [2019-10-02 11:08:03,168 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:03,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:03,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:03,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:03,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:03,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:03,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:03,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:03,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:03,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:03,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:03,197 INFO L87 Difference]: Start difference. First operand 392 states and 470 transitions. Second operand 3 states. [2019-10-02 11:08:03,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:03,225 INFO L93 Difference]: Finished difference Result 856 states and 998 transitions. [2019-10-02 11:08:03,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:03,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-02 11:08:03,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:03,227 INFO L225 Difference]: With dead ends: 856 [2019-10-02 11:08:03,227 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 11:08:03,229 INFO L640 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-10-02 11:08:03,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 11:08:03,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 11:08:03,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 11:08:03,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 11:08:03,230 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-10-02 11:08:03,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:03,230 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 11:08:03,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:03,230 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 11:08:03,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 11:08:03,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 11:08:03,255 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-02 11:08:03,256 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:08:03,256 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:08:03,256 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-02 11:08:03,256 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:08:03,256 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:08:03,256 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-10-02 11:08:03,257 INFO L446 ceAbstractionStarter]: At program point L89(lines 5 93) the Hoare annotation is: true [2019-10-02 11:08:03,257 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 93) no Hoare annotation was computed. [2019-10-02 11:08:03,257 INFO L443 ceAbstractionStarter]: For program point L73-1(lines 24 88) no Hoare annotation was computed. [2019-10-02 11:08:03,257 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-10-02 11:08:03,257 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 24 88) no Hoare annotation was computed. [2019-10-02 11:08:03,257 INFO L443 ceAbstractionStarter]: For program point L53-1(lines 24 88) no Hoare annotation was computed. [2019-10-02 11:08:03,257 INFO L443 ceAbstractionStarter]: For program point L49-1(lines 24 88) no Hoare annotation was computed. [2019-10-02 11:08:03,258 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 24 88) no Hoare annotation was computed. [2019-10-02 11:08:03,258 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 24 88) no Hoare annotation was computed. [2019-10-02 11:08:03,258 INFO L443 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2019-10-02 11:08:03,258 INFO L443 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-10-02 11:08:03,258 INFO L443 ceAbstractionStarter]: For program point L41-2(lines 24 88) no Hoare annotation was computed. [2019-10-02 11:08:03,258 INFO L446 ceAbstractionStarter]: At program point L83-1(lines 24 88) the Hoare annotation is: true [2019-10-02 11:08:03,258 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-10-02 11:08:03,258 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 93) no Hoare annotation was computed. [2019-10-02 11:08:03,259 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 24 88) no Hoare annotation was computed. [2019-10-02 11:08:03,259 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 93) the Hoare annotation is: true [2019-10-02 11:08:03,259 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2019-10-02 11:08:03,259 INFO L443 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-10-02 11:08:03,259 INFO L439 ceAbstractionStarter]: At program point L84-1(lines 5 93) the Hoare annotation is: false [2019-10-02 11:08:03,259 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2019-10-02 11:08:03,259 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 24 88) no Hoare annotation was computed. [2019-10-02 11:08:03,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:08:03 BoogieIcfgContainer [2019-10-02 11:08:03,267 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 11:08:03,269 INFO L168 Benchmark]: Toolchain (without parser) took 2472.75 ms. Allocated memory was 140.5 MB in the beginning and 227.0 MB in the end (delta: 86.5 MB). Free memory was 87.0 MB in the beginning and 154.0 MB in the end (delta: -67.0 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. [2019-10-02 11:08:03,270 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 140.5 MB. Free memory was 105.2 MB in the beginning and 105.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 11:08:03,271 INFO L168 Benchmark]: CACSL2BoogieTranslator took 218.12 ms. Allocated memory is still 140.5 MB. Free memory was 86.8 MB in the beginning and 76.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-10-02 11:08:03,272 INFO L168 Benchmark]: Boogie Preprocessor took 118.02 ms. Allocated memory was 140.5 MB in the beginning and 200.8 MB in the end (delta: 60.3 MB). Free memory was 76.9 MB in the beginning and 178.3 MB in the end (delta: -101.4 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. [2019-10-02 11:08:03,273 INFO L168 Benchmark]: RCFGBuilder took 339.17 ms. Allocated memory is still 200.8 MB. Free memory was 178.3 MB in the beginning and 163.7 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. [2019-10-02 11:08:03,274 INFO L168 Benchmark]: TraceAbstraction took 1792.97 ms. Allocated memory was 200.8 MB in the beginning and 227.0 MB in the end (delta: 26.2 MB). Free memory was 163.7 MB in the beginning and 154.0 MB in the end (delta: 9.7 MB). Peak memory consumption was 35.9 MB. Max. memory is 7.1 GB. [2019-10-02 11:08:03,278 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.47 ms. Allocated memory is still 140.5 MB. Free memory was 105.2 MB in the beginning and 105.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 218.12 ms. Allocated memory is still 140.5 MB. Free memory was 86.8 MB in the beginning and 76.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 118.02 ms. Allocated memory was 140.5 MB in the beginning and 200.8 MB in the end (delta: 60.3 MB). Free memory was 76.9 MB in the beginning and 178.3 MB in the end (delta: -101.4 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 339.17 ms. Allocated memory is still 200.8 MB. Free memory was 178.3 MB in the beginning and 163.7 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1792.97 ms. Allocated memory was 200.8 MB in the beginning and 227.0 MB in the end (delta: 26.2 MB). Free memory was 163.7 MB in the beginning and 154.0 MB in the end (delta: 9.7 MB). Peak memory consumption was 35.9 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 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. SAFE Result, 1.7s OverallTime, 14 OverallIterations, 1 TraceHistogramMax, 0.5s 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.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 138 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 42 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s 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...