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_8.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:13:51,936 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:13:51,939 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:13:51,958 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:13:51,958 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:13:51,961 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:13:51,962 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:13:51,972 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:13:51,976 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:13:51,979 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:13:51,981 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:13:51,983 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:13:51,983 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:13:51,985 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:13:51,987 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:13:51,988 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:13:51,990 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:13:51,990 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:13:51,992 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:13:51,996 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:13:52,000 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:13:52,003 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:13:52,006 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:13:52,007 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:13:52,009 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:13:52,009 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:13:52,010 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:13:52,011 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:13:52,013 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:13:52,014 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:13:52,014 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:13:52,015 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:13:52,015 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:13:52,016 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:13:52,017 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:13:52,018 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:13:52,018 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:13:52,019 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:13:52,019 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:13:52,020 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:13:52,021 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:13:52,022 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-14 23:13:52,053 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:13:52,053 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:13:52,054 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:13:52,055 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:13:52,055 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:13:52,055 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:13:52,055 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:13:52,056 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:13:52,056 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:13:52,056 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:13:52,056 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:13:52,056 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:13:52,057 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:13:52,057 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:13:52,057 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:13:52,057 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:13:52,061 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:13:52,061 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:13:52,061 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:13:52,061 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:13:52,062 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:13:52,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:13:52,062 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:13:52,063 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:13:52,063 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:13:52,063 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:13:52,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:13:52,064 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:13:52,064 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:13:52,332 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:13:52,348 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:13:52,351 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:13:52,353 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:13:52,353 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:13:52,354 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2019-10-14 23:13:52,426 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66e97c686/78b33fb25bc9452cb339c06f1f31a8cc/FLAGa794bb84c [2019-10-14 23:13:52,861 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:13:52,862 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2019-10-14 23:13:52,869 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66e97c686/78b33fb25bc9452cb339c06f1f31a8cc/FLAGa794bb84c [2019-10-14 23:13:53,242 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66e97c686/78b33fb25bc9452cb339c06f1f31a8cc [2019-10-14 23:13:53,253 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:13:53,255 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:13:53,256 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:13:53,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:13:53,259 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:13:53,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:13:53" (1/1) ... [2019-10-14 23:13:53,263 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25de8a98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:53, skipping insertion in model container [2019-10-14 23:13:53,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:13:53" (1/1) ... [2019-10-14 23:13:53,271 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:13:53,292 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:13:53,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:13:53,481 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:13:53,513 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:13:53,526 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:13:53,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:53 WrapperNode [2019-10-14 23:13:53,527 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:13:53,527 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:13:53,527 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:13:53,527 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:13:53,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:53" (1/1) ... [2019-10-14 23:13:53,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:53" (1/1) ... [2019-10-14 23:13:53,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:53" (1/1) ... [2019-10-14 23:13:53,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:53" (1/1) ... [2019-10-14 23:13:53,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:53" (1/1) ... [2019-10-14 23:13:53,651 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:53" (1/1) ... [2019-10-14 23:13:53,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:53" (1/1) ... [2019-10-14 23:13:53,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:13:53,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:13:53,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:13:53,655 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:13:53,656 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:13:53,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:13:53,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:13:53,705 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:13:53,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:13:53,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:13:53,706 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:13:53,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:13:53,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:13:54,026 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:13:54,026 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-14 23:13:54,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:13:54 BoogieIcfgContainer [2019-10-14 23:13:54,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:13:54,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:13:54,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:13:54,033 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:13:54,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:13:53" (1/3) ... [2019-10-14 23:13:54,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec1accf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:13:54, skipping insertion in model container [2019-10-14 23:13:54,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:53" (2/3) ... [2019-10-14 23:13:54,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec1accf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:13:54, skipping insertion in model container [2019-10-14 23:13:54,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:13:54" (3/3) ... [2019-10-14 23:13:54,044 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2019-10-14 23:13:54,054 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:13:54,062 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:13:54,072 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:13:54,098 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:13:54,099 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:13:54,099 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:13:54,099 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:13:54,099 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:13:54,100 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:13:54,100 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:13:54,101 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:13:54,119 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-10-14 23:13:54,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 23:13:54,124 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:54,124 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:54,126 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:54,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:54,131 INFO L82 PathProgramCache]: Analyzing trace with hash 577441593, now seen corresponding path program 1 times [2019-10-14 23:13:54,139 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:54,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870313254] [2019-10-14 23:13:54,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,301 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-14 23:13:54,302 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870313254] [2019-10-14 23:13:54,303 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:54,303 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:54,303 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651934448] [2019-10-14 23:13:54,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:54,308 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:54,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:54,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,326 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2019-10-14 23:13:54,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:54,387 INFO L93 Difference]: Finished difference Result 75 states and 126 transitions. [2019-10-14 23:13:54,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:54,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-14 23:13:54,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:54,406 INFO L225 Difference]: With dead ends: 75 [2019-10-14 23:13:54,408 INFO L226 Difference]: Without dead ends: 60 [2019-10-14 23:13:54,413 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:13:54,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-14 23:13:54,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-10-14 23:13:54,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-14 23:13:54,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2019-10-14 23:13:54,460 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 18 [2019-10-14 23:13:54,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:54,461 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2019-10-14 23:13:54,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:54,461 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2019-10-14 23:13:54,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 23:13:54,463 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:54,463 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:54,464 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:54,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:54,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1278506171, now seen corresponding path program 1 times [2019-10-14 23:13:54,465 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:54,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082563580] [2019-10-14 23:13:54,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,544 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-14 23:13:54,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082563580] [2019-10-14 23:13:54,547 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:54,547 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:54,547 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014647356] [2019-10-14 23:13:54,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:54,552 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:54,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:54,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,553 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 3 states. [2019-10-14 23:13:54,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:54,588 INFO L93 Difference]: Finished difference Result 97 states and 172 transitions. [2019-10-14 23:13:54,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:54,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-14 23:13:54,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:54,591 INFO L225 Difference]: With dead ends: 97 [2019-10-14 23:13:54,591 INFO L226 Difference]: Without dead ends: 60 [2019-10-14 23:13:54,593 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:13:54,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-14 23:13:54,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-10-14 23:13:54,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-14 23:13:54,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 101 transitions. [2019-10-14 23:13:54,603 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 101 transitions. Word has length 18 [2019-10-14 23:13:54,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:54,603 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 101 transitions. [2019-10-14 23:13:54,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:54,604 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 101 transitions. [2019-10-14 23:13:54,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 23:13:54,605 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:54,605 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:54,605 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:54,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:54,606 INFO L82 PathProgramCache]: Analyzing trace with hash 721034227, now seen corresponding path program 1 times [2019-10-14 23:13:54,606 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:54,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881508296] [2019-10-14 23:13:54,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,655 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-14 23:13:54,656 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881508296] [2019-10-14 23:13:54,656 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:54,660 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:54,661 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490708297] [2019-10-14 23:13:54,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:54,662 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:54,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:54,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,663 INFO L87 Difference]: Start difference. First operand 58 states and 101 transitions. Second operand 3 states. [2019-10-14 23:13:54,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:54,695 INFO L93 Difference]: Finished difference Result 90 states and 153 transitions. [2019-10-14 23:13:54,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:54,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-14 23:13:54,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:54,698 INFO L225 Difference]: With dead ends: 90 [2019-10-14 23:13:54,698 INFO L226 Difference]: Without dead ends: 63 [2019-10-14 23:13:54,699 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:13:54,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-14 23:13:54,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-10-14 23:13:54,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-14 23:13:54,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 103 transitions. [2019-10-14 23:13:54,710 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 103 transitions. Word has length 19 [2019-10-14 23:13:54,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:54,710 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 103 transitions. [2019-10-14 23:13:54,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:54,711 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2019-10-14 23:13:54,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 23:13:54,712 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:54,712 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:54,713 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:54,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:54,713 INFO L82 PathProgramCache]: Analyzing trace with hash 979199665, now seen corresponding path program 1 times [2019-10-14 23:13:54,713 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:54,714 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451269369] [2019-10-14 23:13:54,714 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,714 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,778 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-14 23:13:54,778 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451269369] [2019-10-14 23:13:54,779 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:54,779 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:54,780 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481682441] [2019-10-14 23:13:54,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:54,781 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:54,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:54,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,782 INFO L87 Difference]: Start difference. First operand 61 states and 103 transitions. Second operand 3 states. [2019-10-14 23:13:54,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:54,808 INFO L93 Difference]: Finished difference Result 112 states and 192 transitions. [2019-10-14 23:13:54,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:54,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-14 23:13:54,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:54,811 INFO L225 Difference]: With dead ends: 112 [2019-10-14 23:13:54,811 INFO L226 Difference]: Without dead ends: 110 [2019-10-14 23:13:54,812 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:13:54,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-14 23:13:54,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2019-10-14 23:13:54,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-14 23:13:54,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 136 transitions. [2019-10-14 23:13:54,824 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 136 transitions. Word has length 19 [2019-10-14 23:13:54,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:54,825 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 136 transitions. [2019-10-14 23:13:54,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:54,825 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 136 transitions. [2019-10-14 23:13:54,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 23:13:54,826 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:54,826 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:54,827 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:54,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:54,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1680264243, now seen corresponding path program 1 times [2019-10-14 23:13:54,827 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:54,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84889461] [2019-10-14 23:13:54,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,892 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-14 23:13:54,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84889461] [2019-10-14 23:13:54,892 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:54,893 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:54,893 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484945218] [2019-10-14 23:13:54,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:54,895 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:54,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:54,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,896 INFO L87 Difference]: Start difference. First operand 80 states and 136 transitions. Second operand 3 states. [2019-10-14 23:13:54,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:54,933 INFO L93 Difference]: Finished difference Result 184 states and 318 transitions. [2019-10-14 23:13:54,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:54,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-14 23:13:54,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:54,935 INFO L225 Difference]: With dead ends: 184 [2019-10-14 23:13:54,935 INFO L226 Difference]: Without dead ends: 112 [2019-10-14 23:13:54,936 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:13:54,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-14 23:13:54,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-10-14 23:13:54,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-14 23:13:54,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 186 transitions. [2019-10-14 23:13:54,952 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 186 transitions. Word has length 19 [2019-10-14 23:13:54,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:54,952 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 186 transitions. [2019-10-14 23:13:54,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:54,955 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 186 transitions. [2019-10-14 23:13:54,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 23:13:54,958 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:54,958 INFO L380 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-14 23:13:54,959 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:54,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:54,959 INFO L82 PathProgramCache]: Analyzing trace with hash 290632912, now seen corresponding path program 1 times [2019-10-14 23:13:54,959 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:54,960 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280077179] [2019-10-14 23:13:54,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,021 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-14 23:13:55,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280077179] [2019-10-14 23:13:55,023 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:55,023 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:55,023 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601057819] [2019-10-14 23:13:55,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:55,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:55,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:55,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:55,026 INFO L87 Difference]: Start difference. First operand 110 states and 186 transitions. Second operand 3 states. [2019-10-14 23:13:55,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:55,050 INFO L93 Difference]: Finished difference Result 165 states and 277 transitions. [2019-10-14 23:13:55,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:55,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-14 23:13:55,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:55,052 INFO L225 Difference]: With dead ends: 165 [2019-10-14 23:13:55,052 INFO L226 Difference]: Without dead ends: 114 [2019-10-14 23:13:55,053 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:13:55,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-14 23:13:55,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2019-10-14 23:13:55,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-14 23:13:55,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 186 transitions. [2019-10-14 23:13:55,065 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 186 transitions. Word has length 20 [2019-10-14 23:13:55,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:55,065 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 186 transitions. [2019-10-14 23:13:55,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:55,066 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 186 transitions. [2019-10-14 23:13:55,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 23:13:55,067 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:55,067 INFO L380 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-14 23:13:55,067 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:55,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:55,068 INFO L82 PathProgramCache]: Analyzing trace with hash 548798350, now seen corresponding path program 1 times [2019-10-14 23:13:55,068 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:55,068 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138570424] [2019-10-14 23:13:55,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:55,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,097 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-14 23:13:55,097 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138570424] [2019-10-14 23:13:55,097 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:55,098 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:55,098 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325111534] [2019-10-14 23:13:55,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:55,099 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:55,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:55,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:55,099 INFO L87 Difference]: Start difference. First operand 112 states and 186 transitions. Second operand 3 states. [2019-10-14 23:13:55,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:55,128 INFO L93 Difference]: Finished difference Result 204 states and 344 transitions. [2019-10-14 23:13:55,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:55,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-14 23:13:55,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:55,131 INFO L225 Difference]: With dead ends: 204 [2019-10-14 23:13:55,131 INFO L226 Difference]: Without dead ends: 202 [2019-10-14 23:13:55,132 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:13:55,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-14 23:13:55,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 152. [2019-10-14 23:13:55,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-14 23:13:55,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 250 transitions. [2019-10-14 23:13:55,154 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 250 transitions. Word has length 20 [2019-10-14 23:13:55,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:55,154 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 250 transitions. [2019-10-14 23:13:55,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:55,155 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 250 transitions. [2019-10-14 23:13:55,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 23:13:55,157 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:55,157 INFO L380 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-14 23:13:55,157 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:55,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:55,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1249862928, now seen corresponding path program 1 times [2019-10-14 23:13:55,158 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:55,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561754544] [2019-10-14 23:13:55,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,228 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-14 23:13:55,229 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561754544] [2019-10-14 23:13:55,229 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:55,229 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:55,229 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193159794] [2019-10-14 23:13:55,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:55,230 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:55,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:55,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:55,231 INFO L87 Difference]: Start difference. First operand 152 states and 250 transitions. Second operand 3 states. [2019-10-14 23:13:55,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:55,262 INFO L93 Difference]: Finished difference Result 352 states and 584 transitions. [2019-10-14 23:13:55,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:55,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-14 23:13:55,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:55,265 INFO L225 Difference]: With dead ends: 352 [2019-10-14 23:13:55,265 INFO L226 Difference]: Without dead ends: 210 [2019-10-14 23:13:55,266 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:13:55,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-10-14 23:13:55,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2019-10-14 23:13:55,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-10-14 23:13:55,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 338 transitions. [2019-10-14 23:13:55,279 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 338 transitions. Word has length 20 [2019-10-14 23:13:55,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:55,279 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 338 transitions. [2019-10-14 23:13:55,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:55,280 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 338 transitions. [2019-10-14 23:13:55,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 23:13:55,281 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:55,281 INFO L380 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-14 23:13:55,282 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:55,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:55,282 INFO L82 PathProgramCache]: Analyzing trace with hash -166905624, now seen corresponding path program 1 times [2019-10-14 23:13:55,282 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:55,282 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959940643] [2019-10-14 23:13:55,283 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,283 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,324 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-14 23:13:55,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959940643] [2019-10-14 23:13:55,325 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:55,325 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:55,326 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731018249] [2019-10-14 23:13:55,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:55,326 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:55,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:55,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:55,327 INFO L87 Difference]: Start difference. First operand 208 states and 338 transitions. Second operand 3 states. [2019-10-14 23:13:55,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:55,363 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2019-10-14 23:13:55,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:55,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-14 23:13:55,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:55,366 INFO L225 Difference]: With dead ends: 312 [2019-10-14 23:13:55,366 INFO L226 Difference]: Without dead ends: 214 [2019-10-14 23:13:55,368 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:13:55,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-10-14 23:13:55,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2019-10-14 23:13:55,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-10-14 23:13:55,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 338 transitions. [2019-10-14 23:13:55,398 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 338 transitions. Word has length 21 [2019-10-14 23:13:55,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:55,401 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 338 transitions. [2019-10-14 23:13:55,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:55,402 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 338 transitions. [2019-10-14 23:13:55,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 23:13:55,403 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:55,403 INFO L380 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-14 23:13:55,403 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:55,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:55,404 INFO L82 PathProgramCache]: Analyzing trace with hash 91259814, now seen corresponding path program 1 times [2019-10-14 23:13:55,406 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:55,407 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454201530] [2019-10-14 23:13:55,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,452 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-14 23:13:55,453 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454201530] [2019-10-14 23:13:55,453 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:55,453 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:55,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121243853] [2019-10-14 23:13:55,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:55,454 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:55,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:55,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:55,455 INFO L87 Difference]: Start difference. First operand 212 states and 338 transitions. Second operand 3 states. [2019-10-14 23:13:55,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:55,478 INFO L93 Difference]: Finished difference Result 380 states and 616 transitions. [2019-10-14 23:13:55,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:55,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-14 23:13:55,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:55,482 INFO L225 Difference]: With dead ends: 380 [2019-10-14 23:13:55,482 INFO L226 Difference]: Without dead ends: 378 [2019-10-14 23:13:55,485 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:13:55,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-10-14 23:13:55,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 296. [2019-10-14 23:13:55,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-10-14 23:13:55,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 462 transitions. [2019-10-14 23:13:55,500 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 462 transitions. Word has length 21 [2019-10-14 23:13:55,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:55,502 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 462 transitions. [2019-10-14 23:13:55,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:55,503 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 462 transitions. [2019-10-14 23:13:55,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 23:13:55,504 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:55,504 INFO L380 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-14 23:13:55,504 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:55,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:55,505 INFO L82 PathProgramCache]: Analyzing trace with hash 792324392, now seen corresponding path program 1 times [2019-10-14 23:13:55,505 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:55,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234921725] [2019-10-14 23:13:55,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,539 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-14 23:13:55,539 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234921725] [2019-10-14 23:13:55,539 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:55,540 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:55,540 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342784757] [2019-10-14 23:13:55,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:55,540 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:55,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:55,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:55,541 INFO L87 Difference]: Start difference. First operand 296 states and 462 transitions. Second operand 3 states. [2019-10-14 23:13:55,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:55,575 INFO L93 Difference]: Finished difference Result 684 states and 1072 transitions. [2019-10-14 23:13:55,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:55,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-14 23:13:55,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:55,578 INFO L225 Difference]: With dead ends: 684 [2019-10-14 23:13:55,579 INFO L226 Difference]: Without dead ends: 402 [2019-10-14 23:13:55,581 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:13:55,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-10-14 23:13:55,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2019-10-14 23:13:55,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-10-14 23:13:55,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 614 transitions. [2019-10-14 23:13:55,600 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 614 transitions. Word has length 21 [2019-10-14 23:13:55,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:55,601 INFO L462 AbstractCegarLoop]: Abstraction has 400 states and 614 transitions. [2019-10-14 23:13:55,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:55,601 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 614 transitions. [2019-10-14 23:13:55,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 23:13:55,605 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:55,605 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:55,605 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:55,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:55,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1465698011, now seen corresponding path program 1 times [2019-10-14 23:13:55,606 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:55,606 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147414864] [2019-10-14 23:13:55,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,644 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-14 23:13:55,645 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147414864] [2019-10-14 23:13:55,645 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:55,645 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:55,645 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676561436] [2019-10-14 23:13:55,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:55,646 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:55,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:55,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:55,647 INFO L87 Difference]: Start difference. First operand 400 states and 614 transitions. Second operand 3 states. [2019-10-14 23:13:55,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:55,672 INFO L93 Difference]: Finished difference Result 600 states and 916 transitions. [2019-10-14 23:13:55,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:55,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-14 23:13:55,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:55,675 INFO L225 Difference]: With dead ends: 600 [2019-10-14 23:13:55,675 INFO L226 Difference]: Without dead ends: 410 [2019-10-14 23:13:55,676 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:13:55,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-10-14 23:13:55,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2019-10-14 23:13:55,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-10-14 23:13:55,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 614 transitions. [2019-10-14 23:13:55,690 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 614 transitions. Word has length 22 [2019-10-14 23:13:55,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:55,691 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 614 transitions. [2019-10-14 23:13:55,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:55,691 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 614 transitions. [2019-10-14 23:13:55,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 23:13:55,692 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:55,692 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:55,692 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:55,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:55,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1207532573, now seen corresponding path program 1 times [2019-10-14 23:13:55,693 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:55,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317893043] [2019-10-14 23:13:55,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:55,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,713 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-14 23:13:55,714 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317893043] [2019-10-14 23:13:55,714 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:55,714 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:55,714 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717449495] [2019-10-14 23:13:55,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:55,715 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:55,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:55,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:55,716 INFO L87 Difference]: Start difference. First operand 408 states and 614 transitions. Second operand 3 states. [2019-10-14 23:13:55,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:55,753 INFO L93 Difference]: Finished difference Result 716 states and 1096 transitions. [2019-10-14 23:13:55,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:55,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-14 23:13:55,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:55,759 INFO L225 Difference]: With dead ends: 716 [2019-10-14 23:13:55,759 INFO L226 Difference]: Without dead ends: 714 [2019-10-14 23:13:55,759 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:13:55,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-10-14 23:13:55,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 584. [2019-10-14 23:13:55,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-14 23:13:55,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 854 transitions. [2019-10-14 23:13:55,781 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 854 transitions. Word has length 22 [2019-10-14 23:13:55,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:55,781 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 854 transitions. [2019-10-14 23:13:55,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:55,781 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 854 transitions. [2019-10-14 23:13:55,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 23:13:55,783 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:55,783 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:55,784 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:55,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:55,784 INFO L82 PathProgramCache]: Analyzing trace with hash -506467995, now seen corresponding path program 1 times [2019-10-14 23:13:55,784 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:55,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934699964] [2019-10-14 23:13:55,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,813 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-14 23:13:55,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934699964] [2019-10-14 23:13:55,814 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:55,814 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:55,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906750187] [2019-10-14 23:13:55,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:55,815 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:55,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:55,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:55,815 INFO L87 Difference]: Start difference. First operand 584 states and 854 transitions. Second operand 3 states. [2019-10-14 23:13:55,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:55,844 INFO L93 Difference]: Finished difference Result 1340 states and 1960 transitions. [2019-10-14 23:13:55,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:55,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-14 23:13:55,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:55,849 INFO L225 Difference]: With dead ends: 1340 [2019-10-14 23:13:55,849 INFO L226 Difference]: Without dead ends: 778 [2019-10-14 23:13:55,850 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:13:55,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-10-14 23:13:55,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 776. [2019-10-14 23:13:55,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-10-14 23:13:55,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1110 transitions. [2019-10-14 23:13:55,875 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1110 transitions. Word has length 22 [2019-10-14 23:13:55,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:55,875 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1110 transitions. [2019-10-14 23:13:55,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:55,876 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1110 transitions. [2019-10-14 23:13:55,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-14 23:13:55,877 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:55,877 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:55,878 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:55,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:55,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1221411293, now seen corresponding path program 1 times [2019-10-14 23:13:55,878 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:55,878 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517044685] [2019-10-14 23:13:55,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,900 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-14 23:13:55,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517044685] [2019-10-14 23:13:55,901 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:55,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:55,901 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219721437] [2019-10-14 23:13:55,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:55,902 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:55,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:55,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:55,902 INFO L87 Difference]: Start difference. First operand 776 states and 1110 transitions. Second operand 3 states. [2019-10-14 23:13:55,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:55,942 INFO L93 Difference]: Finished difference Result 1164 states and 1656 transitions. [2019-10-14 23:13:55,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:55,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-14 23:13:55,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:55,947 INFO L225 Difference]: With dead ends: 1164 [2019-10-14 23:13:55,948 INFO L226 Difference]: Without dead ends: 794 [2019-10-14 23:13:55,949 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:13:55,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-10-14 23:13:55,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 792. [2019-10-14 23:13:55,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2019-10-14 23:13:55,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1110 transitions. [2019-10-14 23:13:55,979 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1110 transitions. Word has length 23 [2019-10-14 23:13:55,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:55,980 INFO L462 AbstractCegarLoop]: Abstraction has 792 states and 1110 transitions. [2019-10-14 23:13:55,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:55,980 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1110 transitions. [2019-10-14 23:13:55,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-14 23:13:55,982 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:55,982 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:55,983 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:55,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:55,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1479576731, now seen corresponding path program 1 times [2019-10-14 23:13:55,983 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:55,984 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676058312] [2019-10-14 23:13:55,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,008 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-14 23:13:56,008 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676058312] [2019-10-14 23:13:56,009 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:56,009 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:56,009 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673231807] [2019-10-14 23:13:56,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:56,010 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:56,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:56,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:56,011 INFO L87 Difference]: Start difference. First operand 792 states and 1110 transitions. Second operand 3 states. [2019-10-14 23:13:56,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:56,044 INFO L93 Difference]: Finished difference Result 1356 states and 1928 transitions. [2019-10-14 23:13:56,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:56,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-14 23:13:56,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:56,052 INFO L225 Difference]: With dead ends: 1356 [2019-10-14 23:13:56,053 INFO L226 Difference]: Without dead ends: 1354 [2019-10-14 23:13:56,054 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:13:56,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-10-14 23:13:56,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1160. [2019-10-14 23:13:56,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2019-10-14 23:13:56,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1574 transitions. [2019-10-14 23:13:56,130 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1574 transitions. Word has length 23 [2019-10-14 23:13:56,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:56,130 INFO L462 AbstractCegarLoop]: Abstraction has 1160 states and 1574 transitions. [2019-10-14 23:13:56,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:56,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1574 transitions. [2019-10-14 23:13:56,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-14 23:13:56,133 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:56,134 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:56,134 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:56,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:56,134 INFO L82 PathProgramCache]: Analyzing trace with hash -2114325987, now seen corresponding path program 1 times [2019-10-14 23:13:56,135 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:56,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515366076] [2019-10-14 23:13:56,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,156 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-14 23:13:56,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515366076] [2019-10-14 23:13:56,157 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:56,157 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:56,157 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773339538] [2019-10-14 23:13:56,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:56,158 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:56,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:56,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:56,158 INFO L87 Difference]: Start difference. First operand 1160 states and 1574 transitions. Second operand 3 states. [2019-10-14 23:13:56,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:56,213 INFO L93 Difference]: Finished difference Result 2636 states and 3560 transitions. [2019-10-14 23:13:56,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:56,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-14 23:13:56,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:56,224 INFO L225 Difference]: With dead ends: 2636 [2019-10-14 23:13:56,224 INFO L226 Difference]: Without dead ends: 1514 [2019-10-14 23:13:56,227 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:13:56,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2019-10-14 23:13:56,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1512. [2019-10-14 23:13:56,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1512 states. [2019-10-14 23:13:56,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1990 transitions. [2019-10-14 23:13:56,289 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1990 transitions. Word has length 23 [2019-10-14 23:13:56,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:56,289 INFO L462 AbstractCegarLoop]: Abstraction has 1512 states and 1990 transitions. [2019-10-14 23:13:56,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:56,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1990 transitions. [2019-10-14 23:13:56,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 23:13:56,293 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:56,294 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:56,294 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:56,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:56,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1377545862, now seen corresponding path program 1 times [2019-10-14 23:13:56,295 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:56,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122460208] [2019-10-14 23:13:56,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,321 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-14 23:13:56,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122460208] [2019-10-14 23:13:56,321 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:56,321 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:56,322 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849734948] [2019-10-14 23:13:56,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:56,322 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:56,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:56,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:56,323 INFO L87 Difference]: Start difference. First operand 1512 states and 1990 transitions. Second operand 3 states. [2019-10-14 23:13:56,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:56,375 INFO L93 Difference]: Finished difference Result 2268 states and 2968 transitions. [2019-10-14 23:13:56,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:56,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-14 23:13:56,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:56,386 INFO L225 Difference]: With dead ends: 2268 [2019-10-14 23:13:56,386 INFO L226 Difference]: Without dead ends: 1546 [2019-10-14 23:13:56,389 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:13:56,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2019-10-14 23:13:56,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1544. [2019-10-14 23:13:56,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2019-10-14 23:13:56,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1990 transitions. [2019-10-14 23:13:56,456 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1990 transitions. Word has length 24 [2019-10-14 23:13:56,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:56,456 INFO L462 AbstractCegarLoop]: Abstraction has 1544 states and 1990 transitions. [2019-10-14 23:13:56,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:56,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1990 transitions. [2019-10-14 23:13:56,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 23:13:56,459 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:56,459 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:56,459 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:56,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:56,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1119380424, now seen corresponding path program 1 times [2019-10-14 23:13:56,460 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:56,460 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85712952] [2019-10-14 23:13:56,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:56,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,487 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-14 23:13:56,488 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85712952] [2019-10-14 23:13:56,488 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:56,489 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:56,489 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617617520] [2019-10-14 23:13:56,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:56,490 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:56,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:56,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:56,490 INFO L87 Difference]: Start difference. First operand 1544 states and 1990 transitions. Second operand 3 states. [2019-10-14 23:13:56,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:56,553 INFO L93 Difference]: Finished difference Result 2572 states and 3336 transitions. [2019-10-14 23:13:56,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:56,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-14 23:13:56,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:56,565 INFO L225 Difference]: With dead ends: 2572 [2019-10-14 23:13:56,565 INFO L226 Difference]: Without dead ends: 2570 [2019-10-14 23:13:56,566 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:13:56,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2019-10-14 23:13:56,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2312. [2019-10-14 23:13:56,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2019-10-14 23:13:56,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 2886 transitions. [2019-10-14 23:13:56,635 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 2886 transitions. Word has length 24 [2019-10-14 23:13:56,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:56,635 INFO L462 AbstractCegarLoop]: Abstraction has 2312 states and 2886 transitions. [2019-10-14 23:13:56,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:56,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2886 transitions. [2019-10-14 23:13:56,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 23:13:56,640 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:56,640 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:56,640 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:56,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:56,641 INFO L82 PathProgramCache]: Analyzing trace with hash -418315846, now seen corresponding path program 1 times [2019-10-14 23:13:56,641 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:56,641 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976445653] [2019-10-14 23:13:56,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,661 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-14 23:13:56,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976445653] [2019-10-14 23:13:56,662 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:56,662 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:56,663 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739430979] [2019-10-14 23:13:56,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:56,663 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:56,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:56,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:56,664 INFO L87 Difference]: Start difference. First operand 2312 states and 2886 transitions. Second operand 3 states. [2019-10-14 23:13:56,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:56,754 INFO L93 Difference]: Finished difference Result 5196 states and 6408 transitions. [2019-10-14 23:13:56,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:56,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-14 23:13:56,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:56,768 INFO L225 Difference]: With dead ends: 5196 [2019-10-14 23:13:56,768 INFO L226 Difference]: Without dead ends: 2954 [2019-10-14 23:13:56,773 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:13:56,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2019-10-14 23:13:56,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2952. [2019-10-14 23:13:56,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2019-10-14 23:13:56,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 3526 transitions. [2019-10-14 23:13:56,871 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 3526 transitions. Word has length 24 [2019-10-14 23:13:56,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:56,871 INFO L462 AbstractCegarLoop]: Abstraction has 2952 states and 3526 transitions. [2019-10-14 23:13:56,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:56,871 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 3526 transitions. [2019-10-14 23:13:56,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 23:13:56,876 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:56,877 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:56,877 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:56,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:56,877 INFO L82 PathProgramCache]: Analyzing trace with hash -340838702, now seen corresponding path program 1 times [2019-10-14 23:13:56,878 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:56,878 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718579324] [2019-10-14 23:13:56,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,894 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-14 23:13:56,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718579324] [2019-10-14 23:13:56,895 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:56,895 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:56,895 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92728891] [2019-10-14 23:13:56,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:56,896 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:56,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:56,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:56,897 INFO L87 Difference]: Start difference. First operand 2952 states and 3526 transitions. Second operand 3 states. [2019-10-14 23:13:56,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:56,953 INFO L93 Difference]: Finished difference Result 4428 states and 5256 transitions. [2019-10-14 23:13:56,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:56,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-14 23:13:56,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:56,967 INFO L225 Difference]: With dead ends: 4428 [2019-10-14 23:13:56,968 INFO L226 Difference]: Without dead ends: 3018 [2019-10-14 23:13:56,971 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:13:56,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2019-10-14 23:13:57,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3016. [2019-10-14 23:13:57,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2019-10-14 23:13:57,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3526 transitions. [2019-10-14 23:13:57,063 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3526 transitions. Word has length 25 [2019-10-14 23:13:57,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:57,063 INFO L462 AbstractCegarLoop]: Abstraction has 3016 states and 3526 transitions. [2019-10-14 23:13:57,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:57,063 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3526 transitions. [2019-10-14 23:13:57,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 23:13:57,068 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:57,068 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:57,069 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:57,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:57,069 INFO L82 PathProgramCache]: Analyzing trace with hash -82673264, now seen corresponding path program 1 times [2019-10-14 23:13:57,069 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:57,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203312037] [2019-10-14 23:13:57,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:57,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:57,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:57,086 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-14 23:13:57,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203312037] [2019-10-14 23:13:57,086 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:57,087 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:57,087 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185916234] [2019-10-14 23:13:57,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:57,087 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:57,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:57,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:57,088 INFO L87 Difference]: Start difference. First operand 3016 states and 3526 transitions. Second operand 3 states. [2019-10-14 23:13:57,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:57,204 INFO L93 Difference]: Finished difference Result 8650 states and 9799 transitions. [2019-10-14 23:13:57,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:57,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-14 23:13:57,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:57,219 INFO L225 Difference]: With dead ends: 8650 [2019-10-14 23:13:57,219 INFO L226 Difference]: Without dead ends: 3016 [2019-10-14 23:13:57,228 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:13:57,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2019-10-14 23:13:57,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 3016. [2019-10-14 23:13:57,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2019-10-14 23:13:57,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3270 transitions. [2019-10-14 23:13:57,316 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3270 transitions. Word has length 25 [2019-10-14 23:13:57,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:57,316 INFO L462 AbstractCegarLoop]: Abstraction has 3016 states and 3270 transitions. [2019-10-14 23:13:57,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:57,316 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3270 transitions. [2019-10-14 23:13:57,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 23:13:57,321 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:57,321 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:57,321 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:57,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:57,322 INFO L82 PathProgramCache]: Analyzing trace with hash -783737842, now seen corresponding path program 1 times [2019-10-14 23:13:57,322 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:57,322 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873274642] [2019-10-14 23:13:57,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:57,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:57,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:57,340 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-14 23:13:57,340 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873274642] [2019-10-14 23:13:57,340 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:57,340 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:57,341 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479473071] [2019-10-14 23:13:57,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:57,341 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:57,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:57,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:57,342 INFO L87 Difference]: Start difference. First operand 3016 states and 3270 transitions. Second operand 3 states. [2019-10-14 23:13:57,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:57,383 INFO L93 Difference]: Finished difference Result 3016 states and 3270 transitions. [2019-10-14 23:13:57,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:57,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-14 23:13:57,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:57,384 INFO L225 Difference]: With dead ends: 3016 [2019-10-14 23:13:57,384 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:13:57,389 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:13:57,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:13:57,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:13:57,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:13:57,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:13:57,390 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-10-14 23:13:57,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:57,390 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:13:57,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:57,390 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:13:57,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:13:57,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:13:57,413 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-14 23:13:57,414 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:13:57,414 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:13:57,414 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-14 23:13:57,414 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:13:57,414 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:13:57,414 INFO L443 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-10-14 23:13:57,414 INFO L439 ceAbstractionStarter]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2019-10-14 23:13:57,414 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 33 130) no Hoare annotation was computed. [2019-10-14 23:13:57,415 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 135) no Hoare annotation was computed. [2019-10-14 23:13:57,415 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2019-10-14 23:13:57,415 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2019-10-14 23:13:57,415 INFO L443 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-10-14 23:13:57,415 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2019-10-14 23:13:57,415 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2019-10-14 23:13:57,415 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 135) no Hoare annotation was computed. [2019-10-14 23:13:57,416 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-10-14 23:13:57,416 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2019-10-14 23:13:57,416 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-10-14 23:13:57,416 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 33 130) no Hoare annotation was computed. [2019-10-14 23:13:57,416 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2019-10-14 23:13:57,416 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 33 130) no Hoare annotation was computed. [2019-10-14 23:13:57,416 INFO L443 ceAbstractionStarter]: For program point L64-1(lines 33 130) no Hoare annotation was computed. [2019-10-14 23:13:57,416 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2019-10-14 23:13:57,417 INFO L443 ceAbstractionStarter]: For program point L56-2(lines 33 130) no Hoare annotation was computed. [2019-10-14 23:13:57,417 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-10-14 23:13:57,417 INFO L446 ceAbstractionStarter]: At program point L131(lines 5 135) the Hoare annotation is: true [2019-10-14 23:13:57,417 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2019-10-14 23:13:57,417 INFO L443 ceAbstractionStarter]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2019-10-14 23:13:57,417 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-10-14 23:13:57,417 INFO L443 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2019-10-14 23:13:57,417 INFO L443 ceAbstractionStarter]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2019-10-14 23:13:57,418 INFO L446 ceAbstractionStarter]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2019-10-14 23:13:57,418 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2019-10-14 23:13:57,418 INFO L443 ceAbstractionStarter]: For program point L76-1(lines 33 130) no Hoare annotation was computed. [2019-10-14 23:13:57,418 INFO L443 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2019-10-14 23:13:57,418 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2019-10-14 23:13:57,418 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 33 130) no Hoare annotation was computed. [2019-10-14 23:13:57,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:13:57 BoogieIcfgContainer [2019-10-14 23:13:57,427 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 23:13:57,429 INFO L168 Benchmark]: Toolchain (without parser) took 4174.15 ms. Allocated memory was 146.3 MB in the beginning and 289.9 MB in the end (delta: 143.7 MB). Free memory was 103.4 MB in the beginning and 179.6 MB in the end (delta: -76.2 MB). Peak memory consumption was 67.4 MB. Max. memory is 7.1 GB. [2019-10-14 23:13:57,430 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-14 23:13:57,431 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.48 ms. Allocated memory is still 146.3 MB. Free memory was 103.2 MB in the beginning and 92.8 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2019-10-14 23:13:57,432 INFO L168 Benchmark]: Boogie Preprocessor took 127.32 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 92.8 MB in the beginning and 180.7 MB in the end (delta: -87.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-10-14 23:13:57,432 INFO L168 Benchmark]: RCFGBuilder took 373.33 ms. Allocated memory is still 202.9 MB. Free memory was 180.7 MB in the beginning and 164.3 MB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 7.1 GB. [2019-10-14 23:13:57,433 INFO L168 Benchmark]: TraceAbstraction took 3397.76 ms. Allocated memory was 202.9 MB in the beginning and 289.9 MB in the end (delta: 87.0 MB). Free memory was 163.6 MB in the beginning and 179.6 MB in the end (delta: -16.0 MB). Peak memory consumption was 71.0 MB. Max. memory is 7.1 GB. [2019-10-14 23:13:57,436 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.45 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 271.48 ms. Allocated memory is still 146.3 MB. Free memory was 103.2 MB in the beginning and 92.8 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.32 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 92.8 MB in the beginning and 180.7 MB in the end (delta: -87.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 373.33 ms. Allocated memory is still 202.9 MB. Free memory was 180.7 MB in the beginning and 164.3 MB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3397.76 ms. Allocated memory was 202.9 MB in the beginning and 289.9 MB in the end (delta: 87.0 MB). Free memory was 163.6 MB in the beginning and 179.6 MB in the end (delta: -16.0 MB). Peak memory consumption was 71.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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: 33]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 1 error locations. Result: SAFE, OverallTime: 3.3s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1573 SDtfs, 755 SDslu, 1056 SDs, 0 SdLazy, 121 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3016occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 23 MinimizatonAttempts, 790 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 266 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 498 NumberOfCodeBlocks, 498 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 19027 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...