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.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:15:32,097 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:15:32,099 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:15:32,110 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:15:32,111 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:15:32,112 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:15:32,113 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:15:32,115 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:15:32,116 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:15:32,117 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:15:32,118 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:15:32,119 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:15:32,120 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:15:32,121 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:15:32,122 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:15:32,123 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:15:32,123 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:15:32,124 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:15:32,126 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:15:32,128 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:15:32,130 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:15:32,131 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:15:32,132 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:15:32,133 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:15:32,135 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:15:32,136 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:15:32,136 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:15:32,137 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:15:32,137 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:15:32,138 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:15:32,139 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:15:32,139 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:15:32,140 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:15:32,141 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:15:32,142 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:15:32,142 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:15:32,143 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:15:32,143 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:15:32,143 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:15:32,144 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:15:32,144 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:15:32,145 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:15:32,160 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:15:32,161 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:15:32,162 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:15:32,162 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:15:32,162 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:15:32,162 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:15:32,163 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:15:32,163 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:15:32,163 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:15:32,163 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:15:32,163 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:15:32,164 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:15:32,164 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:15:32,164 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:15:32,164 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:15:32,164 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:15:32,165 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:15:32,165 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:15:32,165 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:15:32,165 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:15:32,165 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:15:32,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:15:32,166 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:15:32,166 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:15:32,166 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:15:32,166 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:15:32,167 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:15:32,167 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:15:32,167 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:15:32,195 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:15:32,207 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:15:32,213 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:15:32,215 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:15:32,215 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:15:32,216 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.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 11:15:32,291 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01282f99e/0be7dd88c3bc4a0bb9ccfd2f0f6d475f/FLAG47d295558 [2019-09-08 11:15:32,795 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:15:32,795 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 11:15:32,818 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01282f99e/0be7dd88c3bc4a0bb9ccfd2f0f6d475f/FLAG47d295558 [2019-09-08 11:15:33,137 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01282f99e/0be7dd88c3bc4a0bb9ccfd2f0f6d475f [2019-09-08 11:15:33,147 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:15:33,149 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:15:33,150 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:15:33,150 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:15:33,153 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:15:33,154 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:15:33" (1/1) ... [2019-09-08 11:15:33,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15c543e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:15:33, skipping insertion in model container [2019-09-08 11:15:33,157 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:15:33" (1/1) ... [2019-09-08 11:15:33,164 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:15:33,226 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:15:33,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:15:33,821 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:15:33,926 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:15:33,948 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:15:33,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:15:33 WrapperNode [2019-09-08 11:15:33,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:15:33,949 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:15:33,950 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:15:33,950 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:15:33,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:15:33" (1/1) ... [2019-09-08 11:15:33,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:15:33" (1/1) ... [2019-09-08 11:15:33,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:15:33" (1/1) ... [2019-09-08 11:15:33,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:15:33" (1/1) ... [2019-09-08 11:15:34,026 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:15:33" (1/1) ... [2019-09-08 11:15:34,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:15:33" (1/1) ... [2019-09-08 11:15:34,066 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:15:33" (1/1) ... [2019-09-08 11:15:34,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:15:34,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:15:34,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:15:34,076 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:15:34,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:15:33" (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:15:34,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:15:34,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:15:34,147 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:15:34,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:15:34,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:15:34,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:15:34,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 11:15:34,149 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:15:34,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:15:34,150 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:15:34,150 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:15:34,151 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:15:34,151 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:15:34,151 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:15:34,152 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:15:34,152 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 11:15:34,154 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:15:34,154 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:15:34,154 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:15:34,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:15:34,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:15:35,209 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:15:35,210 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:15:35,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:15:35 BoogieIcfgContainer [2019-09-08 11:15:35,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:15:35,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:15:35,230 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:15:35,233 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:15:35,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:15:33" (1/3) ... [2019-09-08 11:15:35,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5448ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:15:35, skipping insertion in model container [2019-09-08 11:15:35,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:15:33" (2/3) ... [2019-09-08 11:15:35,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5448ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:15:35, skipping insertion in model container [2019-09-08 11:15:35,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:15:35" (3/3) ... [2019-09-08 11:15:35,237 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 11:15:35,248 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:15:35,257 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 11:15:35,276 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 11:15:35,318 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:15:35,318 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:15:35,319 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:15:35,319 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:15:35,319 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:15:35,319 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:15:35,320 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:15:35,320 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:15:35,320 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:15:35,344 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states. [2019-09-08 11:15:35,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 11:15:35,356 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:35,357 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:15:35,359 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:35,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:35,363 INFO L82 PathProgramCache]: Analyzing trace with hash 2015518254, now seen corresponding path program 1 times [2019-09-08 11:15:35,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:35,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:35,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:35,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:35,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:35,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:15:35,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:35,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:15:35,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:15:35,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:15:35,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:15:35,865 INFO L87 Difference]: Start difference. First operand 220 states. Second operand 3 states. [2019-09-08 11:15:36,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:36,078 INFO L93 Difference]: Finished difference Result 443 states and 725 transitions. [2019-09-08 11:15:36,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:15:36,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-08 11:15:36,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:36,110 INFO L225 Difference]: With dead ends: 443 [2019-09-08 11:15:36,110 INFO L226 Difference]: Without dead ends: 332 [2019-09-08 11:15:36,118 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:15:36,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-08 11:15:36,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2019-09-08 11:15:36,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-09-08 11:15:36,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 494 transitions. [2019-09-08 11:15:36,196 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 494 transitions. Word has length 84 [2019-09-08 11:15:36,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:36,197 INFO L475 AbstractCegarLoop]: Abstraction has 330 states and 494 transitions. [2019-09-08 11:15:36,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:15:36,197 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 494 transitions. [2019-09-08 11:15:36,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:15:36,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:36,202 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:15:36,202 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:36,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:36,203 INFO L82 PathProgramCache]: Analyzing trace with hash 2072558176, now seen corresponding path program 1 times [2019-09-08 11:15:36,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:36,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:36,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:36,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:36,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:36,579 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:15:36,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:36,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:15:36,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:15:36,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:15:36,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:15:36,583 INFO L87 Difference]: Start difference. First operand 330 states and 494 transitions. Second operand 7 states. [2019-09-08 11:15:36,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:36,973 INFO L93 Difference]: Finished difference Result 1416 states and 2196 transitions. [2019-09-08 11:15:36,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 11:15:36,973 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2019-09-08 11:15:36,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:36,980 INFO L225 Difference]: With dead ends: 1416 [2019-09-08 11:15:36,981 INFO L226 Difference]: Without dead ends: 1170 [2019-09-08 11:15:36,984 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:15:36,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-09-08 11:15:37,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1162. [2019-09-08 11:15:37,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1162 states. [2019-09-08 11:15:37,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1795 transitions. [2019-09-08 11:15:37,063 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1795 transitions. Word has length 85 [2019-09-08 11:15:37,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:37,066 INFO L475 AbstractCegarLoop]: Abstraction has 1162 states and 1795 transitions. [2019-09-08 11:15:37,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:15:37,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1795 transitions. [2019-09-08 11:15:37,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 11:15:37,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:37,078 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:15:37,079 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:37,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:37,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1529357462, now seen corresponding path program 1 times [2019-09-08 11:15:37,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:37,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:37,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:37,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:37,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:37,237 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:15:37,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:37,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:15:37,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:15:37,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:15:37,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:15:37,240 INFO L87 Difference]: Start difference. First operand 1162 states and 1795 transitions. Second operand 6 states. [2019-09-08 11:15:37,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:37,797 INFO L93 Difference]: Finished difference Result 3974 states and 6233 transitions. [2019-09-08 11:15:37,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:15:37,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-09-08 11:15:37,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:37,816 INFO L225 Difference]: With dead ends: 3974 [2019-09-08 11:15:37,817 INFO L226 Difference]: Without dead ends: 2874 [2019-09-08 11:15:37,820 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:15:37,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2874 states. [2019-09-08 11:15:37,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2874 to 2870. [2019-09-08 11:15:37,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2870 states. [2019-09-08 11:15:37,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2870 states to 2870 states and 4490 transitions. [2019-09-08 11:15:37,975 INFO L78 Accepts]: Start accepts. Automaton has 2870 states and 4490 transitions. Word has length 86 [2019-09-08 11:15:37,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:37,975 INFO L475 AbstractCegarLoop]: Abstraction has 2870 states and 4490 transitions. [2019-09-08 11:15:37,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:15:37,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2870 states and 4490 transitions. [2019-09-08 11:15:37,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 11:15:37,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:37,980 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:15:37,981 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:37,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:37,981 INFO L82 PathProgramCache]: Analyzing trace with hash 792250185, now seen corresponding path program 1 times [2019-09-08 11:15:37,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:37,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:37,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:37,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:37,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:38,136 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:15:38,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:38,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:15:38,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:15:38,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:15:38,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:15:38,139 INFO L87 Difference]: Start difference. First operand 2870 states and 4490 transitions. Second operand 5 states. [2019-09-08 11:15:38,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:38,760 INFO L93 Difference]: Finished difference Result 7907 states and 12459 transitions. [2019-09-08 11:15:38,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:15:38,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-08 11:15:38,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:38,786 INFO L225 Difference]: With dead ends: 7907 [2019-09-08 11:15:38,787 INFO L226 Difference]: Without dead ends: 5186 [2019-09-08 11:15:38,793 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:15:38,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states. [2019-09-08 11:15:39,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 5184. [2019-09-08 11:15:39,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5184 states. [2019-09-08 11:15:39,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5184 states to 5184 states and 8126 transitions. [2019-09-08 11:15:39,157 INFO L78 Accepts]: Start accepts. Automaton has 5184 states and 8126 transitions. Word has length 86 [2019-09-08 11:15:39,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:39,158 INFO L475 AbstractCegarLoop]: Abstraction has 5184 states and 8126 transitions. [2019-09-08 11:15:39,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:15:39,159 INFO L276 IsEmpty]: Start isEmpty. Operand 5184 states and 8126 transitions. [2019-09-08 11:15:39,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 11:15:39,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:39,163 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:15:39,163 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:39,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:39,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1699352504, now seen corresponding path program 1 times [2019-09-08 11:15:39,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:39,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:39,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:39,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:39,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:39,277 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:15:39,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:39,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:15:39,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:15:39,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:15:39,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:15:39,279 INFO L87 Difference]: Start difference. First operand 5184 states and 8126 transitions. Second operand 5 states. [2019-09-08 11:15:40,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:40,148 INFO L93 Difference]: Finished difference Result 14903 states and 23439 transitions. [2019-09-08 11:15:40,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:15:40,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-08 11:15:40,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:40,197 INFO L225 Difference]: With dead ends: 14903 [2019-09-08 11:15:40,197 INFO L226 Difference]: Without dead ends: 9834 [2019-09-08 11:15:40,214 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:15:40,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9834 states. [2019-09-08 11:15:40,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9834 to 9832. [2019-09-08 11:15:40,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9832 states. [2019-09-08 11:15:40,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9832 states to 9832 states and 15381 transitions. [2019-09-08 11:15:40,789 INFO L78 Accepts]: Start accepts. Automaton has 9832 states and 15381 transitions. Word has length 86 [2019-09-08 11:15:40,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:40,789 INFO L475 AbstractCegarLoop]: Abstraction has 9832 states and 15381 transitions. [2019-09-08 11:15:40,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:15:40,790 INFO L276 IsEmpty]: Start isEmpty. Operand 9832 states and 15381 transitions. [2019-09-08 11:15:40,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 11:15:40,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:40,794 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:15:40,794 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:40,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:40,795 INFO L82 PathProgramCache]: Analyzing trace with hash -327564249, now seen corresponding path program 1 times [2019-09-08 11:15:40,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:40,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:40,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:40,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:40,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:40,881 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:15:40,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:40,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:15:40,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:15:40,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:15:40,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:15:40,883 INFO L87 Difference]: Start difference. First operand 9832 states and 15381 transitions. Second operand 5 states. [2019-09-08 11:15:41,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:41,992 INFO L93 Difference]: Finished difference Result 28975 states and 45414 transitions. [2019-09-08 11:15:41,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:15:41,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-08 11:15:41,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:42,062 INFO L225 Difference]: With dead ends: 28975 [2019-09-08 11:15:42,062 INFO L226 Difference]: Without dead ends: 19228 [2019-09-08 11:15:42,087 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:15:42,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19228 states. [2019-09-08 11:15:43,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19228 to 19226. [2019-09-08 11:15:43,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19226 states. [2019-09-08 11:15:43,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19226 states to 19226 states and 29963 transitions. [2019-09-08 11:15:43,071 INFO L78 Accepts]: Start accepts. Automaton has 19226 states and 29963 transitions. Word has length 86 [2019-09-08 11:15:43,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:43,072 INFO L475 AbstractCegarLoop]: Abstraction has 19226 states and 29963 transitions. [2019-09-08 11:15:43,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:15:43,072 INFO L276 IsEmpty]: Start isEmpty. Operand 19226 states and 29963 transitions. [2019-09-08 11:15:43,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 11:15:43,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:43,078 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:15:43,078 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:43,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:43,079 INFO L82 PathProgramCache]: Analyzing trace with hash 2020962565, now seen corresponding path program 1 times [2019-09-08 11:15:43,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:43,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:43,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:43,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:43,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:43,160 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:15:43,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:43,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:15:43,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:15:43,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:15:43,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:15:43,162 INFO L87 Difference]: Start difference. First operand 19226 states and 29963 transitions. Second operand 5 states. [2019-09-08 11:15:45,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:45,008 INFO L93 Difference]: Finished difference Result 54118 states and 84425 transitions. [2019-09-08 11:15:45,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:15:45,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-08 11:15:45,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:45,092 INFO L225 Difference]: With dead ends: 54118 [2019-09-08 11:15:45,092 INFO L226 Difference]: Without dead ends: 34938 [2019-09-08 11:15:45,128 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:15:45,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34938 states. [2019-09-08 11:15:46,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34938 to 34936. [2019-09-08 11:15:46,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34936 states. [2019-09-08 11:15:46,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34936 states to 34936 states and 54077 transitions. [2019-09-08 11:15:46,466 INFO L78 Accepts]: Start accepts. Automaton has 34936 states and 54077 transitions. Word has length 86 [2019-09-08 11:15:46,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:46,466 INFO L475 AbstractCegarLoop]: Abstraction has 34936 states and 54077 transitions. [2019-09-08 11:15:46,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:15:46,466 INFO L276 IsEmpty]: Start isEmpty. Operand 34936 states and 54077 transitions. [2019-09-08 11:15:46,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:15:46,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:46,474 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:15:46,475 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:46,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:46,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1584577227, now seen corresponding path program 1 times [2019-09-08 11:15:46,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:46,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:46,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:46,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:46,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:46,565 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:15:46,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:46,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:15:46,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:15:46,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:15:46,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:15:46,567 INFO L87 Difference]: Start difference. First operand 34936 states and 54077 transitions. Second operand 5 states. [2019-09-08 11:15:49,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:49,071 INFO L93 Difference]: Finished difference Result 65274 states and 100550 transitions. [2019-09-08 11:15:49,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:15:49,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-08 11:15:49,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:49,190 INFO L225 Difference]: With dead ends: 65274 [2019-09-08 11:15:49,190 INFO L226 Difference]: Without dead ends: 65272 [2019-09-08 11:15:49,207 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:15:49,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65272 states. [2019-09-08 11:15:50,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65272 to 35368. [2019-09-08 11:15:50,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35368 states. [2019-09-08 11:15:50,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35368 states to 35368 states and 54509 transitions. [2019-09-08 11:15:50,965 INFO L78 Accepts]: Start accepts. Automaton has 35368 states and 54509 transitions. Word has length 87 [2019-09-08 11:15:50,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:50,966 INFO L475 AbstractCegarLoop]: Abstraction has 35368 states and 54509 transitions. [2019-09-08 11:15:50,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:15:50,966 INFO L276 IsEmpty]: Start isEmpty. Operand 35368 states and 54509 transitions. [2019-09-08 11:15:50,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:15:50,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:50,975 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:15:50,976 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:50,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:50,976 INFO L82 PathProgramCache]: Analyzing trace with hash -2139259668, now seen corresponding path program 1 times [2019-09-08 11:15:50,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:50,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:50,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:50,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:50,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:51,222 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:15:51,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:51,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:15:51,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:15:51,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:15:51,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:15:51,223 INFO L87 Difference]: Start difference. First operand 35368 states and 54509 transitions. Second operand 10 states. [2019-09-08 11:16:06,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:16:06,808 INFO L93 Difference]: Finished difference Result 316946 states and 488795 transitions. [2019-09-08 11:16:06,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 11:16:06,810 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-09-08 11:16:06,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:16:07,340 INFO L225 Difference]: With dead ends: 316946 [2019-09-08 11:16:07,340 INFO L226 Difference]: Without dead ends: 287888 [2019-09-08 11:16:07,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=380, Invalid=1180, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 11:16:07,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287888 states. [2019-09-08 11:16:11,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287888 to 35603. [2019-09-08 11:16:11,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35603 states. [2019-09-08 11:16:11,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35603 states to 35603 states and 54806 transitions. [2019-09-08 11:16:11,170 INFO L78 Accepts]: Start accepts. Automaton has 35603 states and 54806 transitions. Word has length 88 [2019-09-08 11:16:11,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:16:11,170 INFO L475 AbstractCegarLoop]: Abstraction has 35603 states and 54806 transitions. [2019-09-08 11:16:11,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:16:11,170 INFO L276 IsEmpty]: Start isEmpty. Operand 35603 states and 54806 transitions. [2019-09-08 11:16:11,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:16:11,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:16:11,182 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:16:11,182 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:16:11,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:16:11,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1011869172, now seen corresponding path program 1 times [2019-09-08 11:16:11,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:16:11,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:16:11,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:16:11,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:16:11,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:16:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:16:11,429 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:11,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:16:11,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:16:11,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:16:11,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:16:11,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:16:11,431 INFO L87 Difference]: Start difference. First operand 35603 states and 54806 transitions. Second operand 10 states. [2019-09-08 11:16:25,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:16:25,139 INFO L93 Difference]: Finished difference Result 188966 states and 289563 transitions. [2019-09-08 11:16:25,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 11:16:25,139 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-09-08 11:16:25,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:16:25,437 INFO L225 Difference]: With dead ends: 188966 [2019-09-08 11:16:25,437 INFO L226 Difference]: Without dead ends: 184530 [2019-09-08 11:16:25,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=234, Invalid=696, Unknown=0, NotChecked=0, Total=930 [2019-09-08 11:16:25,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184530 states. [2019-09-08 11:16:28,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184530 to 35603. [2019-09-08 11:16:28,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35603 states. [2019-09-08 11:16:28,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35603 states to 35603 states and 54804 transitions. [2019-09-08 11:16:28,749 INFO L78 Accepts]: Start accepts. Automaton has 35603 states and 54804 transitions. Word has length 88 [2019-09-08 11:16:28,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:16:28,749 INFO L475 AbstractCegarLoop]: Abstraction has 35603 states and 54804 transitions. [2019-09-08 11:16:28,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:16:28,749 INFO L276 IsEmpty]: Start isEmpty. Operand 35603 states and 54804 transitions. [2019-09-08 11:16:28,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:16:28,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:16:28,757 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:16:28,758 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:16:28,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:16:28,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1484118612, now seen corresponding path program 1 times [2019-09-08 11:16:28,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:16:28,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:16:28,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:16:28,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:16:28,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:16:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:16:28,964 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:28,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:16:28,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:16:28,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:16:28,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:16:28,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:16:28,965 INFO L87 Difference]: Start difference. First operand 35603 states and 54804 transitions. Second operand 10 states. [2019-09-08 11:16:39,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:16:39,592 INFO L93 Difference]: Finished difference Result 120863 states and 183928 transitions. [2019-09-08 11:16:39,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 11:16:39,592 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-09-08 11:16:39,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:16:39,736 INFO L225 Difference]: With dead ends: 120863 [2019-09-08 11:16:39,736 INFO L226 Difference]: Without dead ends: 108237 [2019-09-08 11:16:39,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=247, Invalid=683, Unknown=0, NotChecked=0, Total=930 [2019-09-08 11:16:39,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108237 states. [2019-09-08 11:16:44,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108237 to 36251. [2019-09-08 11:16:44,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36251 states. [2019-09-08 11:16:44,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36251 states to 36251 states and 55744 transitions. [2019-09-08 11:16:44,519 INFO L78 Accepts]: Start accepts. Automaton has 36251 states and 55744 transitions. Word has length 88 [2019-09-08 11:16:44,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:16:44,519 INFO L475 AbstractCegarLoop]: Abstraction has 36251 states and 55744 transitions. [2019-09-08 11:16:44,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:16:44,519 INFO L276 IsEmpty]: Start isEmpty. Operand 36251 states and 55744 transitions. [2019-09-08 11:16:44,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:16:44,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:16:44,529 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:16:44,529 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:16:44,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:16:44,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1369706164, now seen corresponding path program 1 times [2019-09-08 11:16:44,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:16:44,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:16:44,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:16:44,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:16:44,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:16:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:16:44,757 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:44,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:16:44,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:16:44,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:16:44,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:16:44,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:16:44,759 INFO L87 Difference]: Start difference. First operand 36251 states and 55744 transitions. Second operand 10 states. [2019-09-08 11:17:06,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:17:06,981 INFO L93 Difference]: Finished difference Result 250693 states and 383137 transitions. [2019-09-08 11:17:06,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 11:17:06,982 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-09-08 11:17:06,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:17:07,293 INFO L225 Difference]: With dead ends: 250693 [2019-09-08 11:17:07,293 INFO L226 Difference]: Without dead ends: 230103 [2019-09-08 11:17:07,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 11:17:07,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230103 states. [2019-09-08 11:17:15,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230103 to 36999. [2019-09-08 11:17:15,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36999 states. [2019-09-08 11:17:15,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36999 states to 36999 states and 56725 transitions. [2019-09-08 11:17:15,057 INFO L78 Accepts]: Start accepts. Automaton has 36999 states and 56725 transitions. Word has length 88 [2019-09-08 11:17:15,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:17:15,058 INFO L475 AbstractCegarLoop]: Abstraction has 36999 states and 56725 transitions. [2019-09-08 11:17:15,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:17:15,058 INFO L276 IsEmpty]: Start isEmpty. Operand 36999 states and 56725 transitions. [2019-09-08 11:17:15,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:17:15,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:17:15,069 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:17:15,069 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:17:15,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:17:15,070 INFO L82 PathProgramCache]: Analyzing trace with hash -28915572, now seen corresponding path program 1 times [2019-09-08 11:17:15,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:17:15,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:17:15,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:15,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:17:15,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:17:15,286 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:17:15,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:17:15,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:17:15,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:17:15,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:17:15,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:17:15,287 INFO L87 Difference]: Start difference. First operand 36999 states and 56725 transitions. Second operand 10 states. [2019-09-08 11:17:43,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:17:43,316 INFO L93 Difference]: Finished difference Result 277581 states and 423188 transitions. [2019-09-08 11:17:43,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 11:17:43,316 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-09-08 11:17:43,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:17:43,694 INFO L225 Difference]: With dead ends: 277581 [2019-09-08 11:17:43,695 INFO L226 Difference]: Without dead ends: 242627 [2019-09-08 11:17:43,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 11:17:43,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242627 states. [2019-09-08 11:17:49,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242627 to 37374. [2019-09-08 11:17:49,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37374 states. [2019-09-08 11:17:49,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37374 states to 37374 states and 57159 transitions. [2019-09-08 11:17:49,527 INFO L78 Accepts]: Start accepts. Automaton has 37374 states and 57159 transitions. Word has length 88 [2019-09-08 11:17:49,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:17:49,527 INFO L475 AbstractCegarLoop]: Abstraction has 37374 states and 57159 transitions. [2019-09-08 11:17:49,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:17:49,527 INFO L276 IsEmpty]: Start isEmpty. Operand 37374 states and 57159 transitions. [2019-09-08 11:17:49,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:17:49,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:17:49,536 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:17:49,536 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:17:49,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:17:49,537 INFO L82 PathProgramCache]: Analyzing trace with hash -849303856, now seen corresponding path program 1 times [2019-09-08 11:17:49,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:17:49,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:17:49,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:49,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:17:49,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:17:49,593 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:17:49,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:17:49,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:17:49,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:17:49,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:17:49,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:17:49,595 INFO L87 Difference]: Start difference. First operand 37374 states and 57159 transitions. Second operand 3 states. [2019-09-08 11:17:56,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:17:56,382 INFO L93 Difference]: Finished difference Result 71930 states and 110405 transitions. [2019-09-08 11:17:56,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:17:56,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-08 11:17:56,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:17:56,433 INFO L225 Difference]: With dead ends: 71930 [2019-09-08 11:17:56,433 INFO L226 Difference]: Without dead ends: 47260 [2019-09-08 11:17:56,454 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:17:56,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47260 states. [2019-09-08 11:18:01,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47260 to 46898. [2019-09-08 11:18:01,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46898 states. [2019-09-08 11:18:01,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46898 states to 46898 states and 71057 transitions. [2019-09-08 11:18:01,736 INFO L78 Accepts]: Start accepts. Automaton has 46898 states and 71057 transitions. Word has length 89 [2019-09-08 11:18:01,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:18:01,737 INFO L475 AbstractCegarLoop]: Abstraction has 46898 states and 71057 transitions. [2019-09-08 11:18:01,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:18:01,737 INFO L276 IsEmpty]: Start isEmpty. Operand 46898 states and 71057 transitions. [2019-09-08 11:18:01,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:18:01,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:18:01,747 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:18:01,747 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:18:01,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:18:01,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1873505628, now seen corresponding path program 1 times [2019-09-08 11:18:01,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:18:01,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:18:01,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:18:01,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:18:01,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:18:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:18:01,864 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:01,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:18:01,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 11:18:01,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 11:18:01,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 11:18:01,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:18:01,865 INFO L87 Difference]: Start difference. First operand 46898 states and 71057 transitions. Second operand 4 states. [2019-09-08 11:18:12,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:18:12,059 INFO L93 Difference]: Finished difference Result 129510 states and 196291 transitions. [2019-09-08 11:18:12,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:18:12,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-08 11:18:12,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:18:12,164 INFO L225 Difference]: With dead ends: 129510 [2019-09-08 11:18:12,164 INFO L226 Difference]: Without dead ends: 85804 [2019-09-08 11:18:12,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:18:12,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85804 states. [2019-09-08 11:18:22,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85804 to 85242. [2019-09-08 11:18:22,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85242 states. [2019-09-08 11:18:22,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85242 states to 85242 states and 128161 transitions. [2019-09-08 11:18:22,645 INFO L78 Accepts]: Start accepts. Automaton has 85242 states and 128161 transitions. Word has length 89 [2019-09-08 11:18:22,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:18:22,645 INFO L475 AbstractCegarLoop]: Abstraction has 85242 states and 128161 transitions. [2019-09-08 11:18:22,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 11:18:22,645 INFO L276 IsEmpty]: Start isEmpty. Operand 85242 states and 128161 transitions. [2019-09-08 11:18:22,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:18:22,654 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:18:22,654 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:18:22,654 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:18:22,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:18:22,655 INFO L82 PathProgramCache]: Analyzing trace with hash 354142704, now seen corresponding path program 1 times [2019-09-08 11:18:22,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:18:22,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:18:22,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:18:22,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:18:22,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:18:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:18:22,708 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:22,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:18:22,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:18:22,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:18:22,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:18:22,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:18:22,710 INFO L87 Difference]: Start difference. First operand 85242 states and 128161 transitions. Second operand 3 states. [2019-09-08 11:18:38,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:18:38,412 INFO L93 Difference]: Finished difference Result 193733 states and 291699 transitions. [2019-09-08 11:18:38,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:18:38,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-08 11:18:38,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:18:38,583 INFO L225 Difference]: With dead ends: 193733 [2019-09-08 11:18:38,583 INFO L226 Difference]: Without dead ends: 116317 [2019-09-08 11:18:38,646 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:18:38,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116317 states. [2019-09-08 11:18:55,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116317 to 116051. [2019-09-08 11:18:55,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116051 states. [2019-09-08 11:18:55,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116051 states to 116051 states and 173010 transitions. [2019-09-08 11:18:55,456 INFO L78 Accepts]: Start accepts. Automaton has 116051 states and 173010 transitions. Word has length 89 [2019-09-08 11:18:55,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:18:55,456 INFO L475 AbstractCegarLoop]: Abstraction has 116051 states and 173010 transitions. [2019-09-08 11:18:55,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:18:55,456 INFO L276 IsEmpty]: Start isEmpty. Operand 116051 states and 173010 transitions. [2019-09-08 11:18:55,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:18:55,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:18:55,466 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:18:55,466 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:18:55,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:18:55,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1105953187, now seen corresponding path program 1 times [2019-09-08 11:18:55,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:18:55,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:18:55,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:18:55,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:18:55,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:18:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:18:55,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:18:55,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:18:55,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:18:55,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:18:55,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:18:55,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:18:55,526 INFO L87 Difference]: Start difference. First operand 116051 states and 173010 transitions. Second operand 3 states. [2019-09-08 11:19:12,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:19:12,203 INFO L93 Difference]: Finished difference Result 161607 states and 240358 transitions. [2019-09-08 11:19:12,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:19:12,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-08 11:19:12,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:19:12,362 INFO L225 Difference]: With dead ends: 161607 [2019-09-08 11:19:12,363 INFO L226 Difference]: Without dead ends: 128265 [2019-09-08 11:19:12,397 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:19:12,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128265 states. [2019-09-08 11:19:30,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128265 to 113445. [2019-09-08 11:19:30,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113445 states. [2019-09-08 11:19:30,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113445 states to 113445 states and 166584 transitions. [2019-09-08 11:19:30,204 INFO L78 Accepts]: Start accepts. Automaton has 113445 states and 166584 transitions. Word has length 89 [2019-09-08 11:19:30,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:19:30,204 INFO L475 AbstractCegarLoop]: Abstraction has 113445 states and 166584 transitions. [2019-09-08 11:19:30,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:19:30,204 INFO L276 IsEmpty]: Start isEmpty. Operand 113445 states and 166584 transitions. [2019-09-08 11:19:30,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:19:30,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:19:30,215 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:19:30,215 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:19:30,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:19:30,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1939422446, now seen corresponding path program 1 times [2019-09-08 11:19:30,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:19:30,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:19:30,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:19:30,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:19:30,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:19:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:19:30,262 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:19:30,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:19:30,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:19:30,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:19:30,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:19:30,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:19:30,263 INFO L87 Difference]: Start difference. First operand 113445 states and 166584 transitions. Second operand 3 states. [2019-09-08 11:19:47,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:19:47,349 INFO L93 Difference]: Finished difference Result 181000 states and 265502 transitions. [2019-09-08 11:19:47,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:19:47,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-08 11:19:47,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:19:47,519 INFO L225 Difference]: With dead ends: 181000 [2019-09-08 11:19:47,519 INFO L226 Difference]: Without dead ends: 120934 [2019-09-08 11:19:47,572 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:19:47,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120934 states. [2019-09-08 11:20:06,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120934 to 119740. [2019-09-08 11:20:06,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119740 states. [2019-09-08 11:20:06,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119740 states to 119740 states and 172602 transitions. [2019-09-08 11:20:06,863 INFO L78 Accepts]: Start accepts. Automaton has 119740 states and 172602 transitions. Word has length 89 [2019-09-08 11:20:06,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:20:06,863 INFO L475 AbstractCegarLoop]: Abstraction has 119740 states and 172602 transitions. [2019-09-08 11:20:06,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:20:06,863 INFO L276 IsEmpty]: Start isEmpty. Operand 119740 states and 172602 transitions. [2019-09-08 11:20:06,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:20:06,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:20:06,870 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:20:06,870 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:20:06,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:20:06,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1377715858, now seen corresponding path program 1 times [2019-09-08 11:20:06,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:20:06,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:20:06,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:20:06,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:20:06,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:20:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:20:06,918 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:20:06,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:20:06,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:20:06,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:20:06,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:20:06,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:20:06,920 INFO L87 Difference]: Start difference. First operand 119740 states and 172602 transitions. Second operand 3 states. [2019-09-08 11:20:34,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:20:34,531 INFO L93 Difference]: Finished difference Result 275294 states and 396384 transitions. [2019-09-08 11:20:34,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:20:34,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-08 11:20:34,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:20:34,783 INFO L225 Difference]: With dead ends: 275294 [2019-09-08 11:20:34,783 INFO L226 Difference]: Without dead ends: 163297 [2019-09-08 11:20:34,877 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:20:35,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163297 states. [2019-09-08 11:20:58,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163297 to 161959. [2019-09-08 11:20:58,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161959 states. [2019-09-08 11:20:59,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161959 states to 161959 states and 229720 transitions. [2019-09-08 11:20:59,053 INFO L78 Accepts]: Start accepts. Automaton has 161959 states and 229720 transitions. Word has length 89 [2019-09-08 11:20:59,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:20:59,054 INFO L475 AbstractCegarLoop]: Abstraction has 161959 states and 229720 transitions. [2019-09-08 11:20:59,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:20:59,054 INFO L276 IsEmpty]: Start isEmpty. Operand 161959 states and 229720 transitions. [2019-09-08 11:20:59,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:20:59,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:20:59,060 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:20:59,060 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:20:59,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:20:59,060 INFO L82 PathProgramCache]: Analyzing trace with hash -2021811832, now seen corresponding path program 1 times [2019-09-08 11:20:59,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:20:59,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:20:59,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:20:59,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:20:59,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:20:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:20:59,152 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:20:59,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:20:59,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:20:59,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:20:59,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:20:59,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:20:59,154 INFO L87 Difference]: Start difference. First operand 161959 states and 229720 transitions. Second operand 7 states. [2019-09-08 11:23:06,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:23:06,936 INFO L93 Difference]: Finished difference Result 833264 states and 1175369 transitions. [2019-09-08 11:23:06,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:23:06,937 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-08 11:23:06,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:23:08,098 INFO L225 Difference]: With dead ends: 833264 [2019-09-08 11:23:08,098 INFO L226 Difference]: Without dead ends: 736203 [2019-09-08 11:23:08,246 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:23:08,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736203 states. [2019-09-08 11:23:44,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736203 to 162171. [2019-09-08 11:23:44,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162171 states. [2019-09-08 11:23:45,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162171 states to 162171 states and 229975 transitions. [2019-09-08 11:23:45,025 INFO L78 Accepts]: Start accepts. Automaton has 162171 states and 229975 transitions. Word has length 90 [2019-09-08 11:23:45,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:23:45,025 INFO L475 AbstractCegarLoop]: Abstraction has 162171 states and 229975 transitions. [2019-09-08 11:23:45,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:23:45,025 INFO L276 IsEmpty]: Start isEmpty. Operand 162171 states and 229975 transitions. [2019-09-08 11:23:45,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:23:45,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:23:45,031 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:23:45,031 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:23:45,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:23:45,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1199896505, now seen corresponding path program 1 times [2019-09-08 11:23:45,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:23:45,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:23:45,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:45,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:23:45,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:23:45,129 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:23:45,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:23:45,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:23:45,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:23:45,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:23:45,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:23:45,131 INFO L87 Difference]: Start difference. First operand 162171 states and 229975 transitions. Second operand 7 states. [2019-09-08 11:25:18,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:18,703 INFO L93 Difference]: Finished difference Result 536246 states and 754963 transitions. [2019-09-08 11:25:18,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:25:18,703 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-08 11:25:18,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:19,466 INFO L225 Difference]: With dead ends: 536246 [2019-09-08 11:25:19,467 INFO L226 Difference]: Without dead ends: 501747 [2019-09-08 11:25:19,561 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:25:19,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501747 states. [2019-09-08 11:26:03,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501747 to 204061. [2019-09-08 11:26:03,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204061 states. [2019-09-08 11:26:04,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204061 states to 204061 states and 288843 transitions. [2019-09-08 11:26:04,145 INFO L78 Accepts]: Start accepts. Automaton has 204061 states and 288843 transitions. Word has length 90 [2019-09-08 11:26:04,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:26:04,146 INFO L475 AbstractCegarLoop]: Abstraction has 204061 states and 288843 transitions. [2019-09-08 11:26:04,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:26:04,146 INFO L276 IsEmpty]: Start isEmpty. Operand 204061 states and 288843 transitions. [2019-09-08 11:26:04,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:26:04,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:26:04,153 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:26:04,153 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:26:04,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:26:04,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1439056758, now seen corresponding path program 1 times [2019-09-08 11:26:04,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:26:04,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:26:04,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:26:04,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:26:04,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:26:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:26:04,242 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:26:04,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:26:04,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:26:04,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:26:04,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:26:04,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:26:04,243 INFO L87 Difference]: Start difference. First operand 204061 states and 288843 transitions. Second operand 7 states.