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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:44:39,998 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:44:40,000 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:44:40,011 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:44:40,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:44:40,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:44:40,014 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:44:40,016 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:44:40,018 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:44:40,018 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:44:40,019 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:44:40,021 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:44:40,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:44:40,025 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:44:40,026 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:44:40,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:44:40,031 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:44:40,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:44:40,038 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:44:40,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:44:40,047 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:44:40,048 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:44:40,050 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:44:40,051 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:44:40,056 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:44:40,056 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:44:40,056 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:44:40,059 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:44:40,059 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:44:40,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:44:40,062 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:44:40,063 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:44:40,064 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:44:40,065 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:44:40,067 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:44:40,067 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:44:40,068 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:44:40,071 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:44:40,071 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:44:40,072 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:44:40,073 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:44:40,074 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:44:40,100 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:44:40,100 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:44:40,102 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:44:40,102 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:44:40,102 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:44:40,102 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:44:40,103 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:44:40,103 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:44:40,103 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:44:40,103 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:44:40,104 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:44:40,104 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:44:40,104 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:44:40,104 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:44:40,104 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:44:40,105 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:44:40,105 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:44:40,105 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:44:40,105 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:44:40,106 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:44:40,106 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:44:40,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:44:40,106 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:44:40,107 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:44:40,107 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:44:40,107 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:44:40,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:44:40,107 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:44:40,108 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:44:40,412 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:44:40,430 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:44:40,434 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:44:40,435 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:44:40,435 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:44:40,436 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-14 23:44:40,510 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d86026c5/ecff29448e004dee9760e3466447a740/FLAG6161b5bca [2019-10-14 23:44:40,991 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:44:40,992 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-14 23:44:41,004 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d86026c5/ecff29448e004dee9760e3466447a740/FLAG6161b5bca [2019-10-14 23:44:41,327 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d86026c5/ecff29448e004dee9760e3466447a740 [2019-10-14 23:44:41,337 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:44:41,339 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:44:41,340 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:44:41,340 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:44:41,344 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:44:41,345 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:44:41" (1/1) ... [2019-10-14 23:44:41,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52390252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:41, skipping insertion in model container [2019-10-14 23:44:41,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:44:41" (1/1) ... [2019-10-14 23:44:41,357 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:44:41,420 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:44:41,681 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:44:41,697 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:44:41,882 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:44:41,903 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:44:41,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:41 WrapperNode [2019-10-14 23:44:41,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:44:41,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:44:41,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:44:41,905 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:44:41,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:41" (1/1) ... [2019-10-14 23:44:41,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:41" (1/1) ... [2019-10-14 23:44:41,926 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:41" (1/1) ... [2019-10-14 23:44:41,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:41" (1/1) ... [2019-10-14 23:44:41,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:41" (1/1) ... [2019-10-14 23:44:41,953 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:41" (1/1) ... [2019-10-14 23:44:41,957 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:41" (1/1) ... [2019-10-14 23:44:41,963 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:44:41,963 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:44:41,964 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:44:41,964 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:44:41,965 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:41" (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:44:42,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:44:42,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:44:42,027 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:44:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:44:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-14 23:44:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-14 23:44:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-14 23:44:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-14 23:44:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 23:44:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-14 23:44:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-14 23:44:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-14 23:44:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-14 23:44:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-14 23:44:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-14 23:44:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-14 23:44:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:44:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:44:42,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:44:42,865 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:44:42,866 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-14 23:44:42,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:44:42 BoogieIcfgContainer [2019-10-14 23:44:42,867 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:44:42,869 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:44:42,869 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:44:42,872 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:44:42,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:44:41" (1/3) ... [2019-10-14 23:44:42,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770a9d30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:44:42, skipping insertion in model container [2019-10-14 23:44:42,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:41" (2/3) ... [2019-10-14 23:44:42,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770a9d30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:44:42, skipping insertion in model container [2019-10-14 23:44:42,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:44:42" (3/3) ... [2019-10-14 23:44:42,876 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-14 23:44:42,885 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:44:42,894 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:44:42,907 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:44:42,937 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:44:42,937 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:44:42,937 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:44:42,937 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:44:42,938 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:44:42,938 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:44:42,938 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:44:42,938 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:44:42,958 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-10-14 23:44:42,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-14 23:44:42,967 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:42,968 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, 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, 1, 1] [2019-10-14 23:44:42,970 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:42,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:42,977 INFO L82 PathProgramCache]: Analyzing trace with hash -276696918, now seen corresponding path program 1 times [2019-10-14 23:44:42,986 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:42,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963099705] [2019-10-14 23:44:42,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:42,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:42,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:43,539 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-10-14 23:44:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:43,610 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:44:43,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963099705] [2019-10-14 23:44:43,612 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:43,612 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:44:43,613 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019054903] [2019-10-14 23:44:43,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:44:43,620 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:43,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:44:43,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:44:43,639 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 7 states. [2019-10-14 23:44:43,839 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-10-14 23:44:44,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:44,882 INFO L93 Difference]: Finished difference Result 721 states and 1142 transitions. [2019-10-14 23:44:44,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 23:44:44,884 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-10-14 23:44:44,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:44,905 INFO L225 Difference]: With dead ends: 721 [2019-10-14 23:44:44,905 INFO L226 Difference]: Without dead ends: 630 [2019-10-14 23:44:44,910 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-10-14 23:44:44,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-14 23:44:45,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 423. [2019-10-14 23:44:45,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-10-14 23:44:45,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 647 transitions. [2019-10-14 23:44:45,006 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 647 transitions. Word has length 52 [2019-10-14 23:44:45,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:45,007 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 647 transitions. [2019-10-14 23:44:45,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:44:45,007 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 647 transitions. [2019-10-14 23:44:45,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-14 23:44:45,010 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:45,010 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, 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, 1, 1, 1, 1, 1] [2019-10-14 23:44:45,010 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:45,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:45,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1087729035, now seen corresponding path program 1 times [2019-10-14 23:44:45,011 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:45,011 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971911617] [2019-10-14 23:44:45,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:45,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:45,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:45,249 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-10-14 23:44:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:45,267 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:44:45,267 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971911617] [2019-10-14 23:44:45,267 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:45,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:44:45,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420974954] [2019-10-14 23:44:45,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:44:45,270 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:45,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:44:45,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:44:45,271 INFO L87 Difference]: Start difference. First operand 423 states and 647 transitions. Second operand 4 states. [2019-10-14 23:44:45,408 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-10-14 23:44:45,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:45,894 INFO L93 Difference]: Finished difference Result 1104 states and 1713 transitions. [2019-10-14 23:44:45,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:44:45,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-10-14 23:44:45,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:45,900 INFO L225 Difference]: With dead ends: 1104 [2019-10-14 23:44:45,901 INFO L226 Difference]: Without dead ends: 748 [2019-10-14 23:44:45,904 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:44:45,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-10-14 23:44:45,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 746. [2019-10-14 23:44:45,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-10-14 23:44:45,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1138 transitions. [2019-10-14 23:44:45,976 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1138 transitions. Word has length 55 [2019-10-14 23:44:45,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:45,977 INFO L462 AbstractCegarLoop]: Abstraction has 746 states and 1138 transitions. [2019-10-14 23:44:45,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:44:45,977 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1138 transitions. [2019-10-14 23:44:45,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-14 23:44:45,986 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:45,986 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, 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, 1, 1, 1, 1, 1] [2019-10-14 23:44:45,986 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:45,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:45,987 INFO L82 PathProgramCache]: Analyzing trace with hash 917757431, now seen corresponding path program 1 times [2019-10-14 23:44:45,987 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:45,989 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169895108] [2019-10-14 23:44:45,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:45,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:45,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:46,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:46,211 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:44:46,212 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169895108] [2019-10-14 23:44:46,212 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:46,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:44:46,213 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137473472] [2019-10-14 23:44:46,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:44:46,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:46,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:44:46,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:44:46,214 INFO L87 Difference]: Start difference. First operand 746 states and 1138 transitions. Second operand 4 states. [2019-10-14 23:44:46,358 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-10-14 23:44:46,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:46,838 INFO L93 Difference]: Finished difference Result 2006 states and 3079 transitions. [2019-10-14 23:44:46,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:44:46,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-10-14 23:44:46,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:46,846 INFO L225 Difference]: With dead ends: 2006 [2019-10-14 23:44:46,847 INFO L226 Difference]: Without dead ends: 1335 [2019-10-14 23:44:46,849 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:44:46,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-10-14 23:44:46,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1333. [2019-10-14 23:44:46,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1333 states. [2019-10-14 23:44:46,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 2001 transitions. [2019-10-14 23:44:46,914 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 2001 transitions. Word has length 55 [2019-10-14 23:44:46,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:46,914 INFO L462 AbstractCegarLoop]: Abstraction has 1333 states and 2001 transitions. [2019-10-14 23:44:46,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:44:46,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 2001 transitions. [2019-10-14 23:44:46,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-14 23:44:46,917 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:46,917 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, 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, 1, 1, 1, 1, 1, 1] [2019-10-14 23:44:46,917 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:46,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:46,918 INFO L82 PathProgramCache]: Analyzing trace with hash -41555275, now seen corresponding path program 1 times [2019-10-14 23:44:46,918 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:46,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23695444] [2019-10-14 23:44:46,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:46,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:46,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:46,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:47,230 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:44:47,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23695444] [2019-10-14 23:44:47,231 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:47,231 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:44:47,231 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965359239] [2019-10-14 23:44:47,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-14 23:44:47,232 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:47,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-14 23:44:47,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:44:47,233 INFO L87 Difference]: Start difference. First operand 1333 states and 2001 transitions. Second operand 11 states. [2019-10-14 23:44:47,432 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-10-14 23:44:50,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:50,250 INFO L93 Difference]: Finished difference Result 7842 states and 11792 transitions. [2019-10-14 23:44:50,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-14 23:44:50,251 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-10-14 23:44:50,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:50,294 INFO L225 Difference]: With dead ends: 7842 [2019-10-14 23:44:50,294 INFO L226 Difference]: Without dead ends: 7341 [2019-10-14 23:44:50,298 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=451, Unknown=0, NotChecked=0, Total=650 [2019-10-14 23:44:50,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7341 states. [2019-10-14 23:44:50,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7341 to 1358. [2019-10-14 23:44:50,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1358 states. [2019-10-14 23:44:50,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 2033 transitions. [2019-10-14 23:44:50,462 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 2033 transitions. Word has length 56 [2019-10-14 23:44:50,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:50,463 INFO L462 AbstractCegarLoop]: Abstraction has 1358 states and 2033 transitions. [2019-10-14 23:44:50,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-14 23:44:50,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 2033 transitions. [2019-10-14 23:44:50,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-14 23:44:50,465 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:50,466 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:44:50,466 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:50,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:50,468 INFO L82 PathProgramCache]: Analyzing trace with hash -742667424, now seen corresponding path program 1 times [2019-10-14 23:44:50,468 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:50,469 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252783030] [2019-10-14 23:44:50,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:50,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:50,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:50,710 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-10-14 23:44:50,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:50,728 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:44:50,729 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252783030] [2019-10-14 23:44:50,729 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:50,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:44:50,730 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255078479] [2019-10-14 23:44:50,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 23:44:50,730 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:50,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 23:44:50,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:44:50,731 INFO L87 Difference]: Start difference. First operand 1358 states and 2033 transitions. Second operand 8 states. [2019-10-14 23:44:52,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:52,113 INFO L93 Difference]: Finished difference Result 5747 states and 8758 transitions. [2019-10-14 23:44:52,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 23:44:52,113 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-10-14 23:44:52,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:52,142 INFO L225 Difference]: With dead ends: 5747 [2019-10-14 23:44:52,142 INFO L226 Difference]: Without dead ends: 5246 [2019-10-14 23:44:52,145 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-10-14 23:44:52,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5246 states. [2019-10-14 23:44:52,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5246 to 1339. [2019-10-14 23:44:52,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2019-10-14 23:44:52,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2009 transitions. [2019-10-14 23:44:52,297 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2009 transitions. Word has length 57 [2019-10-14 23:44:52,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:52,297 INFO L462 AbstractCegarLoop]: Abstraction has 1339 states and 2009 transitions. [2019-10-14 23:44:52,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 23:44:52,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2009 transitions. [2019-10-14 23:44:52,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-14 23:44:52,299 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:52,299 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:44:52,299 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:52,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:52,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1896016447, now seen corresponding path program 1 times [2019-10-14 23:44:52,300 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:52,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900985976] [2019-10-14 23:44:52,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:52,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:52,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:52,547 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:44:52,547 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900985976] [2019-10-14 23:44:52,548 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:52,549 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 23:44:52,552 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416433247] [2019-10-14 23:44:52,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:44:52,553 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:52,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:44:52,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:44:52,560 INFO L87 Difference]: Start difference. First operand 1339 states and 2009 transitions. Second operand 10 states. [2019-10-14 23:44:52,751 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-10-14 23:44:55,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:55,653 INFO L93 Difference]: Finished difference Result 8481 states and 12775 transitions. [2019-10-14 23:44:55,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-14 23:44:55,654 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-10-14 23:44:55,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:55,690 INFO L225 Difference]: With dead ends: 8481 [2019-10-14 23:44:55,690 INFO L226 Difference]: Without dead ends: 7351 [2019-10-14 23:44:55,695 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2019-10-14 23:44:55,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7351 states. [2019-10-14 23:44:55,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7351 to 1378. [2019-10-14 23:44:55,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1378 states. [2019-10-14 23:44:55,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 2060 transitions. [2019-10-14 23:44:55,890 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 2060 transitions. Word has length 57 [2019-10-14 23:44:55,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:55,891 INFO L462 AbstractCegarLoop]: Abstraction has 1378 states and 2060 transitions. [2019-10-14 23:44:55,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:44:55,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 2060 transitions. [2019-10-14 23:44:55,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-14 23:44:55,894 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:55,894 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:44:55,894 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:55,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:55,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1439125625, now seen corresponding path program 1 times [2019-10-14 23:44:55,895 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:55,895 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802512969] [2019-10-14 23:44:55,895 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:55,896 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:55,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:56,147 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:44:56,147 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802512969] [2019-10-14 23:44:56,148 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:56,148 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:44:56,148 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896331911] [2019-10-14 23:44:56,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 23:44:56,150 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:56,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 23:44:56,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:44:56,151 INFO L87 Difference]: Start difference. First operand 1378 states and 2060 transitions. Second operand 8 states. [2019-10-14 23:44:57,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:57,537 INFO L93 Difference]: Finished difference Result 5650 states and 8490 transitions. [2019-10-14 23:44:57,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 23:44:57,537 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-10-14 23:44:57,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:57,567 INFO L225 Difference]: With dead ends: 5650 [2019-10-14 23:44:57,567 INFO L226 Difference]: Without dead ends: 4520 [2019-10-14 23:44:57,573 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-10-14 23:44:57,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4520 states. [2019-10-14 23:44:57,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4520 to 1359. [2019-10-14 23:44:57,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1359 states. [2019-10-14 23:44:57,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 2033 transitions. [2019-10-14 23:44:57,770 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 2033 transitions. Word has length 58 [2019-10-14 23:44:57,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:57,771 INFO L462 AbstractCegarLoop]: Abstraction has 1359 states and 2033 transitions. [2019-10-14 23:44:57,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 23:44:57,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 2033 transitions. [2019-10-14 23:44:57,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-14 23:44:57,772 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:57,772 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:44:57,773 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:57,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:57,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1839206206, now seen corresponding path program 1 times [2019-10-14 23:44:57,773 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:57,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900934293] [2019-10-14 23:44:57,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:57,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:57,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:58,015 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:44:58,015 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900934293] [2019-10-14 23:44:58,015 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:58,015 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 23:44:58,016 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059247235] [2019-10-14 23:44:58,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:44:58,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:58,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:44:58,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:44:58,017 INFO L87 Difference]: Start difference. First operand 1359 states and 2033 transitions. Second operand 10 states. [2019-10-14 23:45:00,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:00,147 INFO L93 Difference]: Finished difference Result 7327 states and 11032 transitions. [2019-10-14 23:45:00,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 23:45:00,148 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-10-14 23:45:00,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:00,164 INFO L225 Difference]: With dead ends: 7327 [2019-10-14 23:45:00,164 INFO L226 Difference]: Without dead ends: 6095 [2019-10-14 23:45:00,169 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2019-10-14 23:45:00,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6095 states. [2019-10-14 23:45:00,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6095 to 3782. [2019-10-14 23:45:00,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3782 states. [2019-10-14 23:45:00,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3782 states to 3782 states and 5672 transitions. [2019-10-14 23:45:00,607 INFO L78 Accepts]: Start accepts. Automaton has 3782 states and 5672 transitions. Word has length 58 [2019-10-14 23:45:00,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:00,608 INFO L462 AbstractCegarLoop]: Abstraction has 3782 states and 5672 transitions. [2019-10-14 23:45:00,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:45:00,608 INFO L276 IsEmpty]: Start isEmpty. Operand 3782 states and 5672 transitions. [2019-10-14 23:45:00,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-14 23:45:00,610 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:00,610 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:00,611 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:00,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:00,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1369199573, now seen corresponding path program 1 times [2019-10-14 23:45:00,611 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:00,611 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556136470] [2019-10-14 23:45:00,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:00,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:00,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:00,843 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:45:00,844 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556136470] [2019-10-14 23:45:00,844 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:00,844 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 23:45:00,844 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108475237] [2019-10-14 23:45:00,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:45:00,845 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:00,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:45:00,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:45:00,846 INFO L87 Difference]: Start difference. First operand 3782 states and 5672 transitions. Second operand 10 states. [2019-10-14 23:45:03,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:03,868 INFO L93 Difference]: Finished difference Result 19307 states and 28995 transitions. [2019-10-14 23:45:03,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 23:45:03,868 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-10-14 23:45:03,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:03,903 INFO L225 Difference]: With dead ends: 19307 [2019-10-14 23:45:03,903 INFO L226 Difference]: Without dead ends: 15977 [2019-10-14 23:45:03,913 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2019-10-14 23:45:03,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15977 states. [2019-10-14 23:45:05,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15977 to 11695. [2019-10-14 23:45:05,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11695 states. [2019-10-14 23:45:05,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11695 states to 11695 states and 17676 transitions. [2019-10-14 23:45:05,246 INFO L78 Accepts]: Start accepts. Automaton has 11695 states and 17676 transitions. Word has length 58 [2019-10-14 23:45:05,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:05,246 INFO L462 AbstractCegarLoop]: Abstraction has 11695 states and 17676 transitions. [2019-10-14 23:45:05,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:45:05,247 INFO L276 IsEmpty]: Start isEmpty. Operand 11695 states and 17676 transitions. [2019-10-14 23:45:05,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-14 23:45:05,255 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:05,255 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:05,255 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:05,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:05,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1177047496, now seen corresponding path program 1 times [2019-10-14 23:45:05,256 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:05,256 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561053814] [2019-10-14 23:45:05,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:05,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:05,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:05,443 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:45:05,446 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561053814] [2019-10-14 23:45:05,446 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:05,446 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:45:05,447 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105638398] [2019-10-14 23:45:05,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:45:05,448 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:05,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:45:05,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:45:05,449 INFO L87 Difference]: Start difference. First operand 11695 states and 17676 transitions. Second operand 7 states. [2019-10-14 23:45:07,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:07,710 INFO L93 Difference]: Finished difference Result 26750 states and 40687 transitions. [2019-10-14 23:45:07,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:45:07,711 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-10-14 23:45:07,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:07,738 INFO L225 Difference]: With dead ends: 26750 [2019-10-14 23:45:07,738 INFO L226 Difference]: Without dead ends: 16014 [2019-10-14 23:45:07,758 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:45:07,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16014 states. [2019-10-14 23:45:08,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16014 to 9824. [2019-10-14 23:45:08,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9824 states. [2019-10-14 23:45:08,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9824 states to 9824 states and 14759 transitions. [2019-10-14 23:45:08,848 INFO L78 Accepts]: Start accepts. Automaton has 9824 states and 14759 transitions. Word has length 59 [2019-10-14 23:45:08,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:08,848 INFO L462 AbstractCegarLoop]: Abstraction has 9824 states and 14759 transitions. [2019-10-14 23:45:08,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:45:08,848 INFO L276 IsEmpty]: Start isEmpty. Operand 9824 states and 14759 transitions. [2019-10-14 23:45:08,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-14 23:45:08,851 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:08,851 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:08,851 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:08,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:08,851 INFO L82 PathProgramCache]: Analyzing trace with hash -90485979, now seen corresponding path program 1 times [2019-10-14 23:45:08,852 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:08,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964167000] [2019-10-14 23:45:08,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:08,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:08,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:09,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:09,020 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964167000] [2019-10-14 23:45:09,020 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:09,020 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:45:09,020 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699923903] [2019-10-14 23:45:09,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:45:09,021 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:09,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:45:09,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:45:09,022 INFO L87 Difference]: Start difference. First operand 9824 states and 14759 transitions. Second operand 7 states. [2019-10-14 23:45:10,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:10,996 INFO L93 Difference]: Finished difference Result 20559 states and 30871 transitions. [2019-10-14 23:45:10,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:45:10,997 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-10-14 23:45:10,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:11,018 INFO L225 Difference]: With dead ends: 20559 [2019-10-14 23:45:11,019 INFO L226 Difference]: Without dead ends: 11316 [2019-10-14 23:45:11,034 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:45:11,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11316 states. [2019-10-14 23:45:12,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11316 to 7633. [2019-10-14 23:45:12,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7633 states. [2019-10-14 23:45:12,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7633 states to 7633 states and 11363 transitions. [2019-10-14 23:45:12,084 INFO L78 Accepts]: Start accepts. Automaton has 7633 states and 11363 transitions. Word has length 59 [2019-10-14 23:45:12,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:12,085 INFO L462 AbstractCegarLoop]: Abstraction has 7633 states and 11363 transitions. [2019-10-14 23:45:12,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:45:12,085 INFO L276 IsEmpty]: Start isEmpty. Operand 7633 states and 11363 transitions. [2019-10-14 23:45:12,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-14 23:45:12,087 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:12,087 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:12,088 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:12,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:12,088 INFO L82 PathProgramCache]: Analyzing trace with hash -226647092, now seen corresponding path program 1 times [2019-10-14 23:45:12,088 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:12,089 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642802834] [2019-10-14 23:45:12,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:12,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:12,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:12,260 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-10-14 23:45:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:12,278 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:45:12,279 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642802834] [2019-10-14 23:45:12,279 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:12,279 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:12,280 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309428603] [2019-10-14 23:45:12,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:45:12,281 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:12,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:45:12,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:45:12,282 INFO L87 Difference]: Start difference. First operand 7633 states and 11363 transitions. Second operand 6 states. [2019-10-14 23:45:12,448 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-10-14 23:45:14,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:14,507 INFO L93 Difference]: Finished difference Result 18447 states and 27375 transitions. [2019-10-14 23:45:14,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:45:14,507 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-10-14 23:45:14,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:14,529 INFO L225 Difference]: With dead ends: 18447 [2019-10-14 23:45:14,529 INFO L226 Difference]: Without dead ends: 10894 [2019-10-14 23:45:14,542 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:45:14,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10894 states. [2019-10-14 23:45:15,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10894 to 7633. [2019-10-14 23:45:15,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7633 states. [2019-10-14 23:45:15,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7633 states to 7633 states and 11259 transitions. [2019-10-14 23:45:15,486 INFO L78 Accepts]: Start accepts. Automaton has 7633 states and 11259 transitions. Word has length 59 [2019-10-14 23:45:15,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:15,486 INFO L462 AbstractCegarLoop]: Abstraction has 7633 states and 11259 transitions. [2019-10-14 23:45:15,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:45:15,487 INFO L276 IsEmpty]: Start isEmpty. Operand 7633 states and 11259 transitions. [2019-10-14 23:45:15,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-14 23:45:15,488 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:15,488 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:15,488 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:15,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:15,489 INFO L82 PathProgramCache]: Analyzing trace with hash 758768658, now seen corresponding path program 1 times [2019-10-14 23:45:15,489 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:15,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772129967] [2019-10-14 23:45:15,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:15,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:15,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:15,660 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:45:15,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772129967] [2019-10-14 23:45:15,661 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:15,661 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:45:15,662 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537923426] [2019-10-14 23:45:15,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:45:15,662 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:15,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:45:15,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:45:15,663 INFO L87 Difference]: Start difference. First operand 7633 states and 11259 transitions. Second operand 6 states. [2019-10-14 23:45:18,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:18,442 INFO L93 Difference]: Finished difference Result 20122 states and 29836 transitions. [2019-10-14 23:45:18,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:45:18,442 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-10-14 23:45:18,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted.