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_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:08:50,102 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:08:50,104 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:08:50,116 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:08:50,117 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:08:50,118 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:08:50,119 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:08:50,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:08:50,123 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:08:50,129 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:08:50,130 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:08:50,132 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:08:50,132 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:08:50,138 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:08:50,140 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:08:50,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:08:50,143 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:08:50,146 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:08:50,149 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:08:50,155 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:08:50,157 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:08:50,158 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:08:50,159 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:08:50,160 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:08:50,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:08:50,164 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:08:50,164 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:08:50,167 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:08:50,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:08:50,171 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:08:50,171 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:08:50,172 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:08:50,173 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:08:50,174 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:08:50,178 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:08:50,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:08:50,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:08:50,179 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:08:50,179 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:08:50,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:08:50,183 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:08:50,185 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-09-20 13:08:50,209 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:08:50,209 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:08:50,212 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 13:08:50,212 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 13:08:50,213 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 13:08:50,213 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:08:50,213 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:08:50,214 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 13:08:50,214 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:08:50,214 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:08:50,215 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:08:50,215 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:08:50,216 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:08:50,216 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:08:50,216 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:08:50,217 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 13:08:50,217 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:08:50,217 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:08:50,217 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:08:50,217 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 13:08:50,218 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 13:08:50,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:08:50,218 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:08:50,218 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:08:50,219 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 13:08:50,219 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 13:08:50,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:08:50,219 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 13:08:50,220 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:08:50,276 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:08:50,295 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:08:50,302 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:08:50,304 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:08:50,304 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:08:50,305 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-20 13:08:50,371 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4fc412bb/d48d8a5599a546c1a5803fa5413d27d6/FLAG662c84d80 [2019-09-20 13:08:50,856 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:08:50,857 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-20 13:08:50,871 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4fc412bb/d48d8a5599a546c1a5803fa5413d27d6/FLAG662c84d80 [2019-09-20 13:08:51,204 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4fc412bb/d48d8a5599a546c1a5803fa5413d27d6 [2019-09-20 13:08:51,214 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:08:51,216 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:08:51,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:08:51,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:08:51,221 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:08:51,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:08:51" (1/1) ... [2019-09-20 13:08:51,225 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27b2f843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:51, skipping insertion in model container [2019-09-20 13:08:51,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:08:51" (1/1) ... [2019-09-20 13:08:51,232 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:08:51,309 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:08:51,767 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:08:51,780 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:08:51,913 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:08:51,935 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:08:51,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:51 WrapperNode [2019-09-20 13:08:51,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:08:51,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:08:51,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:08:51,937 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:08:51,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:51" (1/1) ... [2019-09-20 13:08:51,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:51" (1/1) ... [2019-09-20 13:08:51,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:51" (1/1) ... [2019-09-20 13:08:51,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:51" (1/1) ... [2019-09-20 13:08:51,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:51" (1/1) ... [2019-09-20 13:08:51,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:51" (1/1) ... [2019-09-20 13:08:52,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:51" (1/1) ... [2019-09-20 13:08:52,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:08:52,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:08:52,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:08:52,012 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:08:52,013 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:08:52,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:08:52,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:08:52,086 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:08:52,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:08:52,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:08:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-20 13:08:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-20 13:08:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-20 13:08:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-20 13:08:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-20 13:08:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-20 13:08:52,088 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-20 13:08:52,088 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-20 13:08:52,088 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-20 13:08:52,088 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-20 13:08:52,088 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:08:52,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:08:52,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:08:53,565 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:08:53,566 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-20 13:08:53,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:08:53 BoogieIcfgContainer [2019-09-20 13:08:53,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:08:53,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:08:53,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:08:53,572 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:08:53,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:08:51" (1/3) ... [2019-09-20 13:08:53,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@508f34ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:08:53, skipping insertion in model container [2019-09-20 13:08:53,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:51" (2/3) ... [2019-09-20 13:08:53,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@508f34ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:08:53, skipping insertion in model container [2019-09-20 13:08:53,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:08:53" (3/3) ... [2019-09-20 13:08:53,576 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-20 13:08:53,587 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:08:53,596 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:08:53,613 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:08:53,653 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 13:08:53,654 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:08:53,654 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 13:08:53,654 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:08:53,655 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:08:53,655 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:08:53,655 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:08:53,655 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:08:53,655 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:08:53,686 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states. [2019-09-20 13:08:53,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-20 13:08:53,696 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:53,697 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:08:53,699 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:53,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:53,704 INFO L82 PathProgramCache]: Analyzing trace with hash 343036633, now seen corresponding path program 1 times [2019-09-20 13:08:53,705 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:53,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:53,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:53,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:53,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:54,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:54,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:54,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:08:54,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:08:54,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:08:54,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:08:54,524 INFO L87 Difference]: Start difference. First operand 223 states. Second operand 4 states. [2019-09-20 13:08:54,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:54,745 INFO L93 Difference]: Finished difference Result 636 states and 1118 transitions. [2019-09-20 13:08:54,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:08:54,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-09-20 13:08:54,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:54,765 INFO L225 Difference]: With dead ends: 636 [2019-09-20 13:08:54,765 INFO L226 Difference]: Without dead ends: 418 [2019-09-20 13:08:54,770 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:54,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-09-20 13:08:54,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 416. [2019-09-20 13:08:54,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-09-20 13:08:54,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 609 transitions. [2019-09-20 13:08:54,867 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 609 transitions. Word has length 98 [2019-09-20 13:08:54,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:54,868 INFO L475 AbstractCegarLoop]: Abstraction has 416 states and 609 transitions. [2019-09-20 13:08:54,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:08:54,868 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 609 transitions. [2019-09-20 13:08:54,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-20 13:08:54,874 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:54,874 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:08:54,874 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:54,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:54,875 INFO L82 PathProgramCache]: Analyzing trace with hash -936762471, now seen corresponding path program 1 times [2019-09-20 13:08:54,875 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:54,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:54,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:54,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:54,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:54,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:54,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:54,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:08:54,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:08:54,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:08:54,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:08:54,963 INFO L87 Difference]: Start difference. First operand 416 states and 609 transitions. Second operand 3 states. [2019-09-20 13:08:55,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:55,025 INFO L93 Difference]: Finished difference Result 1202 states and 1757 transitions. [2019-09-20 13:08:55,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:08:55,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-20 13:08:55,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:55,032 INFO L225 Difference]: With dead ends: 1202 [2019-09-20 13:08:55,032 INFO L226 Difference]: Without dead ends: 818 [2019-09-20 13:08:55,035 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:08:55,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-09-20 13:08:55,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 418. [2019-09-20 13:08:55,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-09-20 13:08:55,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 611 transitions. [2019-09-20 13:08:55,107 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 611 transitions. Word has length 99 [2019-09-20 13:08:55,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:55,109 INFO L475 AbstractCegarLoop]: Abstraction has 418 states and 611 transitions. [2019-09-20 13:08:55,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:08:55,109 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 611 transitions. [2019-09-20 13:08:55,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-20 13:08:55,119 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:55,120 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:08:55,120 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:55,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:55,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1773874167, now seen corresponding path program 1 times [2019-09-20 13:08:55,121 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:55,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:55,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:55,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:55,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:55,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:55,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:55,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:08:55,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:08:55,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:08:55,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:08:55,298 INFO L87 Difference]: Start difference. First operand 418 states and 611 transitions. Second operand 3 states. [2019-09-20 13:08:55,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:55,374 INFO L93 Difference]: Finished difference Result 1038 states and 1538 transitions. [2019-09-20 13:08:55,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:08:55,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-20 13:08:55,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:55,380 INFO L225 Difference]: With dead ends: 1038 [2019-09-20 13:08:55,380 INFO L226 Difference]: Without dead ends: 802 [2019-09-20 13:08:55,381 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:08:55,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-09-20 13:08:55,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 800. [2019-09-20 13:08:55,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2019-09-20 13:08:55,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1163 transitions. [2019-09-20 13:08:55,423 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1163 transitions. Word has length 100 [2019-09-20 13:08:55,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:55,423 INFO L475 AbstractCegarLoop]: Abstraction has 800 states and 1163 transitions. [2019-09-20 13:08:55,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:08:55,424 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1163 transitions. [2019-09-20 13:08:55,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-20 13:08:55,426 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:55,426 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:08:55,426 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:55,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:55,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1816624602, now seen corresponding path program 1 times [2019-09-20 13:08:55,427 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:55,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:55,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:55,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:55,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:55,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:55,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:55,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:08:55,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:08:55,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:08:55,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:08:55,564 INFO L87 Difference]: Start difference. First operand 800 states and 1163 transitions. Second operand 4 states. [2019-09-20 13:08:55,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:55,624 INFO L93 Difference]: Finished difference Result 1239 states and 1819 transitions. [2019-09-20 13:08:55,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:08:55,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-20 13:08:55,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:55,628 INFO L225 Difference]: With dead ends: 1239 [2019-09-20 13:08:55,629 INFO L226 Difference]: Without dead ends: 611 [2019-09-20 13:08:55,630 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:55,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-09-20 13:08:55,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-09-20 13:08:55,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-09-20 13:08:55,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 883 transitions. [2019-09-20 13:08:55,662 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 883 transitions. Word has length 100 [2019-09-20 13:08:55,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:55,663 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 883 transitions. [2019-09-20 13:08:55,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:08:55,663 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 883 transitions. [2019-09-20 13:08:55,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:08:55,665 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:55,665 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:08:55,665 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:55,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:55,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1713248280, now seen corresponding path program 1 times [2019-09-20 13:08:55,666 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:55,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:55,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:55,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:55,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:55,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:55,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:55,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:08:55,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:08:55,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:08:55,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:08:55,945 INFO L87 Difference]: Start difference. First operand 611 states and 883 transitions. Second operand 4 states. [2019-09-20 13:08:56,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:56,053 INFO L93 Difference]: Finished difference Result 1485 states and 2148 transitions. [2019-09-20 13:08:56,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:08:56,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:08:56,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:56,059 INFO L225 Difference]: With dead ends: 1485 [2019-09-20 13:08:56,060 INFO L226 Difference]: Without dead ends: 897 [2019-09-20 13:08:56,062 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:56,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-09-20 13:08:56,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 895. [2019-09-20 13:08:56,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-09-20 13:08:56,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1282 transitions. [2019-09-20 13:08:56,118 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1282 transitions. Word has length 102 [2019-09-20 13:08:56,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:56,119 INFO L475 AbstractCegarLoop]: Abstraction has 895 states and 1282 transitions. [2019-09-20 13:08:56,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:08:56,119 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1282 transitions. [2019-09-20 13:08:56,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:08:56,121 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:56,121 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:08:56,122 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:56,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:56,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1610605002, now seen corresponding path program 1 times [2019-09-20 13:08:56,122 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:56,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:56,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:56,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:56,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:56,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:56,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:56,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:08:56,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:08:56,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:08:56,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:08:56,250 INFO L87 Difference]: Start difference. First operand 895 states and 1282 transitions. Second operand 3 states. [2019-09-20 13:08:56,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:56,426 INFO L93 Difference]: Finished difference Result 2174 states and 3182 transitions. [2019-09-20 13:08:56,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:08:56,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-20 13:08:56,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:56,441 INFO L225 Difference]: With dead ends: 2174 [2019-09-20 13:08:56,441 INFO L226 Difference]: Without dead ends: 1607 [2019-09-20 13:08:56,444 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:08:56,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2019-09-20 13:08:56,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1605. [2019-09-20 13:08:56,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1605 states. [2019-09-20 13:08:56,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 2301 transitions. [2019-09-20 13:08:56,585 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 2301 transitions. Word has length 104 [2019-09-20 13:08:56,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:56,586 INFO L475 AbstractCegarLoop]: Abstraction has 1605 states and 2301 transitions. [2019-09-20 13:08:56,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:08:56,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 2301 transitions. [2019-09-20 13:08:56,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:08:56,623 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:56,623 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:08:56,623 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:56,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:56,624 INFO L82 PathProgramCache]: Analyzing trace with hash -817857369, now seen corresponding path program 1 times [2019-09-20 13:08:56,624 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:56,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:56,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:56,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:56,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:56,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:56,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:56,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:08:56,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:08:56,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:08:56,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:08:56,889 INFO L87 Difference]: Start difference. First operand 1605 states and 2301 transitions. Second operand 4 states. [2019-09-20 13:08:56,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:56,994 INFO L93 Difference]: Finished difference Result 2391 states and 3456 transitions. [2019-09-20 13:08:56,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:08:56,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:08:56,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:57,003 INFO L225 Difference]: With dead ends: 2391 [2019-09-20 13:08:57,004 INFO L226 Difference]: Without dead ends: 1319 [2019-09-20 13:08:57,006 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:57,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2019-09-20 13:08:57,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1319. [2019-09-20 13:08:57,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1319 states. [2019-09-20 13:08:57,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1881 transitions. [2019-09-20 13:08:57,104 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1881 transitions. Word has length 104 [2019-09-20 13:08:57,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:57,104 INFO L475 AbstractCegarLoop]: Abstraction has 1319 states and 1881 transitions. [2019-09-20 13:08:57,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:08:57,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1881 transitions. [2019-09-20 13:08:57,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:08:57,107 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:57,107 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:08:57,107 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:57,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:57,108 INFO L82 PathProgramCache]: Analyzing trace with hash 669169858, now seen corresponding path program 1 times [2019-09-20 13:08:57,108 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:57,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:57,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:57,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:57,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:57,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:57,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:57,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:08:57,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:08:57,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:08:57,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:08:57,186 INFO L87 Difference]: Start difference. First operand 1319 states and 1881 transitions. Second operand 3 states. [2019-09-20 13:08:57,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:57,555 INFO L93 Difference]: Finished difference Result 3197 states and 4694 transitions. [2019-09-20 13:08:57,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:08:57,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-20 13:08:57,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:57,570 INFO L225 Difference]: With dead ends: 3197 [2019-09-20 13:08:57,571 INFO L226 Difference]: Without dead ends: 2376 [2019-09-20 13:08:57,574 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:08:57,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2019-09-20 13:08:57,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 2374. [2019-09-20 13:08:57,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2374 states. [2019-09-20 13:08:57,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2374 states to 2374 states and 3419 transitions. [2019-09-20 13:08:57,835 INFO L78 Accepts]: Start accepts. Automaton has 2374 states and 3419 transitions. Word has length 106 [2019-09-20 13:08:57,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:57,837 INFO L475 AbstractCegarLoop]: Abstraction has 2374 states and 3419 transitions. [2019-09-20 13:08:57,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:08:57,837 INFO L276 IsEmpty]: Start isEmpty. Operand 2374 states and 3419 transitions. [2019-09-20 13:08:57,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:08:57,840 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:57,841 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:08:57,841 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:57,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:57,841 INFO L82 PathProgramCache]: Analyzing trace with hash -53512537, now seen corresponding path program 1 times [2019-09-20 13:08:57,841 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:57,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:57,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:57,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:57,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:58,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:58,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:58,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:08:58,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:08:58,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:08:58,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:08:58,019 INFO L87 Difference]: Start difference. First operand 2374 states and 3419 transitions. Second operand 4 states. [2019-09-20 13:08:58,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:58,395 INFO L93 Difference]: Finished difference Result 6864 states and 9875 transitions. [2019-09-20 13:08:58,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:08:58,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-20 13:08:58,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:58,419 INFO L225 Difference]: With dead ends: 6864 [2019-09-20 13:08:58,419 INFO L226 Difference]: Without dead ends: 4533 [2019-09-20 13:08:58,427 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:58,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4533 states. [2019-09-20 13:08:58,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4533 to 4531. [2019-09-20 13:08:58,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4531 states. [2019-09-20 13:08:58,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4531 states to 4531 states and 6454 transitions. [2019-09-20 13:08:58,764 INFO L78 Accepts]: Start accepts. Automaton has 4531 states and 6454 transitions. Word has length 106 [2019-09-20 13:08:58,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:58,764 INFO L475 AbstractCegarLoop]: Abstraction has 4531 states and 6454 transitions. [2019-09-20 13:08:58,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:08:58,764 INFO L276 IsEmpty]: Start isEmpty. Operand 4531 states and 6454 transitions. [2019-09-20 13:08:58,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-20 13:08:58,771 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:58,771 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:08:58,771 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:58,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:58,771 INFO L82 PathProgramCache]: Analyzing trace with hash 2125527721, now seen corresponding path program 1 times [2019-09-20 13:08:58,772 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:58,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:58,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:58,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:58,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:58,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:58,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:58,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:08:58,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:08:58,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:08:58,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:08:58,822 INFO L87 Difference]: Start difference. First operand 4531 states and 6454 transitions. Second operand 3 states. [2019-09-20 13:08:59,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:59,240 INFO L93 Difference]: Finished difference Result 13393 states and 19105 transitions. [2019-09-20 13:08:59,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:08:59,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-20 13:08:59,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:59,286 INFO L225 Difference]: With dead ends: 13393 [2019-09-20 13:08:59,287 INFO L226 Difference]: Without dead ends: 8971 [2019-09-20 13:08:59,299 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:08:59,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8971 states. [2019-09-20 13:08:59,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8971 to 4537. [2019-09-20 13:08:59,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4537 states. [2019-09-20 13:08:59,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4537 states to 4537 states and 6460 transitions. [2019-09-20 13:08:59,854 INFO L78 Accepts]: Start accepts. Automaton has 4537 states and 6460 transitions. Word has length 107 [2019-09-20 13:08:59,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:59,855 INFO L475 AbstractCegarLoop]: Abstraction has 4537 states and 6460 transitions. [2019-09-20 13:08:59,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:08:59,855 INFO L276 IsEmpty]: Start isEmpty. Operand 4537 states and 6460 transitions. [2019-09-20 13:08:59,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-20 13:08:59,863 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:59,864 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:08:59,864 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:59,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:59,864 INFO L82 PathProgramCache]: Analyzing trace with hash -871367960, now seen corresponding path program 1 times [2019-09-20 13:08:59,864 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:59,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:59,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:59,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:59,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:09:00,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:09:00,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:09:00,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:09:00,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:09:00,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:09:00,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:09:00,002 INFO L87 Difference]: Start difference. First operand 4537 states and 6460 transitions. Second operand 4 states. [2019-09-20 13:09:00,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:09:00,254 INFO L93 Difference]: Finished difference Result 9032 states and 12864 transitions. [2019-09-20 13:09:00,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:09:00,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-20 13:09:00,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:09:00,294 INFO L225 Difference]: With dead ends: 9032 [2019-09-20 13:09:00,295 INFO L226 Difference]: Without dead ends: 4531 [2019-09-20 13:09:00,305 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:09:00,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4531 states. [2019-09-20 13:09:00,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4531 to 4531. [2019-09-20 13:09:00,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4531 states. [2019-09-20 13:09:00,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4531 states to 4531 states and 6448 transitions. [2019-09-20 13:09:00,636 INFO L78 Accepts]: Start accepts. Automaton has 4531 states and 6448 transitions. Word has length 108 [2019-09-20 13:09:00,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:09:00,636 INFO L475 AbstractCegarLoop]: Abstraction has 4531 states and 6448 transitions. [2019-09-20 13:09:00,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:09:00,636 INFO L276 IsEmpty]: Start isEmpty. Operand 4531 states and 6448 transitions. [2019-09-20 13:09:00,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-20 13:09:00,642 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:09:00,643 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:09:00,643 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:09:00,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:09:00,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1746692037, now seen corresponding path program 1 times [2019-09-20 13:09:00,644 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:09:00,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:09:00,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:00,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:09:00,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:09:00,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-09-20 13:09:00,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:09:00,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:09:00,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:09:00,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:09:00,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:09:00,733 INFO L87 Difference]: Start difference. First operand 4531 states and 6448 transitions. Second operand 3 states. [2019-09-20 13:09:01,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:09:01,073 INFO L93 Difference]: Finished difference Result 10307 states and 14773 transitions. [2019-09-20 13:09:01,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:09:01,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-20 13:09:01,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:09:01,090 INFO L225 Difference]: With dead ends: 10307 [2019-09-20 13:09:01,091 INFO L226 Difference]: Without dead ends: 6717 [2019-09-20 13:09:01,099 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:09:01,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6717 states. [2019-09-20 13:09:01,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6717 to 6715. [2019-09-20 13:09:01,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6715 states. [2019-09-20 13:09:01,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6715 states to 6715 states and 9383 transitions. [2019-09-20 13:09:01,913 INFO L78 Accepts]: Start accepts. Automaton has 6715 states and 9383 transitions. Word has length 108 [2019-09-20 13:09:01,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:09:01,914 INFO L475 AbstractCegarLoop]: Abstraction has 6715 states and 9383 transitions. [2019-09-20 13:09:01,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:09:01,914 INFO L276 IsEmpty]: Start isEmpty. Operand 6715 states and 9383 transitions. [2019-09-20 13:09:01,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-20 13:09:01,926 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:09:01,927 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:09:01,927 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:09:01,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:09:01,928 INFO L82 PathProgramCache]: Analyzing trace with hash -848505304, now seen corresponding path program 1 times [2019-09-20 13:09:01,928 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:09:01,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:09:01,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:01,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:09:01,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:09:02,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:09:02,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:09:02,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:09:02,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:09:02,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:09:02,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:09:02,123 INFO L87 Difference]: Start difference. First operand 6715 states and 9383 transitions. Second operand 4 states. [2019-09-20 13:09:02,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:09:02,516 INFO L93 Difference]: Finished difference Result 12456 states and 17427 transitions. [2019-09-20 13:09:02,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:09:02,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-20 13:09:02,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:09:02,533 INFO L225 Difference]: With dead ends: 12456 [2019-09-20 13:09:02,533 INFO L226 Difference]: Without dead ends: 6092 [2019-09-20 13:09:02,546 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:09:02,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6092 states. [2019-09-20 13:09:03,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6092 to 6023. [2019-09-20 13:09:03,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6023 states. [2019-09-20 13:09:03,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6023 states to 6023 states and 8366 transitions. [2019-09-20 13:09:03,305 INFO L78 Accepts]: Start accepts. Automaton has 6023 states and 8366 transitions. Word has length 110 [2019-09-20 13:09:03,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:09:03,305 INFO L475 AbstractCegarLoop]: Abstraction has 6023 states and 8366 transitions. [2019-09-20 13:09:03,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:09:03,306 INFO L276 IsEmpty]: Start isEmpty. Operand 6023 states and 8366 transitions. [2019-09-20 13:09:03,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-20 13:09:03,322 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:09:03,322 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:09:03,322 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:09:03,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:09:03,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1621946400, now seen corresponding path program 1 times [2019-09-20 13:09:03,323 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:09:03,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:09:03,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:03,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:09:03,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:09:03,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:09:03,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:09:03,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:09:03,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:09:03,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:09:03,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:09:03,413 INFO L87 Difference]: Start difference. First operand 6023 states and 8366 transitions. Second operand 3 states. [2019-09-20 13:09:04,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:09:04,315 INFO L93 Difference]: Finished difference Result 14841 states and 21156 transitions. [2019-09-20 13:09:04,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:09:04,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-09-20 13:09:04,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:09:04,343 INFO L225 Difference]: With dead ends: 14841 [2019-09-20 13:09:04,343 INFO L226 Difference]: Without dead ends: 10994 [2019-09-20 13:09:04,356 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:09:04,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10994 states. [2019-09-20 13:09:05,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10994 to 10992. [2019-09-20 13:09:05,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10992 states. [2019-09-20 13:09:05,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10992 states to 10992 states and 15347 transitions. [2019-09-20 13:09:05,098 INFO L78 Accepts]: Start accepts. Automaton has 10992 states and 15347 transitions. Word has length 112 [2019-09-20 13:09:05,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:09:05,098 INFO L475 AbstractCegarLoop]: Abstraction has 10992 states and 15347 transitions. [2019-09-20 13:09:05,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:09:05,099 INFO L276 IsEmpty]: Start isEmpty. Operand 10992 states and 15347 transitions. [2019-09-20 13:09:05,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-20 13:09:05,114 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:09:05,114 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:09:05,114 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:09:05,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:09:05,115 INFO L82 PathProgramCache]: Analyzing trace with hash 900773541, now seen corresponding path program 1 times [2019-09-20 13:09:05,115 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:09:05,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:09:05,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:05,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:09:05,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:09:05,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-09-20 13:09:05,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:09:05,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:09:05,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:09:05,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:09:05,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:09:05,269 INFO L87 Difference]: Start difference. First operand 10992 states and 15347 transitions. Second operand 4 states. [2019-09-20 13:09:06,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:09:06,046 INFO L93 Difference]: Finished difference Result 22202 states and 30971 transitions. [2019-09-20 13:09:06,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:09:06,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-20 13:09:06,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:09:06,071 INFO L225 Difference]: With dead ends: 22202 [2019-09-20 13:09:06,071 INFO L226 Difference]: Without dead ends: 11365 [2019-09-20 13:09:06,090 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:09:06,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11365 states. [2019-09-20 13:09:06,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11365 to 11179. [2019-09-20 13:09:06,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11179 states. [2019-09-20 13:09:06,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11179 states to 11179 states and 15555 transitions. [2019-09-20 13:09:06,839 INFO L78 Accepts]: Start accepts. Automaton has 11179 states and 15555 transitions. Word has length 112 [2019-09-20 13:09:06,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:09:06,839 INFO L475 AbstractCegarLoop]: Abstraction has 11179 states and 15555 transitions. [2019-09-20 13:09:06,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:09:06,839 INFO L276 IsEmpty]: Start isEmpty. Operand 11179 states and 15555 transitions. [2019-09-20 13:09:06,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-20 13:09:06,854 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:09:06,854 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:09:06,855 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:09:06,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:09:06,856 INFO L82 PathProgramCache]: Analyzing trace with hash 288500069, now seen corresponding path program 1 times [2019-09-20 13:09:06,856 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:09:06,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:09:06,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:06,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:09:06,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:09:06,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:09:06,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:09:06,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:09:06,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:09:06,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:09:06,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:09:06,933 INFO L87 Difference]: Start difference. First operand 11179 states and 15555 transitions. Second operand 3 states. [2019-09-20 13:09:08,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:09:08,066 INFO L93 Difference]: Finished difference Result 29974 states and 41914 transitions. [2019-09-20 13:09:08,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:09:08,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-09-20 13:09:08,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:09:08,115 INFO L225 Difference]: With dead ends: 29974 [2019-09-20 13:09:08,115 INFO L226 Difference]: Without dead ends: 22153 [2019-09-20 13:09:08,134 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:09:08,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22153 states. [2019-09-20 13:09:09,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22153 to 11189. [2019-09-20 13:09:09,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11189 states. [2019-09-20 13:09:09,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11189 states to 11189 states and 15565 transitions. [2019-09-20 13:09:09,130 INFO L78 Accepts]: Start accepts. Automaton has 11189 states and 15565 transitions. Word has length 113 [2019-09-20 13:09:09,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:09:09,131 INFO L475 AbstractCegarLoop]: Abstraction has 11189 states and 15565 transitions. [2019-09-20 13:09:09,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:09:09,131 INFO L276 IsEmpty]: Start isEmpty. Operand 11189 states and 15565 transitions. [2019-09-20 13:09:09,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-20 13:09:09,144 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:09:09,144 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:09:09,144 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:09:09,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:09:09,145 INFO L82 PathProgramCache]: Analyzing trace with hash -431095923, now seen corresponding path program 1 times [2019-09-20 13:09:09,145 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:09:09,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:09:09,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:09,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:09:09,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:09:09,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:09:09,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:09:09,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-20 13:09:09,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-20 13:09:09,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-20 13:09:09,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:09:09,439 INFO L87 Difference]: Start difference. First operand 11189 states and 15565 transitions. Second operand 12 states. [2019-09-20 13:09:12,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:09:12,853 INFO L93 Difference]: Finished difference Result 37443 states and 55319 transitions. [2019-09-20 13:09:12,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:09:12,853 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 114 [2019-09-20 13:09:12,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:09:12,927 INFO L225 Difference]: With dead ends: 37443 [2019-09-20 13:09:12,928 INFO L226 Difference]: Without dead ends: 30501 [2019-09-20 13:09:12,946 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-09-20 13:09:12,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30501 states. [2019-09-20 13:09:14,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30501 to 25435. [2019-09-20 13:09:14,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25435 states. [2019-09-20 13:09:14,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25435 states to 25435 states and 36699 transitions. [2019-09-20 13:09:14,736 INFO L78 Accepts]: Start accepts. Automaton has 25435 states and 36699 transitions. Word has length 114 [2019-09-20 13:09:14,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:09:14,736 INFO L475 AbstractCegarLoop]: Abstraction has 25435 states and 36699 transitions. [2019-09-20 13:09:14,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-20 13:09:14,737 INFO L276 IsEmpty]: Start isEmpty. Operand 25435 states and 36699 transitions. [2019-09-20 13:09:14,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-20 13:09:14,762 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:09:14,762 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:09:14,763 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:09:14,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:09:14,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1784609226, now seen corresponding path program 1 times [2019-09-20 13:09:14,763 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:09:14,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:09:14,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:14,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:09:14,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:09:14,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:09:14,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:09:14,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:09:14,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:09:14,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:09:14,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:09:14,854 INFO L87 Difference]: Start difference. First operand 25435 states and 36699 transitions. Second operand 3 states. [2019-09-20 13:09:17,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:09:17,386 INFO L93 Difference]: Finished difference Result 58469 states and 88539 transitions. [2019-09-20 13:09:17,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:09:17,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-09-20 13:09:17,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:09:17,450 INFO L225 Difference]: With dead ends: 58469 [2019-09-20 13:09:17,450 INFO L226 Difference]: Without dead ends: 41921 [2019-09-20 13:09:17,481 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:09:17,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41921 states. [2019-09-20 13:09:20,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41921 to 41919. [2019-09-20 13:09:20,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41919 states. [2019-09-20 13:09:20,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41919 states to 41919 states and 61685 transitions. [2019-09-20 13:09:20,999 INFO L78 Accepts]: Start accepts. Automaton has 41919 states and 61685 transitions. Word has length 114 [2019-09-20 13:09:21,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:09:21,000 INFO L475 AbstractCegarLoop]: Abstraction has 41919 states and 61685 transitions. [2019-09-20 13:09:21,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:09:21,000 INFO L276 IsEmpty]: Start isEmpty. Operand 41919 states and 61685 transitions. [2019-09-20 13:09:21,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-20 13:09:21,017 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:09:21,017 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:09:21,017 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:09:21,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:09:21,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1465323800, now seen corresponding path program 1 times [2019-09-20 13:09:21,018 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:09:21,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:09:21,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:21,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:09:21,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:09:21,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:09:21,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:09:21,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 13:09:21,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:09:21,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:09:21,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:09:21,185 INFO L87 Difference]: Start difference. First operand 41919 states and 61685 transitions. Second operand 8 states.