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_6.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:08:05,805 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:08:05,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:08:05,819 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:08:05,820 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:08:05,821 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:08:05,822 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:08:05,824 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:08:05,826 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:08:05,827 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:08:05,828 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:08:05,829 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:08:05,829 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:08:05,830 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:08:05,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:08:05,832 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:08:05,833 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:08:05,834 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:08:05,836 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:08:05,838 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:08:05,839 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:08:05,840 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:08:05,841 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:08:05,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:08:05,844 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:08:05,844 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:08:05,844 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:08:05,845 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:08:05,846 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:08:05,847 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:08:05,847 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:08:05,848 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:08:05,849 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:08:05,849 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:08:05,851 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:08:05,851 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:08:05,852 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:08:05,852 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:08:05,852 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:08:05,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:08:05,854 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:08:05,854 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:08:05,872 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:08:05,873 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:08:05,875 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:08:05,876 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:08:05,876 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:08:05,876 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:08:05,877 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:08:05,877 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:08:05,877 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:08:05,877 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:08:05,878 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:08:05,878 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:08:05,879 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:08:05,879 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:08:05,879 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:08:05,880 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:08:05,880 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:08:05,880 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:08:05,880 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:08:05,880 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:08:05,881 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:08:05,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:08:05,882 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:08:05,882 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:08:05,882 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:08:05,883 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:08:05,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:08:05,883 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:08:05,883 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:08:05,941 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:08:05,956 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:08:05,960 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:08:05,961 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:08:05,962 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:08:05,962 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2019-10-02 11:08:06,036 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dab1ebe12/e4685d9416bc4e8685bbdaffb410826a/FLAGc8b058265 [2019-10-02 11:08:06,530 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:08:06,531 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2019-10-02 11:08:06,539 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dab1ebe12/e4685d9416bc4e8685bbdaffb410826a/FLAGc8b058265 [2019-10-02 11:08:07,020 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dab1ebe12/e4685d9416bc4e8685bbdaffb410826a [2019-10-02 11:08:07,030 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:08:07,032 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:08:07,033 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:08:07,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:08:07,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:08:07,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:08:07" (1/1) ... [2019-10-02 11:08:07,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25fb5aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:07, skipping insertion in model container [2019-10-02 11:08:07,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:08:07" (1/1) ... [2019-10-02 11:08:07,049 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:08:07,070 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:08:07,242 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:08:07,246 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:08:07,271 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:08:07,377 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:08:07,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:07 WrapperNode [2019-10-02 11:08:07,378 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:08:07,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:08:07,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:08:07,379 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:08:07,388 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:07" (1/1) ... [2019-10-02 11:08:07,389 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:07" (1/1) ... [2019-10-02 11:08:07,393 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:07" (1/1) ... [2019-10-02 11:08:07,394 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:07" (1/1) ... [2019-10-02 11:08:07,398 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:07" (1/1) ... [2019-10-02 11:08:07,404 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:07" (1/1) ... [2019-10-02 11:08:07,406 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:07" (1/1) ... [2019-10-02 11:08:07,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:08:07,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:08:07,409 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:08:07,409 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:08:07,410 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:07" (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:07,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:08:07,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:08:07,477 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:08:07,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:08:07,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:08:07,478 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:08:07,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:08:07,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:08:07,776 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:08:07,776 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 11:08:07,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:08:07 BoogieIcfgContainer [2019-10-02 11:08:07,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:08:07,779 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:08:07,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:08:07,789 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:08:07,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:08:07" (1/3) ... [2019-10-02 11:08:07,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1900a04b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:08:07, skipping insertion in model container [2019-10-02 11:08:07,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:07" (2/3) ... [2019-10-02 11:08:07,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1900a04b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:08:07, skipping insertion in model container [2019-10-02 11:08:07,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:08:07" (3/3) ... [2019-10-02 11:08:07,793 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2019-10-02 11:08:07,804 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:08:07,811 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:08:07,827 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:08:07,864 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:08:07,865 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:08:07,865 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:08:07,866 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:08:07,866 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:08:07,866 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:08:07,866 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:08:07,866 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:08:07,867 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:08:07,885 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-10-02 11:08:07,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-02 11:08:07,890 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:07,891 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:07,893 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:07,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:07,898 INFO L82 PathProgramCache]: Analyzing trace with hash 429652513, now seen corresponding path program 1 times [2019-10-02 11:08:07,899 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:07,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:07,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:07,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:07,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:08,060 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:08,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:08,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:08,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:08,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:08,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:08,079 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2019-10-02 11:08:08,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:08,138 INFO L93 Difference]: Finished difference Result 63 states and 102 transitions. [2019-10-02 11:08:08,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:08,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-02 11:08:08,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:08,150 INFO L225 Difference]: With dead ends: 63 [2019-10-02 11:08:08,151 INFO L226 Difference]: Without dead ends: 48 [2019-10-02 11:08:08,154 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:08,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-02 11:08:08,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-10-02 11:08:08,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-02 11:08:08,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2019-10-02 11:08:08,194 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 16 [2019-10-02 11:08:08,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:08,195 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2019-10-02 11:08:08,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:08,195 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2019-10-02 11:08:08,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-02 11:08:08,196 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:08,196 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:08,196 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:08,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:08,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1109710883, now seen corresponding path program 1 times [2019-10-02 11:08:08,197 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:08,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:08,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:08,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:08,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:08,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:08,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:08,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:08,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:08,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:08,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:08,249 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2019-10-02 11:08:08,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:08,289 INFO L93 Difference]: Finished difference Result 77 states and 132 transitions. [2019-10-02 11:08:08,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:08,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-02 11:08:08,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:08,293 INFO L225 Difference]: With dead ends: 77 [2019-10-02 11:08:08,293 INFO L226 Difference]: Without dead ends: 48 [2019-10-02 11:08:08,294 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:08,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-02 11:08:08,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-10-02 11:08:08,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-02 11:08:08,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 77 transitions. [2019-10-02 11:08:08,303 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 77 transitions. Word has length 16 [2019-10-02 11:08:08,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:08,303 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 77 transitions. [2019-10-02 11:08:08,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:08,304 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 77 transitions. [2019-10-02 11:08:08,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-02 11:08:08,305 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:08,305 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:08,305 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:08,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:08,306 INFO L82 PathProgramCache]: Analyzing trace with hash 434540691, now seen corresponding path program 1 times [2019-10-02 11:08:08,306 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:08,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:08,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:08,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:08,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:08,366 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:08,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:08,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:08,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:08,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:08,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:08,368 INFO L87 Difference]: Start difference. First operand 46 states and 77 transitions. Second operand 3 states. [2019-10-02 11:08:08,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:08,396 INFO L93 Difference]: Finished difference Result 72 states and 117 transitions. [2019-10-02 11:08:08,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:08,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-02 11:08:08,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:08,404 INFO L225 Difference]: With dead ends: 72 [2019-10-02 11:08:08,404 INFO L226 Difference]: Without dead ends: 51 [2019-10-02 11:08:08,405 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:08,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-02 11:08:08,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-10-02 11:08:08,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-02 11:08:08,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2019-10-02 11:08:08,417 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 79 transitions. Word has length 17 [2019-10-02 11:08:08,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:08,417 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 79 transitions. [2019-10-02 11:08:08,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:08,418 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2019-10-02 11:08:08,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-02 11:08:08,419 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:08,419 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:08,419 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:08,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:08,420 INFO L82 PathProgramCache]: Analyzing trace with hash 41513681, now seen corresponding path program 1 times [2019-10-02 11:08:08,420 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:08,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:08,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:08,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:08,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:08,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:08,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:08,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:08,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:08,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:08,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:08,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:08,478 INFO L87 Difference]: Start difference. First operand 49 states and 79 transitions. Second operand 3 states. [2019-10-02 11:08:08,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:08,507 INFO L93 Difference]: Finished difference Result 88 states and 144 transitions. [2019-10-02 11:08:08,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:08,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-02 11:08:08,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:08,509 INFO L225 Difference]: With dead ends: 88 [2019-10-02 11:08:08,510 INFO L226 Difference]: Without dead ends: 86 [2019-10-02 11:08:08,510 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:08,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-10-02 11:08:08,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 64. [2019-10-02 11:08:08,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-02 11:08:08,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 104 transitions. [2019-10-02 11:08:08,520 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 104 transitions. Word has length 17 [2019-10-02 11:08:08,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:08,521 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 104 transitions. [2019-10-02 11:08:08,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:08,521 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 104 transitions. [2019-10-02 11:08:08,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-02 11:08:08,522 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:08,523 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:08,523 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:08,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:08,523 INFO L82 PathProgramCache]: Analyzing trace with hash 721572051, now seen corresponding path program 1 times [2019-10-02 11:08:08,524 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:08,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:08,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:08,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:08,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:08,556 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:08,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:08,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:08,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:08,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:08,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:08,557 INFO L87 Difference]: Start difference. First operand 64 states and 104 transitions. Second operand 3 states. [2019-10-02 11:08:08,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:08,581 INFO L93 Difference]: Finished difference Result 144 states and 238 transitions. [2019-10-02 11:08:08,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:08,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-02 11:08:08,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:08,583 INFO L225 Difference]: With dead ends: 144 [2019-10-02 11:08:08,583 INFO L226 Difference]: Without dead ends: 88 [2019-10-02 11:08:08,584 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:08,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-02 11:08:08,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2019-10-02 11:08:08,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-10-02 11:08:08,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 138 transitions. [2019-10-02 11:08:08,594 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 138 transitions. Word has length 17 [2019-10-02 11:08:08,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:08,594 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 138 transitions. [2019-10-02 11:08:08,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:08,594 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 138 transitions. [2019-10-02 11:08:08,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-02 11:08:08,596 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:08,596 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:08,596 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:08,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:08,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1287139128, now seen corresponding path program 1 times [2019-10-02 11:08:08,597 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:08,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:08,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:08,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:08,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:08,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:08,626 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:08,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:08,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:08,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:08,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:08,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:08,628 INFO L87 Difference]: Start difference. First operand 86 states and 138 transitions. Second operand 3 states. [2019-10-02 11:08:08,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:08,649 INFO L93 Difference]: Finished difference Result 129 states and 205 transitions. [2019-10-02 11:08:08,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:08,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-02 11:08:08,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:08,652 INFO L225 Difference]: With dead ends: 129 [2019-10-02 11:08:08,652 INFO L226 Difference]: Without dead ends: 90 [2019-10-02 11:08:08,653 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:08,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-02 11:08:08,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-10-02 11:08:08,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-02 11:08:08,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2019-10-02 11:08:08,663 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 138 transitions. Word has length 18 [2019-10-02 11:08:08,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:08,664 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 138 transitions. [2019-10-02 11:08:08,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:08,664 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 138 transitions. [2019-10-02 11:08:08,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-02 11:08:08,666 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:08,666 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:08,667 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:08,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:08,667 INFO L82 PathProgramCache]: Analyzing trace with hash 894112118, now seen corresponding path program 1 times [2019-10-02 11:08:08,667 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:08,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:08,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:08,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:08,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:08,697 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:08,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:08,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:08,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:08,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:08,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:08,699 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. Second operand 3 states. [2019-10-02 11:08:08,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:08,741 INFO L93 Difference]: Finished difference Result 156 states and 248 transitions. [2019-10-02 11:08:08,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:08,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-02 11:08:08,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:08,744 INFO L225 Difference]: With dead ends: 156 [2019-10-02 11:08:08,744 INFO L226 Difference]: Without dead ends: 154 [2019-10-02 11:08:08,749 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:08,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-02 11:08:08,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 120. [2019-10-02 11:08:08,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-10-02 11:08:08,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 186 transitions. [2019-10-02 11:08:08,771 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 186 transitions. Word has length 18 [2019-10-02 11:08:08,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:08,772 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 186 transitions. [2019-10-02 11:08:08,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:08,772 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 186 transitions. [2019-10-02 11:08:08,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-02 11:08:08,776 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:08,777 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:08,777 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:08,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:08,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1574170488, now seen corresponding path program 1 times [2019-10-02 11:08:08,778 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:08,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:08,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:08,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:08,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:08,832 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:08,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:08,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:08,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:08,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:08,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:08,836 INFO L87 Difference]: Start difference. First operand 120 states and 186 transitions. Second operand 3 states. [2019-10-02 11:08:08,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:08,875 INFO L93 Difference]: Finished difference Result 272 states and 424 transitions. [2019-10-02 11:08:08,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:08,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-02 11:08:08,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:08,878 INFO L225 Difference]: With dead ends: 272 [2019-10-02 11:08:08,878 INFO L226 Difference]: Without dead ends: 162 [2019-10-02 11:08:08,880 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:08,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-10-02 11:08:08,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2019-10-02 11:08:08,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-10-02 11:08:08,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 242 transitions. [2019-10-02 11:08:08,913 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 242 transitions. Word has length 18 [2019-10-02 11:08:08,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:08,913 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 242 transitions. [2019-10-02 11:08:08,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:08,913 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 242 transitions. [2019-10-02 11:08:08,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-02 11:08:08,918 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:08,918 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:08,918 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:08,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:08,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1947887240, now seen corresponding path program 1 times [2019-10-02 11:08:08,919 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:08,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:08,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:08,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:08,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:08,967 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:08,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:08,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:08,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:08,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:08,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:08,969 INFO L87 Difference]: Start difference. First operand 160 states and 242 transitions. Second operand 3 states. [2019-10-02 11:08:08,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:08,991 INFO L93 Difference]: Finished difference Result 240 states and 360 transitions. [2019-10-02 11:08:08,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:08,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-02 11:08:08,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:08,994 INFO L225 Difference]: With dead ends: 240 [2019-10-02 11:08:08,994 INFO L226 Difference]: Without dead ends: 166 [2019-10-02 11:08:08,995 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:08,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-02 11:08:09,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-10-02 11:08:09,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-02 11:08:09,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 242 transitions. [2019-10-02 11:08:09,020 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 242 transitions. Word has length 19 [2019-10-02 11:08:09,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:09,021 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 242 transitions. [2019-10-02 11:08:09,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:09,021 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2019-10-02 11:08:09,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-02 11:08:09,023 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:09,023 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:09,023 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:09,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:09,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1554860230, now seen corresponding path program 1 times [2019-10-02 11:08:09,024 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:09,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:09,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:09,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:09,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:09,068 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:09,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:09,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:09,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:09,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:09,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:09,070 INFO L87 Difference]: Start difference. First operand 164 states and 242 transitions. Second operand 3 states. [2019-10-02 11:08:09,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:09,095 INFO L93 Difference]: Finished difference Result 284 states and 424 transitions. [2019-10-02 11:08:09,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:09,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-02 11:08:09,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:09,098 INFO L225 Difference]: With dead ends: 284 [2019-10-02 11:08:09,098 INFO L226 Difference]: Without dead ends: 282 [2019-10-02 11:08:09,099 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:09,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-10-02 11:08:09,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 232. [2019-10-02 11:08:09,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-02 11:08:09,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 334 transitions. [2019-10-02 11:08:09,109 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 334 transitions. Word has length 19 [2019-10-02 11:08:09,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:09,109 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 334 transitions. [2019-10-02 11:08:09,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:09,110 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 334 transitions. [2019-10-02 11:08:09,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-02 11:08:09,111 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:09,111 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:09,111 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:09,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:09,112 INFO L82 PathProgramCache]: Analyzing trace with hash -2060048696, now seen corresponding path program 1 times [2019-10-02 11:08:09,112 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:09,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:09,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:09,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:09,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:09,157 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:09,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:09,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:09,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:09,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:09,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:09,159 INFO L87 Difference]: Start difference. First operand 232 states and 334 transitions. Second operand 3 states. [2019-10-02 11:08:09,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:09,181 INFO L93 Difference]: Finished difference Result 524 states and 752 transitions. [2019-10-02 11:08:09,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:09,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-02 11:08:09,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:09,184 INFO L225 Difference]: With dead ends: 524 [2019-10-02 11:08:09,184 INFO L226 Difference]: Without dead ends: 306 [2019-10-02 11:08:09,185 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:09,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-02 11:08:09,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-10-02 11:08:09,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-02 11:08:09,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 422 transitions. [2019-10-02 11:08:09,199 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 422 transitions. Word has length 19 [2019-10-02 11:08:09,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:09,199 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 422 transitions. [2019-10-02 11:08:09,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:09,200 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 422 transitions. [2019-10-02 11:08:09,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 11:08:09,201 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:09,201 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:09,201 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:09,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:09,202 INFO L82 PathProgramCache]: Analyzing trace with hash 956242573, now seen corresponding path program 1 times [2019-10-02 11:08:09,202 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:09,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:09,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:09,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:09,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:09,235 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:09,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:09,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:09,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:09,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:09,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:09,238 INFO L87 Difference]: Start difference. First operand 304 states and 422 transitions. Second operand 3 states. [2019-10-02 11:08:09,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:09,261 INFO L93 Difference]: Finished difference Result 456 states and 628 transitions. [2019-10-02 11:08:09,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:09,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-02 11:08:09,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:09,264 INFO L225 Difference]: With dead ends: 456 [2019-10-02 11:08:09,266 INFO L226 Difference]: Without dead ends: 314 [2019-10-02 11:08:09,267 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:09,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-10-02 11:08:09,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2019-10-02 11:08:09,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-10-02 11:08:09,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 422 transitions. [2019-10-02 11:08:09,282 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 422 transitions. Word has length 20 [2019-10-02 11:08:09,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:09,282 INFO L475 AbstractCegarLoop]: Abstraction has 312 states and 422 transitions. [2019-10-02 11:08:09,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:09,283 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 422 transitions. [2019-10-02 11:08:09,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 11:08:09,284 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:09,284 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:09,285 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:09,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:09,285 INFO L82 PathProgramCache]: Analyzing trace with hash 563215563, now seen corresponding path program 1 times [2019-10-02 11:08:09,285 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:09,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:09,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:09,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:09,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:09,334 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:09,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:09,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:09,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:09,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:09,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:09,336 INFO L87 Difference]: Start difference. First operand 312 states and 422 transitions. Second operand 3 states. [2019-10-02 11:08:09,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:09,360 INFO L93 Difference]: Finished difference Result 524 states and 712 transitions. [2019-10-02 11:08:09,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:09,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-02 11:08:09,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:09,364 INFO L225 Difference]: With dead ends: 524 [2019-10-02 11:08:09,364 INFO L226 Difference]: Without dead ends: 522 [2019-10-02 11:08:09,364 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:09,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-10-02 11:08:09,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 456. [2019-10-02 11:08:09,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-10-02 11:08:09,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 598 transitions. [2019-10-02 11:08:09,381 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 598 transitions. Word has length 20 [2019-10-02 11:08:09,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:09,381 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 598 transitions. [2019-10-02 11:08:09,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:09,381 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 598 transitions. [2019-10-02 11:08:09,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 11:08:09,385 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:09,385 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:09,385 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:09,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:09,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1243273933, now seen corresponding path program 1 times [2019-10-02 11:08:09,386 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:09,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:09,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:09,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:09,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:09,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:09,424 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:09,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:09,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:09,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:09,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:09,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:09,426 INFO L87 Difference]: Start difference. First operand 456 states and 598 transitions. Second operand 3 states. [2019-10-02 11:08:09,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:09,458 INFO L93 Difference]: Finished difference Result 1020 states and 1320 transitions. [2019-10-02 11:08:09,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:09,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-02 11:08:09,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:09,467 INFO L225 Difference]: With dead ends: 1020 [2019-10-02 11:08:09,467 INFO L226 Difference]: Without dead ends: 586 [2019-10-02 11:08:09,471 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:09,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-02 11:08:09,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2019-10-02 11:08:09,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-02 11:08:09,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 726 transitions. [2019-10-02 11:08:09,492 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 726 transitions. Word has length 20 [2019-10-02 11:08:09,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:09,493 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 726 transitions. [2019-10-02 11:08:09,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:09,493 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 726 transitions. [2019-10-02 11:08:09,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-02 11:08:09,495 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:09,496 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:09,496 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:09,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:09,496 INFO L82 PathProgramCache]: Analyzing trace with hash 280029309, now seen corresponding path program 1 times [2019-10-02 11:08:09,497 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:09,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:09,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:09,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:09,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:09,525 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:09,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:09,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:09,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:09,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:09,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:09,528 INFO L87 Difference]: Start difference. First operand 584 states and 726 transitions. Second operand 3 states. [2019-10-02 11:08:09,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:09,552 INFO L93 Difference]: Finished difference Result 876 states and 1080 transitions. [2019-10-02 11:08:09,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:09,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-02 11:08:09,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:09,557 INFO L225 Difference]: With dead ends: 876 [2019-10-02 11:08:09,557 INFO L226 Difference]: Without dead ends: 602 [2019-10-02 11:08:09,560 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:09,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-02 11:08:09,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2019-10-02 11:08:09,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-02 11:08:09,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 726 transitions. [2019-10-02 11:08:09,582 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 726 transitions. Word has length 21 [2019-10-02 11:08:09,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:09,582 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 726 transitions. [2019-10-02 11:08:09,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:09,583 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 726 transitions. [2019-10-02 11:08:09,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-02 11:08:09,584 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:09,584 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:09,584 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:09,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:09,585 INFO L82 PathProgramCache]: Analyzing trace with hash -112997701, now seen corresponding path program 1 times [2019-10-02 11:08:09,585 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:09,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:09,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:09,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:09,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:09,609 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:09,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:09,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:09,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:09,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:09,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:09,611 INFO L87 Difference]: Start difference. First operand 600 states and 726 transitions. Second operand 3 states. [2019-10-02 11:08:09,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:09,644 INFO L93 Difference]: Finished difference Result 970 states and 1159 transitions. [2019-10-02 11:08:09,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:09,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-02 11:08:09,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:09,649 INFO L225 Difference]: With dead ends: 970 [2019-10-02 11:08:09,649 INFO L226 Difference]: Without dead ends: 968 [2019-10-02 11:08:09,650 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:09,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2019-10-02 11:08:09,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 904. [2019-10-02 11:08:09,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-10-02 11:08:09,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1062 transitions. [2019-10-02 11:08:09,680 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1062 transitions. Word has length 21 [2019-10-02 11:08:09,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:09,680 INFO L475 AbstractCegarLoop]: Abstraction has 904 states and 1062 transitions. [2019-10-02 11:08:09,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:09,681 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1062 transitions. [2019-10-02 11:08:09,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-02 11:08:09,683 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:09,683 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:09,683 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:09,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:09,684 INFO L82 PathProgramCache]: Analyzing trace with hash 567060669, now seen corresponding path program 1 times [2019-10-02 11:08:09,684 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:09,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:09,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:09,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:09,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:09,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:09,702 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:09,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:09,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:09,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:09,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:09,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:09,703 INFO L87 Difference]: Start difference. First operand 904 states and 1062 transitions. Second operand 3 states. [2019-10-02 11:08:09,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:09,744 INFO L93 Difference]: Finished difference Result 1992 states and 2278 transitions. [2019-10-02 11:08:09,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:09,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-02 11:08:09,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:09,745 INFO L225 Difference]: With dead ends: 1992 [2019-10-02 11:08:09,745 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 11:08:09,749 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:09,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 11:08:09,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 11:08:09,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 11:08:09,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 11:08:09,751 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-10-02 11:08:09,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:09,751 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 11:08:09,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:09,751 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 11:08:09,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 11:08:09,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 11:08:09,779 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-02 11:08:09,779 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:08:09,779 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:08:09,779 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-02 11:08:09,779 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:08:09,779 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:08:09,780 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-10-02 11:08:09,780 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 107) no Hoare annotation was computed. [2019-10-02 11:08:09,780 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 27 102) no Hoare annotation was computed. [2019-10-02 11:08:09,780 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-10-02 11:08:09,780 INFO L446 ceAbstractionStarter]: At program point L103(lines 5 107) the Hoare annotation is: true [2019-10-02 11:08:09,780 INFO L443 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2019-10-02 11:08:09,781 INFO L443 ceAbstractionStarter]: For program point L62-1(lines 27 102) no Hoare annotation was computed. [2019-10-02 11:08:09,781 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 27 102) no Hoare annotation was computed. [2019-10-02 11:08:09,781 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 27 102) no Hoare annotation was computed. [2019-10-02 11:08:09,781 INFO L443 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2019-10-02 11:08:09,781 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 107) no Hoare annotation was computed. [2019-10-02 11:08:09,781 INFO L443 ceAbstractionStarter]: For program point L46-2(lines 27 102) no Hoare annotation was computed. [2019-10-02 11:08:09,781 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2019-10-02 11:08:09,782 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2019-10-02 11:08:09,782 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-10-02 11:08:09,782 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 27 102) no Hoare annotation was computed. [2019-10-02 11:08:09,782 INFO L446 ceAbstractionStarter]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2019-10-02 11:08:09,782 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-10-02 11:08:09,782 INFO L443 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2019-10-02 11:08:09,783 INFO L439 ceAbstractionStarter]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2019-10-02 11:08:09,783 INFO L443 ceAbstractionStarter]: For program point L82-1(lines 27 102) no Hoare annotation was computed. [2019-10-02 11:08:09,783 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 27 102) no Hoare annotation was computed. [2019-10-02 11:08:09,783 INFO L443 ceAbstractionStarter]: For program point L58-1(lines 27 102) no Hoare annotation was computed. [2019-10-02 11:08:09,783 INFO L443 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-10-02 11:08:09,783 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 27 102) no Hoare annotation was computed. [2019-10-02 11:08:09,783 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 27 102) no Hoare annotation was computed. [2019-10-02 11:08:09,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:08:09 BoogieIcfgContainer [2019-10-02 11:08:09,792 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 11:08:09,795 INFO L168 Benchmark]: Toolchain (without parser) took 2761.96 ms. Allocated memory was 133.7 MB in the beginning and 226.5 MB in the end (delta: 92.8 MB). Free memory was 89.7 MB in the beginning and 85.3 MB in the end (delta: 4.4 MB). Peak memory consumption was 97.2 MB. Max. memory is 7.1 GB. [2019-10-02 11:08:09,796 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 133.7 MB. Free memory was 108.0 MB in the beginning and 107.8 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:09,797 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.58 ms. Allocated memory was 133.7 MB in the beginning and 200.3 MB in the end (delta: 66.6 MB). Free memory was 89.4 MB in the beginning and 177.9 MB in the end (delta: -88.5 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2019-10-02 11:08:09,798 INFO L168 Benchmark]: Boogie Preprocessor took 29.36 ms. Allocated memory is still 200.3 MB. Free memory was 177.9 MB in the beginning and 175.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-10-02 11:08:09,798 INFO L168 Benchmark]: RCFGBuilder took 369.42 ms. Allocated memory is still 200.3 MB. Free memory was 175.7 MB in the beginning and 160.0 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2019-10-02 11:08:09,799 INFO L168 Benchmark]: TraceAbstraction took 2013.02 ms. Allocated memory was 200.3 MB in the beginning and 226.5 MB in the end (delta: 26.2 MB). Free memory was 160.0 MB in the beginning and 85.3 MB in the end (delta: 74.7 MB). Peak memory consumption was 100.9 MB. Max. memory is 7.1 GB. [2019-10-02 11:08:09,803 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.44 ms. Allocated memory is still 133.7 MB. Free memory was 108.0 MB in the beginning and 107.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 345.58 ms. Allocated memory was 133.7 MB in the beginning and 200.3 MB in the end (delta: 66.6 MB). Free memory was 89.4 MB in the beginning and 177.9 MB in the end (delta: -88.5 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.36 ms. Allocated memory is still 200.3 MB. Free memory was 177.9 MB in the beginning and 175.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 369.42 ms. Allocated memory is still 200.3 MB. Free memory was 175.7 MB in the beginning and 160.0 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2013.02 ms. Allocated memory was 200.3 MB in the beginning and 226.5 MB in the end (delta: 26.2 MB). Free memory was 160.0 MB in the beginning and 85.3 MB in the end (delta: 74.7 MB). Peak memory consumption was 100.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: 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: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. SAFE Result, 1.9s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 923 SDtfs, 417 SDslu, 612 SDs, 0 SdLazy, 91 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=904occurred in iteration=16, 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, 17 MinimizatonAttempts, 270 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 74 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, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 9690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...