java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:06:50,143 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:06:50,145 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:06:50,156 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:06:50,157 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:06:50,158 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:06:50,159 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:06:50,161 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:06:50,162 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:06:50,163 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:06:50,164 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:06:50,165 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:06:50,166 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:06:50,167 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:06:50,167 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:06:50,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:06:50,169 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:06:50,170 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:06:50,172 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:06:50,174 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:06:50,175 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:06:50,176 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:06:50,177 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:06:50,178 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:06:50,180 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:06:50,181 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:06:50,181 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:06:50,182 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:06:50,182 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:06:50,183 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:06:50,184 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:06:50,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:06:50,185 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:06:50,186 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:06:50,187 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:06:50,187 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:06:50,188 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:06:50,188 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:06:50,188 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:06:50,190 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:06:50,191 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:06:50,192 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-08 11:06:50,208 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:06:50,208 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:06:50,209 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:06:50,210 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:06:50,210 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:06:50,210 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:06:50,210 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:06:50,211 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:06:50,211 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:06:50,211 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:06:50,211 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:06:50,211 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:06:50,212 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:06:50,212 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:06:50,212 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:06:50,212 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:06:50,212 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:06:50,213 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:06:50,213 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:06:50,213 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:06:50,213 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:06:50,213 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:06:50,214 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:06:50,214 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:06:50,214 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:06:50,214 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:06:50,214 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:06:50,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:06:50,215 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:06:50,242 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:06:50,255 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:06:50,258 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:06:50,259 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:06:50,260 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:06:50,260 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-08 11:06:50,320 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad07e953c/6b0f41ef215b49678650644cfdd10996/FLAGacea55778 [2019-09-08 11:06:50,785 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:06:50,786 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-08 11:06:50,812 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad07e953c/6b0f41ef215b49678650644cfdd10996/FLAGacea55778 [2019-09-08 11:06:51,140 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad07e953c/6b0f41ef215b49678650644cfdd10996 [2019-09-08 11:06:51,150 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:06:51,151 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:06:51,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:06:51,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:06:51,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:06:51,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:06:51" (1/1) ... [2019-09-08 11:06:51,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408566e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:06:51, skipping insertion in model container [2019-09-08 11:06:51,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:06:51" (1/1) ... [2019-09-08 11:06:51,168 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:06:51,233 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:06:51,714 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:06:51,731 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:06:51,884 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:06:51,910 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:06:51,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:06:51 WrapperNode [2019-09-08 11:06:51,911 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:06:51,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:06:51,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:06:51,912 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:06:51,922 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:06:51" (1/1) ... [2019-09-08 11:06:51,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:06:51" (1/1) ... [2019-09-08 11:06:51,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:06:51" (1/1) ... [2019-09-08 11:06:51,935 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:06:51" (1/1) ... [2019-09-08 11:06:51,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:06:51" (1/1) ... [2019-09-08 11:06:51,973 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:06:51" (1/1) ... [2019-09-08 11:06:51,977 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:06:51" (1/1) ... [2019-09-08 11:06:51,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:06:51,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:06:51,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:06:51,984 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:06:51,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:06: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-08 11:06:52,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:06:52,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:06:52,061 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:06:52,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:06:52,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:06:52,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:06:52,063 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:06:52,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:06:52,063 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:06:52,063 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:06:52,064 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:06:52,064 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:06:52,065 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:06:52,065 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:06:52,066 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 11:06:52,066 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:06:52,069 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:06:52,069 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:06:52,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:06:52,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:06:53,164 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:06:53,164 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:06:53,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:06:53 BoogieIcfgContainer [2019-09-08 11:06:53,166 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:06:53,167 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:06:53,167 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:06:53,170 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:06:53,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:06:51" (1/3) ... [2019-09-08 11:06:53,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a4b8fd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:06:53, skipping insertion in model container [2019-09-08 11:06:53,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:06:51" (2/3) ... [2019-09-08 11:06:53,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a4b8fd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:06:53, skipping insertion in model container [2019-09-08 11:06:53,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:06:53" (3/3) ... [2019-09-08 11:06:53,173 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-08 11:06:53,183 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:06:53,192 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 11:06:53,209 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 11:06:53,238 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:06:53,239 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:06:53,239 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:06:53,240 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:06:53,240 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:06:53,240 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:06:53,240 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:06:53,240 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:06:53,241 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:06:53,264 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states. [2019-09-08 11:06:53,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 11:06:53,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:53,275 INFO L399 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] [2019-09-08 11:06:53,276 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:53,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:53,281 INFO L82 PathProgramCache]: Analyzing trace with hash -653543998, now seen corresponding path program 1 times [2019-09-08 11:06:53,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:53,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:53,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:53,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:53,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:53,747 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-08 11:06:53,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:06:53,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:06:53,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:06:53,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:06:53,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:06:53,773 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 3 states. [2019-09-08 11:06:53,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:06:53,934 INFO L93 Difference]: Finished difference Result 425 states and 696 transitions. [2019-09-08 11:06:53,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:06:53,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-08 11:06:53,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:06:53,966 INFO L225 Difference]: With dead ends: 425 [2019-09-08 11:06:53,967 INFO L226 Difference]: Without dead ends: 319 [2019-09-08 11:06:53,972 INFO L628 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-08 11:06:53,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-09-08 11:06:54,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 317. [2019-09-08 11:06:54,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-09-08 11:06:54,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 471 transitions. [2019-09-08 11:06:54,119 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 471 transitions. Word has length 84 [2019-09-08 11:06:54,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:06:54,120 INFO L475 AbstractCegarLoop]: Abstraction has 317 states and 471 transitions. [2019-09-08 11:06:54,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:06:54,120 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 471 transitions. [2019-09-08 11:06:54,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:06:54,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:54,129 INFO L399 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] [2019-09-08 11:06:54,130 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:54,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:54,130 INFO L82 PathProgramCache]: Analyzing trace with hash 955400931, now seen corresponding path program 1 times [2019-09-08 11:06:54,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:54,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:54,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:54,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:54,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:54,522 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-08 11:06:54,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:06:54,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:06:54,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:06:54,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:06:54,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:06:54,525 INFO L87 Difference]: Start difference. First operand 317 states and 471 transitions. Second operand 7 states. [2019-09-08 11:06:54,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:06:54,923 INFO L93 Difference]: Finished difference Result 1363 states and 2099 transitions. [2019-09-08 11:06:54,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 11:06:54,924 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2019-09-08 11:06:54,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:06:54,932 INFO L225 Difference]: With dead ends: 1363 [2019-09-08 11:06:54,932 INFO L226 Difference]: Without dead ends: 1127 [2019-09-08 11:06:54,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:06:54,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2019-09-08 11:06:55,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1119. [2019-09-08 11:06:55,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2019-09-08 11:06:55,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1716 transitions. [2019-09-08 11:06:55,015 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1716 transitions. Word has length 85 [2019-09-08 11:06:55,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:06:55,017 INFO L475 AbstractCegarLoop]: Abstraction has 1119 states and 1716 transitions. [2019-09-08 11:06:55,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:06:55,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1716 transitions. [2019-09-08 11:06:55,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 11:06:55,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:55,027 INFO L399 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] [2019-09-08 11:06:55,028 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:55,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:55,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1687831789, now seen corresponding path program 1 times [2019-09-08 11:06:55,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:55,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:55,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:55,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:55,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:55,187 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-08 11:06:55,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:06:55,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:06:55,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:06:55,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:06:55,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:06:55,190 INFO L87 Difference]: Start difference. First operand 1119 states and 1716 transitions. Second operand 5 states. [2019-09-08 11:06:55,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:06:55,605 INFO L93 Difference]: Finished difference Result 2886 states and 4484 transitions. [2019-09-08 11:06:55,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:06:55,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-08 11:06:55,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:06:55,617 INFO L225 Difference]: With dead ends: 2886 [2019-09-08 11:06:55,617 INFO L226 Difference]: Without dead ends: 1879 [2019-09-08 11:06:55,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:06:55,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2019-09-08 11:06:55,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1877. [2019-09-08 11:06:55,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2019-09-08 11:06:55,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2894 transitions. [2019-09-08 11:06:55,723 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2894 transitions. Word has length 86 [2019-09-08 11:06:55,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:06:55,724 INFO L475 AbstractCegarLoop]: Abstraction has 1877 states and 2894 transitions. [2019-09-08 11:06:55,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:06:55,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2894 transitions. [2019-09-08 11:06:55,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 11:06:55,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:55,727 INFO L399 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] [2019-09-08 11:06:55,727 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:55,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:55,728 INFO L82 PathProgramCache]: Analyzing trace with hash -334266178, now seen corresponding path program 1 times [2019-09-08 11:06:55,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:55,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:55,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:55,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:55,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:55,826 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-08 11:06:55,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:06:55,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:06:55,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:06:55,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:06:55,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:06:55,828 INFO L87 Difference]: Start difference. First operand 1877 states and 2894 transitions. Second operand 5 states. [2019-09-08 11:06:56,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:06:56,332 INFO L93 Difference]: Finished difference Result 5110 states and 7965 transitions. [2019-09-08 11:06:56,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:06:56,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-08 11:06:56,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:06:56,362 INFO L225 Difference]: With dead ends: 5110 [2019-09-08 11:06:56,362 INFO L226 Difference]: Without dead ends: 3379 [2019-09-08 11:06:56,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:06:56,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3379 states. [2019-09-08 11:06:56,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3379 to 3377. [2019-09-08 11:06:56,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3377 states. [2019-09-08 11:06:56,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3377 states to 3377 states and 5231 transitions. [2019-09-08 11:06:56,666 INFO L78 Accepts]: Start accepts. Automaton has 3377 states and 5231 transitions. Word has length 86 [2019-09-08 11:06:56,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:06:56,667 INFO L475 AbstractCegarLoop]: Abstraction has 3377 states and 5231 transitions. [2019-09-08 11:06:56,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:06:56,668 INFO L276 IsEmpty]: Start isEmpty. Operand 3377 states and 5231 transitions. [2019-09-08 11:06:56,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 11:06:56,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:56,680 INFO L399 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] [2019-09-08 11:06:56,681 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:56,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:56,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1147431652, now seen corresponding path program 1 times [2019-09-08 11:06:56,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:56,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:56,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:56,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:56,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:56,833 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-08 11:06:56,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:06:56,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:06:56,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:06:56,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:06:56,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:06:56,836 INFO L87 Difference]: Start difference. First operand 3377 states and 5231 transitions. Second operand 5 states. [2019-09-08 11:06:57,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:06:57,476 INFO L93 Difference]: Finished difference Result 9728 states and 15144 transitions. [2019-09-08 11:06:57,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:06:57,476 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-08 11:06:57,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:06:57,515 INFO L225 Difference]: With dead ends: 9728 [2019-09-08 11:06:57,516 INFO L226 Difference]: Without dead ends: 6433 [2019-09-08 11:06:57,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:06:57,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6433 states. [2019-09-08 11:06:57,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6433 to 6431. [2019-09-08 11:06:57,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6431 states. [2019-09-08 11:06:57,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6431 states to 6431 states and 9953 transitions. [2019-09-08 11:06:57,948 INFO L78 Accepts]: Start accepts. Automaton has 6431 states and 9953 transitions. Word has length 86 [2019-09-08 11:06:57,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:06:57,951 INFO L475 AbstractCegarLoop]: Abstraction has 6431 states and 9953 transitions. [2019-09-08 11:06:57,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:06:57,952 INFO L276 IsEmpty]: Start isEmpty. Operand 6431 states and 9953 transitions. [2019-09-08 11:06:57,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 11:06:57,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:57,955 INFO L399 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] [2019-09-08 11:06:57,955 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:57,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:57,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1013428555, now seen corresponding path program 1 times [2019-09-08 11:06:57,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:57,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:57,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:57,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:57,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:58,124 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-08 11:06:58,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:06:58,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:06:58,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:06:58,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:06:58,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:06:58,126 INFO L87 Difference]: Start difference. First operand 6431 states and 9953 transitions. Second operand 6 states. [2019-09-08 11:06:59,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:06:59,712 INFO L93 Difference]: Finished difference Result 24639 states and 38200 transitions. [2019-09-08 11:06:59,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:06:59,713 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-09-08 11:06:59,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:06:59,804 INFO L225 Difference]: With dead ends: 24639 [2019-09-08 11:06:59,804 INFO L226 Difference]: Without dead ends: 18267 [2019-09-08 11:06:59,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:06:59,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18267 states. [2019-09-08 11:07:00,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18267 to 18263. [2019-09-08 11:07:00,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18263 states. [2019-09-08 11:07:01,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18263 states to 18263 states and 28182 transitions. [2019-09-08 11:07:01,025 INFO L78 Accepts]: Start accepts. Automaton has 18263 states and 28182 transitions. Word has length 86 [2019-09-08 11:07:01,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:07:01,025 INFO L475 AbstractCegarLoop]: Abstraction has 18263 states and 28182 transitions. [2019-09-08 11:07:01,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:07:01,026 INFO L276 IsEmpty]: Start isEmpty. Operand 18263 states and 28182 transitions. [2019-09-08 11:07:01,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:07:01,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:07:01,032 INFO L399 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] [2019-09-08 11:07:01,032 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:07:01,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:07:01,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1083255427, now seen corresponding path program 1 times [2019-09-08 11:07:01,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:07:01,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:07:01,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:01,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:07:01,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:07:01,120 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-08 11:07:01,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:07:01,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:07:01,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:07:01,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:07:01,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:07:01,122 INFO L87 Difference]: Start difference. First operand 18263 states and 28182 transitions. Second operand 5 states. [2019-09-08 11:07:02,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:07:02,886 INFO L93 Difference]: Finished difference Result 51210 states and 79109 transitions. [2019-09-08 11:07:02,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:07:02,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-08 11:07:02,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:07:02,967 INFO L225 Difference]: With dead ends: 51210 [2019-09-08 11:07:02,967 INFO L226 Difference]: Without dead ends: 33015 [2019-09-08 11:07:03,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:07:03,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33015 states. [2019-09-08 11:07:05,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33015 to 33013. [2019-09-08 11:07:05,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33013 states. [2019-09-08 11:07:05,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33013 states to 33013 states and 50761 transitions. [2019-09-08 11:07:05,195 INFO L78 Accepts]: Start accepts. Automaton has 33013 states and 50761 transitions. Word has length 87 [2019-09-08 11:07:05,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:07:05,195 INFO L475 AbstractCegarLoop]: Abstraction has 33013 states and 50761 transitions. [2019-09-08 11:07:05,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:07:05,196 INFO L276 IsEmpty]: Start isEmpty. Operand 33013 states and 50761 transitions. [2019-09-08 11:07:05,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:07:05,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:07:05,205 INFO L399 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] [2019-09-08 11:07:05,205 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:07:05,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:07:05,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1123215154, now seen corresponding path program 1 times [2019-09-08 11:07:05,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:07:05,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:07:05,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:05,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:07:05,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:07:05,304 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-08 11:07:05,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:07:05,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:07:05,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:07:05,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:07:05,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:07:05,306 INFO L87 Difference]: Start difference. First operand 33013 states and 50761 transitions. Second operand 5 states. [2019-09-08 11:07:08,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:07:08,587 INFO L93 Difference]: Finished difference Result 62607 states and 95794 transitions. [2019-09-08 11:07:08,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:07:08,587 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-08 11:07:08,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:07:08,729 INFO L225 Difference]: With dead ends: 62607 [2019-09-08 11:07:08,730 INFO L226 Difference]: Without dead ends: 62605 [2019-09-08 11:07:08,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:07:08,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62605 states. [2019-09-08 11:07:10,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62605 to 33445. [2019-09-08 11:07:10,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33445 states. [2019-09-08 11:07:10,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33445 states to 33445 states and 51193 transitions. [2019-09-08 11:07:10,559 INFO L78 Accepts]: Start accepts. Automaton has 33445 states and 51193 transitions. Word has length 87 [2019-09-08 11:07:10,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:07:10,559 INFO L475 AbstractCegarLoop]: Abstraction has 33445 states and 51193 transitions. [2019-09-08 11:07:10,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:07:10,559 INFO L276 IsEmpty]: Start isEmpty. Operand 33445 states and 51193 transitions. [2019-09-08 11:07:10,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:07:10,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:07:10,569 INFO L399 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] [2019-09-08 11:07:10,569 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:07:10,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:07:10,570 INFO L82 PathProgramCache]: Analyzing trace with hash -201497109, now seen corresponding path program 1 times [2019-09-08 11:07:10,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:07:10,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:07:10,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:10,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:07:10,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:07:10,816 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-08 11:07:10,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:07:10,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:07:10,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:07:10,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:07:10,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:07:10,818 INFO L87 Difference]: Start difference. First operand 33445 states and 51193 transitions. Second operand 10 states. [2019-09-08 11:07:17,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:07:17,931 INFO L93 Difference]: Finished difference Result 113724 states and 171854 transitions. [2019-09-08 11:07:17,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 11:07:17,932 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-09-08 11:07:17,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:07:18,094 INFO L225 Difference]: With dead ends: 113724 [2019-09-08 11:07:18,094 INFO L226 Difference]: Without dead ends: 101818 [2019-09-08 11:07:18,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=247, Invalid=683, Unknown=0, NotChecked=0, Total=930 [2019-09-08 11:07:18,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101818 states. [2019-09-08 11:07:20,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101818 to 34032. [2019-09-08 11:07:20,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34032 states. [2019-09-08 11:07:20,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34032 states to 34032 states and 52058 transitions. [2019-09-08 11:07:20,631 INFO L78 Accepts]: Start accepts. Automaton has 34032 states and 52058 transitions. Word has length 88 [2019-09-08 11:07:20,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:07:20,631 INFO L475 AbstractCegarLoop]: Abstraction has 34032 states and 52058 transitions. [2019-09-08 11:07:20,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:07:20,632 INFO L276 IsEmpty]: Start isEmpty. Operand 34032 states and 52058 transitions. [2019-09-08 11:07:20,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:07:20,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:07:20,642 INFO L399 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] [2019-09-08 11:07:20,643 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:07:20,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:07:20,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1998335413, now seen corresponding path program 1 times [2019-09-08 11:07:20,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:07:20,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:07:20,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:20,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:07:20,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:07:20,738 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-08 11:07:20,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:07:20,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 11:07:20,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 11:07:20,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 11:07:20,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:07:20,739 INFO L87 Difference]: Start difference. First operand 34032 states and 52058 transitions. Second operand 4 states. [2019-09-08 11:07:24,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:07:24,393 INFO L93 Difference]: Finished difference Result 95044 states and 144924 transitions. [2019-09-08 11:07:24,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 11:07:24,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-08 11:07:24,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:07:24,491 INFO L225 Difference]: With dead ends: 95044 [2019-09-08 11:07:24,491 INFO L226 Difference]: Without dead ends: 62642 [2019-09-08 11:07:24,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:07:24,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62642 states. [2019-09-08 11:07:27,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62642 to 62640. [2019-09-08 11:07:27,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62640 states. [2019-09-08 11:07:28,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62640 states to 62640 states and 95050 transitions. [2019-09-08 11:07:28,008 INFO L78 Accepts]: Start accepts. Automaton has 62640 states and 95050 transitions. Word has length 88 [2019-09-08 11:07:28,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:07:28,009 INFO L475 AbstractCegarLoop]: Abstraction has 62640 states and 95050 transitions. [2019-09-08 11:07:28,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 11:07:28,009 INFO L276 IsEmpty]: Start isEmpty. Operand 62640 states and 95050 transitions. [2019-09-08 11:07:28,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:07:28,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:07:28,019 INFO L399 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] [2019-09-08 11:07:28,019 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:07:28,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:07:28,019 INFO L82 PathProgramCache]: Analyzing trace with hash -696308474, now seen corresponding path program 1 times [2019-09-08 11:07:28,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:07:28,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:07:28,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:28,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:07:28,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:07:28,084 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-08 11:07:28,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:07:28,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:07:28,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:07:28,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:07:28,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:07:28,086 INFO L87 Difference]: Start difference. First operand 62640 states and 95050 transitions. Second operand 3 states. [2019-09-08 11:07:32,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:07:32,853 INFO L93 Difference]: Finished difference Result 84846 states and 128484 transitions. [2019-09-08 11:07:32,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:07:32,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-08 11:07:32,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:07:32,933 INFO L225 Difference]: With dead ends: 84846 [2019-09-08 11:07:32,933 INFO L226 Difference]: Without dead ends: 68740 [2019-09-08 11:07:32,955 INFO L628 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-08 11:07:32,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68740 states. [2019-09-08 11:07:36,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68740 to 61458. [2019-09-08 11:07:36,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61458 states. [2019-09-08 11:07:36,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61458 states to 61458 states and 91958 transitions. [2019-09-08 11:07:36,342 INFO L78 Accepts]: Start accepts. Automaton has 61458 states and 91958 transitions. Word has length 89 [2019-09-08 11:07:36,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:07:36,343 INFO L475 AbstractCegarLoop]: Abstraction has 61458 states and 91958 transitions. [2019-09-08 11:07:36,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:07:36,343 INFO L276 IsEmpty]: Start isEmpty. Operand 61458 states and 91958 transitions. [2019-09-08 11:07:36,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:07:36,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:07:36,352 INFO L399 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] [2019-09-08 11:07:36,352 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:07:36,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:07:36,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1308007351, now seen corresponding path program 1 times [2019-09-08 11:07:36,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:07:36,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:07:36,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:36,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:07:36,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:07:36,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-08 11:07:36,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:07:36,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:07:36,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:07:36,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:07:36,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:07:36,412 INFO L87 Difference]: Start difference. First operand 61458 states and 91958 transitions. Second operand 3 states. [2019-09-08 11:07:41,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:07:41,466 INFO L93 Difference]: Finished difference Result 121622 states and 181958 transitions. [2019-09-08 11:07:41,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:07:41,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-08 11:07:41,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:07:41,561 INFO L225 Difference]: With dead ends: 121622 [2019-09-08 11:07:41,561 INFO L226 Difference]: Without dead ends: 78664 [2019-09-08 11:07:41,601 INFO L628 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-08 11:07:41,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78664 states. [2019-09-08 11:07:47,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78664 to 77950. [2019-09-08 11:07:47,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77950 states. [2019-09-08 11:07:47,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77950 states to 77950 states and 114988 transitions. [2019-09-08 11:07:47,700 INFO L78 Accepts]: Start accepts. Automaton has 77950 states and 114988 transitions. Word has length 89 [2019-09-08 11:07:47,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:07:47,701 INFO L475 AbstractCegarLoop]: Abstraction has 77950 states and 114988 transitions. [2019-09-08 11:07:47,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:07:47,701 INFO L276 IsEmpty]: Start isEmpty. Operand 77950 states and 114988 transitions. [2019-09-08 11:07:47,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:07:47,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:07:47,709 INFO L399 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] [2019-09-08 11:07:47,710 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:07:47,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:07:47,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1895914823, now seen corresponding path program 1 times [2019-09-08 11:07:47,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:07:47,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:07:47,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:47,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:07:47,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:07:47,775 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-08 11:07:47,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:07:47,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:07:47,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:07:47,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:07:47,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:07:47,776 INFO L87 Difference]: Start difference. First operand 77950 states and 114988 transitions. Second operand 3 states. [2019-09-08 11:07:52,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:07:52,647 INFO L93 Difference]: Finished difference Result 123478 states and 181888 transitions. [2019-09-08 11:07:52,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:07:52,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-08 11:07:52,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:07:52,747 INFO L225 Difference]: With dead ends: 123478 [2019-09-08 11:07:52,747 INFO L226 Difference]: Without dead ends: 83004 [2019-09-08 11:07:52,791 INFO L628 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-08 11:07:52,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83004 states. [2019-09-08 11:07:59,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83004 to 82194. [2019-09-08 11:07:59,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82194 states. [2019-09-08 11:08:00,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82194 states to 82194 states and 119023 transitions. [2019-09-08 11:08:00,034 INFO L78 Accepts]: Start accepts. Automaton has 82194 states and 119023 transitions. Word has length 89 [2019-09-08 11:08:00,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:08:00,034 INFO L475 AbstractCegarLoop]: Abstraction has 82194 states and 119023 transitions. [2019-09-08 11:08:00,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:08:00,034 INFO L276 IsEmpty]: Start isEmpty. Operand 82194 states and 119023 transitions. [2019-09-08 11:08:00,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:08:00,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:08:00,043 INFO L399 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] [2019-09-08 11:08:00,043 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:08:00,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:08:00,043 INFO L82 PathProgramCache]: Analyzing trace with hash -563721050, now seen corresponding path program 1 times [2019-09-08 11:08:00,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:08:00,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:08:00,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:00,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:08:00,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:08:00,148 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-08 11:08:00,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:08:00,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:08:00,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:08:00,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:08:00,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:08:00,149 INFO L87 Difference]: Start difference. First operand 82194 states and 119023 transitions. Second operand 7 states. [2019-09-08 11:08:17,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:08:17,305 INFO L93 Difference]: Finished difference Result 272760 states and 389610 transitions. [2019-09-08 11:08:17,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:08:17,305 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-09-08 11:08:17,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:08:17,664 INFO L225 Difference]: With dead ends: 272760 [2019-09-08 11:08:17,665 INFO L226 Difference]: Without dead ends: 257764 [2019-09-08 11:08:17,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:08:17,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257764 states. [2019-09-08 11:08:29,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257764 to 100722. [2019-09-08 11:08:29,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100722 states. [2019-09-08 11:08:29,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100722 states to 100722 states and 145354 transitions. [2019-09-08 11:08:29,710 INFO L78 Accepts]: Start accepts. Automaton has 100722 states and 145354 transitions. Word has length 89 [2019-09-08 11:08:29,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:08:29,710 INFO L475 AbstractCegarLoop]: Abstraction has 100722 states and 145354 transitions. [2019-09-08 11:08:29,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:08:29,710 INFO L276 IsEmpty]: Start isEmpty. Operand 100722 states and 145354 transitions. [2019-09-08 11:08:29,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:08:29,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:08:29,720 INFO L399 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] [2019-09-08 11:08:29,720 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:08:29,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:08:29,720 INFO L82 PathProgramCache]: Analyzing trace with hash -125183737, now seen corresponding path program 1 times [2019-09-08 11:08:29,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:08:29,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:08:29,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:29,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:08:29,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:08:29,793 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-08 11:08:29,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:08:29,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:08:29,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:08:29,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:08:29,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:08:29,795 INFO L87 Difference]: Start difference. First operand 100722 states and 145354 transitions. Second operand 3 states. [2019-09-08 11:08:40,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:08:40,370 INFO L93 Difference]: Finished difference Result 238966 states and 344219 transitions. [2019-09-08 11:08:40,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:08:40,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-08 11:08:40,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:08:40,951 INFO L225 Difference]: With dead ends: 238966 [2019-09-08 11:08:40,951 INFO L226 Difference]: Without dead ends: 145232 [2019-09-08 11:08:41,023 INFO L628 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-08 11:08:41,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145232 states. [2019-09-08 11:08:54,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145232 to 144062. [2019-09-08 11:08:54,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144062 states. [2019-09-08 11:08:54,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144062 states to 144062 states and 204607 transitions. [2019-09-08 11:08:54,652 INFO L78 Accepts]: Start accepts. Automaton has 144062 states and 204607 transitions. Word has length 89 [2019-09-08 11:08:54,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:08:54,652 INFO L475 AbstractCegarLoop]: Abstraction has 144062 states and 204607 transitions. [2019-09-08 11:08:54,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:08:54,652 INFO L276 IsEmpty]: Start isEmpty. Operand 144062 states and 204607 transitions. [2019-09-08 11:08:54,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:08:54,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:08:54,666 INFO L399 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] [2019-09-08 11:08:54,666 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:08:54,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:08:54,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1522962295, now seen corresponding path program 1 times [2019-09-08 11:08:54,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:08:54,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:08:54,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:54,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:08:54,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:08:54,738 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-08 11:08:54,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:08:54,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:08:54,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:08:54,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:08:54,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:08:54,742 INFO L87 Difference]: Start difference. First operand 144062 states and 204607 transitions. Second operand 3 states. [2019-09-08 11:09:14,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:09:14,005 INFO L93 Difference]: Finished difference Result 334463 states and 474088 transitions. [2019-09-08 11:09:14,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:09:14,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-08 11:09:14,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:09:14,303 INFO L225 Difference]: With dead ends: 334463 [2019-09-08 11:09:14,303 INFO L226 Difference]: Without dead ends: 197907 [2019-09-08 11:09:14,421 INFO L628 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-08 11:09:14,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197907 states. [2019-09-08 11:09:26,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197907 to 135649. [2019-09-08 11:09:26,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135649 states. [2019-09-08 11:09:26,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135649 states to 135649 states and 189998 transitions. [2019-09-08 11:09:26,990 INFO L78 Accepts]: Start accepts. Automaton has 135649 states and 189998 transitions. Word has length 89 [2019-09-08 11:09:26,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:09:26,990 INFO L475 AbstractCegarLoop]: Abstraction has 135649 states and 189998 transitions. [2019-09-08 11:09:26,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:09:26,990 INFO L276 IsEmpty]: Start isEmpty. Operand 135649 states and 189998 transitions. [2019-09-08 11:09:27,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:09:27,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:09:27,001 INFO L399 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] [2019-09-08 11:09:27,001 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:09:27,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:09:27,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1195416311, now seen corresponding path program 1 times [2019-09-08 11:09:27,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:09:27,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:09:27,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:27,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:09:27,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:09:27,090 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-08 11:09:27,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:09:27,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:09:27,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:09:27,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:09:27,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:09:27,092 INFO L87 Difference]: Start difference. First operand 135649 states and 189998 transitions. Second operand 7 states. [2019-09-08 11:10:44,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:44,399 INFO L93 Difference]: Finished difference Result 787581 states and 1094358 transitions. [2019-09-08 11:10:44,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:10:44,399 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-09-08 11:10:44,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:45,447 INFO L225 Difference]: With dead ends: 787581 [2019-09-08 11:10:45,447 INFO L226 Difference]: Without dead ends: 726127 [2019-09-08 11:10:45,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:10:46,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726127 states. [2019-09-08 11:11:09,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726127 to 136063. [2019-09-08 11:11:09,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136063 states. [2019-09-08 11:11:10,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136063 states to 136063 states and 190528 transitions. [2019-09-08 11:11:10,103 INFO L78 Accepts]: Start accepts. Automaton has 136063 states and 190528 transitions. Word has length 89 [2019-09-08 11:11:10,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:11:10,103 INFO L475 AbstractCegarLoop]: Abstraction has 136063 states and 190528 transitions. [2019-09-08 11:11:10,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:11:10,104 INFO L276 IsEmpty]: Start isEmpty. Operand 136063 states and 190528 transitions. [2019-09-08 11:11:10,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:11:10,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:11:10,115 INFO L399 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] [2019-09-08 11:11:10,115 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:11:10,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:11:10,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1526121945, now seen corresponding path program 1 times [2019-09-08 11:11:10,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:11:10,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:11:10,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:10,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:11:10,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:11:10,196 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-08 11:11:10,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:11:10,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:11:10,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:11:10,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:11:10,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:11:10,197 INFO L87 Difference]: Start difference. First operand 136063 states and 190528 transitions. Second operand 7 states. [2019-09-08 11:12:20,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:12:20,121 INFO L93 Difference]: Finished difference Result 643417 states and 897518 transitions. [2019-09-08 11:12:20,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:12:20,121 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-09-08 11:12:20,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:12:21,053 INFO L225 Difference]: With dead ends: 643417 [2019-09-08 11:12:21,053 INFO L226 Difference]: Without dead ends: 584803 [2019-09-08 11:12:21,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:12:21,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584803 states. [2019-09-08 11:12:41,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584803 to 136123. [2019-09-08 11:12:41,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136123 states. [2019-09-08 11:12:41,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136123 states to 136123 states and 190608 transitions. [2019-09-08 11:12:41,919 INFO L78 Accepts]: Start accepts. Automaton has 136123 states and 190608 transitions. Word has length 89 [2019-09-08 11:12:41,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:12:41,920 INFO L475 AbstractCegarLoop]: Abstraction has 136123 states and 190608 transitions. [2019-09-08 11:12:41,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:12:41,920 INFO L276 IsEmpty]: Start isEmpty. Operand 136123 states and 190608 transitions. [2019-09-08 11:12:41,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:12:41,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:12:41,928 INFO L399 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] [2019-09-08 11:12:41,929 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:12:41,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:12:41,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1524215002, now seen corresponding path program 1 times [2019-09-08 11:12:41,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:12:41,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:12:41,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:41,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:12:41,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:12:42,026 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-08 11:12:42,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:12:42,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:12:42,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:12:42,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:12:42,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:12:42,027 INFO L87 Difference]: Start difference. First operand 136123 states and 190608 transitions. Second operand 7 states. [2019-09-08 11:13:48,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:48,983 INFO L93 Difference]: Finished difference Result 595723 states and 828578 transitions. [2019-09-08 11:13:48,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:13:48,983 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-08 11:13:48,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:49,754 INFO L225 Difference]: With dead ends: 595723 [2019-09-08 11:13:49,754 INFO L226 Difference]: Without dead ends: 512869 [2019-09-08 11:13:49,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:13:50,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512869 states. [2019-09-08 11:14:17,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512869 to 136223. [2019-09-08 11:14:17,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136223 states. [2019-09-08 11:14:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136223 states to 136223 states and 190728 transitions. [2019-09-08 11:14:18,007 INFO L78 Accepts]: Start accepts. Automaton has 136223 states and 190728 transitions. Word has length 90 [2019-09-08 11:14:18,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:14:18,007 INFO L475 AbstractCegarLoop]: Abstraction has 136223 states and 190728 transitions. [2019-09-08 11:14:18,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:14:18,008 INFO L276 IsEmpty]: Start isEmpty. Operand 136223 states and 190728 transitions. [2019-09-08 11:14:18,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:14:18,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:14:18,016 INFO L399 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] [2019-09-08 11:14:18,017 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:14:18,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:14:18,017 INFO L82 PathProgramCache]: Analyzing trace with hash -643370689, now seen corresponding path program 1 times [2019-09-08 11:14:18,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:14:18,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:14:18,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:18,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:14:18,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:14:18,135 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-08 11:14:18,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:14:18,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:14:18,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:14:18,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:14:18,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:14:18,137 INFO L87 Difference]: Start difference. First operand 136223 states and 190728 transitions. Second operand 7 states. [2019-09-08 11:15:59,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:59,718 INFO L93 Difference]: Finished difference Result 730149 states and 1011914 transitions. [2019-09-08 11:15:59,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:15:59,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-08 11:15:59,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:16:00,844 INFO L225 Difference]: With dead ends: 730149 [2019-09-08 11:16:00,844 INFO L226 Difference]: Without dead ends: 678731 [2019-09-08 11:16:01,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:16:01,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678731 states. [2019-09-08 11:16:32,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678731 to 136867. [2019-09-08 11:16:32,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136867 states. [2019-09-08 11:16:32,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136867 states to 136867 states and 191546 transitions. [2019-09-08 11:16:32,512 INFO L78 Accepts]: Start accepts. Automaton has 136867 states and 191546 transitions. Word has length 90 [2019-09-08 11:16:32,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:16:32,513 INFO L475 AbstractCegarLoop]: Abstraction has 136867 states and 191546 transitions. [2019-09-08 11:16:32,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:16:32,513 INFO L276 IsEmpty]: Start isEmpty. Operand 136867 states and 191546 transitions. [2019-09-08 11:16:32,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 11:16:32,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:16:32,523 INFO L399 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] [2019-09-08 11:16:32,523 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:16:32,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:16:32,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1946274543, now seen corresponding path program 1 times [2019-09-08 11:16:32,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:16:32,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:16:32,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:16:32,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:16:32,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:16:32,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:16:32,653 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-08 11:16:32,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:16:32,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:16:32,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:16:32,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:16:32,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:16:32,655 INFO L87 Difference]: Start difference. First operand 136867 states and 191546 transitions. Second operand 7 states. [2019-09-08 11:17:59,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:17:59,457 INFO L93 Difference]: Finished difference Result 583791 states and 817242 transitions. [2019-09-08 11:17:59,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 11:17:59,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-09-08 11:17:59,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:18:00,240 INFO L225 Difference]: With dead ends: 583791 [2019-09-08 11:18:00,240 INFO L226 Difference]: Without dead ends: 533833 [2019-09-08 11:18:00,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:18:00,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533833 states. [2019-09-08 11:18:29,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533833 to 162295. [2019-09-08 11:18:29,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162295 states. [2019-09-08 11:18:29,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162295 states to 162295 states and 226844 transitions. [2019-09-08 11:18:29,536 INFO L78 Accepts]: Start accepts. Automaton has 162295 states and 226844 transitions. Word has length 91 [2019-09-08 11:18:29,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:18:29,537 INFO L475 AbstractCegarLoop]: Abstraction has 162295 states and 226844 transitions. [2019-09-08 11:18:29,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:18:29,537 INFO L276 IsEmpty]: Start isEmpty. Operand 162295 states and 226844 transitions. [2019-09-08 11:18:29,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 11:18:29,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:18:29,548 INFO L399 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] [2019-09-08 11:18:29,548 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:18:29,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:18:29,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1692361164, now seen corresponding path program 1 times [2019-09-08 11:18:29,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:18:29,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:18:29,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:18:29,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:18:29,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:18:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:18:29,688 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-08 11:18:29,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:18:29,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:18:29,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:18:29,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:18:29,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:18:29,690 INFO L87 Difference]: Start difference. First operand 162295 states and 226844 transitions. Second operand 7 states.