java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:10:48,015 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:10:48,017 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:10:48,030 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:10:48,030 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:10:48,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:10:48,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:10:48,035 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:10:48,036 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:10:48,037 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:10:48,038 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:10:48,039 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:10:48,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:10:48,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:10:48,041 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:10:48,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:10:48,043 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:10:48,044 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:10:48,046 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:10:48,048 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:10:48,049 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:10:48,050 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:10:48,051 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:10:48,052 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:10:48,055 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:10:48,056 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:10:48,056 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:10:48,058 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:10:48,059 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:10:48,061 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:10:48,061 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:10:48,062 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:10:48,063 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:10:48,064 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:10:48,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:10:48,066 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:10:48,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:10:48,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:10:48,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:10:48,071 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:10:48,072 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:10:48,074 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 11:10:48,094 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:10:48,094 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:10:48,096 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:10:48,096 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:10:48,096 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:10:48,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:10:48,097 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:10:48,097 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:10:48,097 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:10:48,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:10:48,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:10:48,098 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:10:48,098 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:10:48,098 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:10:48,098 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:10:48,098 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:10:48,099 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:10:48,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:10:48,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:10:48,099 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:10:48,099 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:10:48,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:10:48,100 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:10:48,100 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:10:48,100 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:10:48,100 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:10:48,101 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:10:48,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:10:48,101 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:10:48,134 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:10:48,155 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:10:48,160 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:10:48,162 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:10:48,169 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:10:48,170 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 11:10:48,248 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4429efee7/e9bbbb6bc4c542d7b4eea61b37ceeae7/FLAG93c285e40 [2019-09-08 11:10:48,831 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:10:48,832 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 11:10:48,853 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4429efee7/e9bbbb6bc4c542d7b4eea61b37ceeae7/FLAG93c285e40 [2019-09-08 11:10:49,112 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4429efee7/e9bbbb6bc4c542d7b4eea61b37ceeae7 [2019-09-08 11:10:49,123 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:10:49,126 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:10:49,127 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:10:49,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:10:49,129 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:10:49,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:10:49" (1/1) ... [2019-09-08 11:10:49,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bee0674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:49, skipping insertion in model container [2019-09-08 11:10:49,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:10:49" (1/1) ... [2019-09-08 11:10:49,138 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:10:49,210 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:10:49,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:10:49,665 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:10:49,817 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:10:49,840 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:10:49,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:49 WrapperNode [2019-09-08 11:10:49,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:10:49,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:10:49,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:10:49,842 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:10:49,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:49" (1/1) ... [2019-09-08 11:10:49,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:49" (1/1) ... [2019-09-08 11:10:49,867 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:49" (1/1) ... [2019-09-08 11:10:49,868 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:49" (1/1) ... [2019-09-08 11:10:49,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:49" (1/1) ... [2019-09-08 11:10:49,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:49" (1/1) ... [2019-09-08 11:10:49,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:49" (1/1) ... [2019-09-08 11:10:49,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:10:49,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:10:49,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:10:49,912 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:10:49,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:49" (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:10:50,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:10:50,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:10:50,002 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:10:50,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:10:50,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:10:50,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:10:50,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 11:10:50,004 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:10:50,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:10:50,004 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:10:50,005 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:10:50,006 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:10:50,006 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:10:50,007 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:10:50,008 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:10:50,008 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 11:10:50,011 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:10:50,011 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:10:50,011 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:10:50,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:10:50,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:10:51,210 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:10:51,210 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:10:51,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:10:51 BoogieIcfgContainer [2019-09-08 11:10:51,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:10:51,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:10:51,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:10:51,219 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:10:51,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:10:49" (1/3) ... [2019-09-08 11:10:51,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41932b3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:10:51, skipping insertion in model container [2019-09-08 11:10:51,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:10:49" (2/3) ... [2019-09-08 11:10:51,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41932b3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:10:51, skipping insertion in model container [2019-09-08 11:10:51,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:10:51" (3/3) ... [2019-09-08 11:10:51,227 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 11:10:51,236 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:10:51,244 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 11:10:51,262 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 11:10:51,293 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:10:51,294 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:10:51,294 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:10:51,294 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:10:51,295 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:10:51,295 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:10:51,295 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:10:51,295 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:10:51,295 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:10:51,324 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states. [2019-09-08 11:10:51,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:10:51,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:51,335 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] [2019-09-08 11:10:51,337 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:51,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:51,342 INFO L82 PathProgramCache]: Analyzing trace with hash 777422935, now seen corresponding path program 1 times [2019-09-08 11:10:51,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:51,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:51,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:51,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:51,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:51,859 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:10:51,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:10:51,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:10:51,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:10:51,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:10:51,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:10:51,888 INFO L87 Difference]: Start difference. First operand 211 states. Second operand 3 states. [2019-09-08 11:10:52,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:52,088 INFO L93 Difference]: Finished difference Result 424 states and 694 transitions. [2019-09-08 11:10:52,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:10:52,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-08 11:10:52,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:52,116 INFO L225 Difference]: With dead ends: 424 [2019-09-08 11:10:52,117 INFO L226 Difference]: Without dead ends: 318 [2019-09-08 11:10:52,125 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:10:52,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-08 11:10:52,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 316. [2019-09-08 11:10:52,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-09-08 11:10:52,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 472 transitions. [2019-09-08 11:10:52,203 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 472 transitions. Word has length 83 [2019-09-08 11:10:52,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:10:52,204 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 472 transitions. [2019-09-08 11:10:52,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:10:52,204 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 472 transitions. [2019-09-08 11:10:52,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 11:10:52,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:52,209 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:10:52,209 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:52,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:52,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1931111446, now seen corresponding path program 1 times [2019-09-08 11:10:52,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:52,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:52,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:52,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:52,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:52,612 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:10:52,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:10:52,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:10:52,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:10:52,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:10:52,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:10:52,617 INFO L87 Difference]: Start difference. First operand 316 states and 472 transitions. Second operand 7 states. [2019-09-08 11:10:53,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:53,108 INFO L93 Difference]: Finished difference Result 1362 states and 2110 transitions. [2019-09-08 11:10:53,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 11:10:53,108 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2019-09-08 11:10:53,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:53,116 INFO L225 Difference]: With dead ends: 1362 [2019-09-08 11:10:53,117 INFO L226 Difference]: Without dead ends: 1126 [2019-09-08 11:10:53,120 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:10:53,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2019-09-08 11:10:53,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1118. [2019-09-08 11:10:53,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1118 states. [2019-09-08 11:10:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1725 transitions. [2019-09-08 11:10:53,213 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1725 transitions. Word has length 84 [2019-09-08 11:10:53,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:10:53,215 INFO L475 AbstractCegarLoop]: Abstraction has 1118 states and 1725 transitions. [2019-09-08 11:10:53,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:10:53,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1725 transitions. [2019-09-08 11:10:53,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:10:53,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:53,228 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:10:53,229 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:53,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:53,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1862792065, now seen corresponding path program 1 times [2019-09-08 11:10:53,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:53,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:53,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:53,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:53,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:53,374 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:10:53,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:10:53,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:10:53,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:10:53,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:10:53,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:10:53,376 INFO L87 Difference]: Start difference. First operand 1118 states and 1725 transitions. Second operand 5 states. [2019-09-08 11:10:53,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:53,807 INFO L93 Difference]: Finished difference Result 2885 states and 4513 transitions. [2019-09-08 11:10:53,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:10:53,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-08 11:10:53,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:53,827 INFO L225 Difference]: With dead ends: 2885 [2019-09-08 11:10:53,836 INFO L226 Difference]: Without dead ends: 1878 [2019-09-08 11:10:53,842 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:10:53,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2019-09-08 11:10:53,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1876. [2019-09-08 11:10:53,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1876 states. [2019-09-08 11:10:53,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 2913 transitions. [2019-09-08 11:10:53,982 INFO L78 Accepts]: Start accepts. Automaton has 1876 states and 2913 transitions. Word has length 85 [2019-09-08 11:10:53,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:10:53,982 INFO L475 AbstractCegarLoop]: Abstraction has 1876 states and 2913 transitions. [2019-09-08 11:10:53,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:10:53,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 2913 transitions. [2019-09-08 11:10:53,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:10:53,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:53,987 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:10:53,987 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:53,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:53,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1893816110, now seen corresponding path program 1 times [2019-09-08 11:10:53,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:53,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:53,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:53,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:53,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:54,142 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:10:54,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:10:54,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:10:54,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:10:54,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:10:54,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:10:54,144 INFO L87 Difference]: Start difference. First operand 1876 states and 2913 transitions. Second operand 5 states. [2019-09-08 11:10:54,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:54,643 INFO L93 Difference]: Finished difference Result 5109 states and 8024 transitions. [2019-09-08 11:10:54,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:10:54,644 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-08 11:10:54,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:54,664 INFO L225 Difference]: With dead ends: 5109 [2019-09-08 11:10:54,664 INFO L226 Difference]: Without dead ends: 3378 [2019-09-08 11:10:54,669 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:10:54,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3378 states. [2019-09-08 11:10:54,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3378 to 3376. [2019-09-08 11:10:54,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3376 states. [2019-09-08 11:10:54,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3376 states to 3376 states and 5270 transitions. [2019-09-08 11:10:54,903 INFO L78 Accepts]: Start accepts. Automaton has 3376 states and 5270 transitions. Word has length 85 [2019-09-08 11:10:54,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:10:54,904 INFO L475 AbstractCegarLoop]: Abstraction has 3376 states and 5270 transitions. [2019-09-08 11:10:54,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:10:54,904 INFO L276 IsEmpty]: Start isEmpty. Operand 3376 states and 5270 transitions. [2019-09-08 11:10:54,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:10:54,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:54,907 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:10:54,907 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:54,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:54,908 INFO L82 PathProgramCache]: Analyzing trace with hash 331647536, now seen corresponding path program 1 times [2019-09-08 11:10:54,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:54,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:54,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:54,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:54,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:55,013 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:10:55,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:10:55,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:10:55,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:10:55,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:10:55,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:10:55,015 INFO L87 Difference]: Start difference. First operand 3376 states and 5270 transitions. Second operand 5 states. [2019-09-08 11:10:55,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:55,649 INFO L93 Difference]: Finished difference Result 9727 states and 15263 transitions. [2019-09-08 11:10:55,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:10:55,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-08 11:10:55,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:55,694 INFO L225 Difference]: With dead ends: 9727 [2019-09-08 11:10:55,695 INFO L226 Difference]: Without dead ends: 6432 [2019-09-08 11:10:55,705 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:10:55,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6432 states. [2019-09-08 11:10:56,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6432 to 6430. [2019-09-08 11:10:56,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6430 states. [2019-09-08 11:10:56,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6430 states to 6430 states and 10032 transitions. [2019-09-08 11:10:56,176 INFO L78 Accepts]: Start accepts. Automaton has 6430 states and 10032 transitions. Word has length 85 [2019-09-08 11:10:56,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:10:56,177 INFO L475 AbstractCegarLoop]: Abstraction has 6430 states and 10032 transitions. [2019-09-08 11:10:56,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:10:56,177 INFO L276 IsEmpty]: Start isEmpty. Operand 6430 states and 10032 transitions. [2019-09-08 11:10:56,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:10:56,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:56,180 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:10:56,181 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:56,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:56,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1849994463, now seen corresponding path program 1 times [2019-09-08 11:10:56,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:56,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:56,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:56,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:56,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:56,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:10:56,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:10:56,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:10:56,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:10:56,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:10:56,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:10:56,303 INFO L87 Difference]: Start difference. First operand 6430 states and 10032 transitions. Second operand 6 states. [2019-09-08 11:10:57,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:57,752 INFO L93 Difference]: Finished difference Result 24638 states and 38519 transitions. [2019-09-08 11:10:57,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:10:57,752 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-09-08 11:10:57,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:57,832 INFO L225 Difference]: With dead ends: 24638 [2019-09-08 11:10:57,832 INFO L226 Difference]: Without dead ends: 18266 [2019-09-08 11:10:57,846 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:10:57,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18266 states. [2019-09-08 11:10:58,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18266 to 18262. [2019-09-08 11:10:58,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18262 states. [2019-09-08 11:10:58,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18262 states to 18262 states and 28421 transitions. [2019-09-08 11:10:58,996 INFO L78 Accepts]: Start accepts. Automaton has 18262 states and 28421 transitions. Word has length 85 [2019-09-08 11:10:58,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:10:58,997 INFO L475 AbstractCegarLoop]: Abstraction has 18262 states and 28421 transitions. [2019-09-08 11:10:58,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:10:58,997 INFO L276 IsEmpty]: Start isEmpty. Operand 18262 states and 28421 transitions. [2019-09-08 11:10:59,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 11:10:59,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:59,003 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:10:59,003 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:59,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:59,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1516640680, now seen corresponding path program 1 times [2019-09-08 11:10:59,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:59,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:59,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:59,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:59,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:59,083 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:10:59,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:10:59,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:10:59,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:10:59,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:10:59,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:10:59,085 INFO L87 Difference]: Start difference. First operand 18262 states and 28421 transitions. Second operand 5 states. [2019-09-08 11:11:01,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:11:01,125 INFO L93 Difference]: Finished difference Result 51209 states and 79780 transitions. [2019-09-08 11:11:01,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:11:01,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-08 11:11:01,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:11:01,211 INFO L225 Difference]: With dead ends: 51209 [2019-09-08 11:11:01,211 INFO L226 Difference]: Without dead ends: 33014 [2019-09-08 11:11:01,253 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:11:01,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33014 states. [2019-09-08 11:11:02,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33014 to 33012. [2019-09-08 11:11:02,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33012 states. [2019-09-08 11:11:02,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33012 states to 33012 states and 51192 transitions. [2019-09-08 11:11:02,778 INFO L78 Accepts]: Start accepts. Automaton has 33012 states and 51192 transitions. Word has length 86 [2019-09-08 11:11:02,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:11:02,779 INFO L475 AbstractCegarLoop]: Abstraction has 33012 states and 51192 transitions. [2019-09-08 11:11:02,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:11:02,779 INFO L276 IsEmpty]: Start isEmpty. Operand 33012 states and 51192 transitions. [2019-09-08 11:11:02,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 11:11:02,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:11:02,787 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:11:02,788 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:11:02,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:11:02,788 INFO L82 PathProgramCache]: Analyzing trace with hash -531883147, now seen corresponding path program 1 times [2019-09-08 11:11:02,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:11:02,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:11:02,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:02,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:11:02,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:11:02,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:11:02,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:11:02,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:11:02,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:11:02,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:11:02,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:11:02,894 INFO L87 Difference]: Start difference. First operand 33012 states and 51192 transitions. Second operand 5 states. [2019-09-08 11:11:05,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:11:05,828 INFO L93 Difference]: Finished difference Result 62390 states and 96225 transitions. [2019-09-08 11:11:05,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:11:05,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-08 11:11:05,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:11:06,021 INFO L225 Difference]: With dead ends: 62390 [2019-09-08 11:11:06,021 INFO L226 Difference]: Without dead ends: 62388 [2019-09-08 11:11:06,047 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:11:06,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62388 states. [2019-09-08 11:11:07,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62388 to 33444. [2019-09-08 11:11:07,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33444 states. [2019-09-08 11:11:07,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33444 states to 33444 states and 51624 transitions. [2019-09-08 11:11:07,894 INFO L78 Accepts]: Start accepts. Automaton has 33444 states and 51624 transitions. Word has length 86 [2019-09-08 11:11:07,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:11:07,894 INFO L475 AbstractCegarLoop]: Abstraction has 33444 states and 51624 transitions. [2019-09-08 11:11:07,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:11:07,895 INFO L276 IsEmpty]: Start isEmpty. Operand 33444 states and 51624 transitions. [2019-09-08 11:11:07,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:11:07,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:11:07,905 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:11:07,905 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:11:07,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:11:07,906 INFO L82 PathProgramCache]: Analyzing trace with hash 951832546, now seen corresponding path program 1 times [2019-09-08 11:11:07,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:11:07,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:11:07,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:07,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:11:07,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:11:08,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:11:08,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:11:08,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:11:08,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:11:08,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:11:08,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:11:08,186 INFO L87 Difference]: Start difference. First operand 33444 states and 51624 transitions. Second operand 10 states. [2019-09-08 11:11:15,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:11:15,662 INFO L93 Difference]: Finished difference Result 113723 states and 173293 transitions. [2019-09-08 11:11:15,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 11:11:15,662 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2019-09-08 11:11:15,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:11:15,935 INFO L225 Difference]: With dead ends: 113723 [2019-09-08 11:11:15,936 INFO L226 Difference]: Without dead ends: 101817 [2019-09-08 11:11:15,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=247, Invalid=683, Unknown=0, NotChecked=0, Total=930 [2019-09-08 11:11:16,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101817 states. [2019-09-08 11:11:18,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101817 to 34031. [2019-09-08 11:11:18,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34031 states. [2019-09-08 11:11:18,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34031 states to 34031 states and 52489 transitions. [2019-09-08 11:11:18,576 INFO L78 Accepts]: Start accepts. Automaton has 34031 states and 52489 transitions. Word has length 87 [2019-09-08 11:11:18,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:11:18,577 INFO L475 AbstractCegarLoop]: Abstraction has 34031 states and 52489 transitions. [2019-09-08 11:11:18,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:11:18,577 INFO L276 IsEmpty]: Start isEmpty. Operand 34031 states and 52489 transitions. [2019-09-08 11:11:18,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:11:18,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:11:18,589 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:11:18,589 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:11:18,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:11:18,589 INFO L82 PathProgramCache]: Analyzing trace with hash 802753602, now seen corresponding path program 1 times [2019-09-08 11:11:18,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:11:18,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:11:18,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:18,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:11:18,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:11:18,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:11:18,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:11:18,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:11:18,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:11:18,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:11:18,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:11:18,805 INFO L87 Difference]: Start difference. First operand 34031 states and 52489 transitions. Second operand 10 states. [2019-09-08 11:11:29,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:11:29,973 INFO L93 Difference]: Finished difference Result 179301 states and 275093 transitions. [2019-09-08 11:11:29,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 11:11:29,973 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2019-09-08 11:11:29,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:11:30,215 INFO L225 Difference]: With dead ends: 179301 [2019-09-08 11:11:30,215 INFO L226 Difference]: Without dead ends: 174945 [2019-09-08 11:11:30,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=236, Invalid=694, Unknown=0, NotChecked=0, Total=930 [2019-09-08 11:11:30,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174945 states. [2019-09-08 11:11:35,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174945 to 34031. [2019-09-08 11:11:35,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34031 states. [2019-09-08 11:11:35,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34031 states to 34031 states and 52487 transitions. [2019-09-08 11:11:35,074 INFO L78 Accepts]: Start accepts. Automaton has 34031 states and 52487 transitions. Word has length 87 [2019-09-08 11:11:35,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:11:35,074 INFO L475 AbstractCegarLoop]: Abstraction has 34031 states and 52487 transitions. [2019-09-08 11:11:35,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:11:35,074 INFO L276 IsEmpty]: Start isEmpty. Operand 34031 states and 52487 transitions. [2019-09-08 11:11:35,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:11:35,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:11:35,084 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:11:35,084 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:11:35,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:11:35,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1048947838, now seen corresponding path program 1 times [2019-09-08 11:11:35,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:11:35,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:11:35,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:35,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:11:35,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:11:35,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:11:35,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:11:35,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:11:35,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:11:35,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:11:35,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:11:35,285 INFO L87 Difference]: Start difference. First operand 34031 states and 52487 transitions. Second operand 10 states. [2019-09-08 11:11:52,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:11:52,995 INFO L93 Difference]: Finished difference Result 236520 states and 362001 transitions. [2019-09-08 11:11:52,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 11:11:52,996 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2019-09-08 11:11:52,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:11:53,461 INFO L225 Difference]: With dead ends: 236520 [2019-09-08 11:11:53,462 INFO L226 Difference]: Without dead ends: 217130 [2019-09-08 11:11:53,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 11:11:53,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217130 states. [2019-09-08 11:11:58,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217130 to 34586. [2019-09-08 11:11:58,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34586 states. [2019-09-08 11:11:58,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34586 states to 34586 states and 53229 transitions. [2019-09-08 11:11:58,098 INFO L78 Accepts]: Start accepts. Automaton has 34586 states and 53229 transitions. Word has length 87 [2019-09-08 11:11:58,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:11:58,099 INFO L475 AbstractCegarLoop]: Abstraction has 34586 states and 53229 transitions. [2019-09-08 11:11:58,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:11:58,099 INFO L276 IsEmpty]: Start isEmpty. Operand 34586 states and 53229 transitions. [2019-09-08 11:11:58,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:11:58,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:11:58,109 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:11:58,109 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:11:58,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:11:58,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1617729314, now seen corresponding path program 1 times [2019-09-08 11:11:58,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:11:58,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:11:58,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:58,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:11:58,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:11:58,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:11:58,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:11:58,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:11:58,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:11:58,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:11:58,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:11:58,313 INFO L87 Difference]: Start difference. First operand 34586 states and 53229 transitions. Second operand 10 states. [2019-09-08 11:12:24,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:12:24,611 INFO L93 Difference]: Finished difference Result 301420 states and 465160 transitions. [2019-09-08 11:12:24,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 11:12:24,611 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2019-09-08 11:12:24,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:12:25,012 INFO L225 Difference]: With dead ends: 301420 [2019-09-08 11:12:25,013 INFO L226 Difference]: Without dead ends: 273814 [2019-09-08 11:12:25,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=320, Invalid=1012, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 11:12:25,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273814 states. [2019-09-08 11:12:30,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273814 to 35075. [2019-09-08 11:12:30,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35075 states. [2019-09-08 11:12:30,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35075 states to 35075 states and 53840 transitions. [2019-09-08 11:12:30,508 INFO L78 Accepts]: Start accepts. Automaton has 35075 states and 53840 transitions. Word has length 87 [2019-09-08 11:12:30,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:12:30,509 INFO L475 AbstractCegarLoop]: Abstraction has 35075 states and 53840 transitions. [2019-09-08 11:12:30,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:12:30,509 INFO L276 IsEmpty]: Start isEmpty. Operand 35075 states and 53840 transitions. [2019-09-08 11:12:30,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:12:30,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:12:30,517 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:12:30,517 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:12:30,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:12:30,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1867449764, now seen corresponding path program 1 times [2019-09-08 11:12:30,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:12:30,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:12:30,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:30,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:12:30,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:12:30,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:12:30,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:12:30,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:12:30,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:12:30,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:12:30,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:12:30,761 INFO L87 Difference]: Start difference. First operand 35075 states and 53840 transitions. Second operand 10 states. [2019-09-08 11:12:54,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:12:54,089 INFO L93 Difference]: Finished difference Result 216601 states and 332215 transitions. [2019-09-08 11:12:54,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 11:12:54,090 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-09-08 11:12:54,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:12:54,356 INFO L225 Difference]: With dead ends: 216601 [2019-09-08 11:12:54,356 INFO L226 Difference]: Without dead ends: 183567 [2019-09-08 11:12:54,418 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:12:54,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183567 states. [2019-09-08 11:12:59,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183567 to 35450. [2019-09-08 11:12:59,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35450 states. [2019-09-08 11:12:59,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35450 states to 35450 states and 54274 transitions. [2019-09-08 11:12:59,673 INFO L78 Accepts]: Start accepts. Automaton has 35450 states and 54274 transitions. Word has length 88 [2019-09-08 11:12:59,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:12:59,674 INFO L475 AbstractCegarLoop]: Abstraction has 35450 states and 54274 transitions. [2019-09-08 11:12:59,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:12:59,674 INFO L276 IsEmpty]: Start isEmpty. Operand 35450 states and 54274 transitions. [2019-09-08 11:12:59,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:12:59,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:12:59,682 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:12:59,682 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:12:59,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:12:59,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1462195186, now seen corresponding path program 1 times [2019-09-08 11:12:59,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:12:59,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:12:59,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:59,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:12:59,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:12:59,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:12:59,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:12:59,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 11:12:59,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 11:12:59,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 11:12:59,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:12:59,795 INFO L87 Difference]: Start difference. First operand 35450 states and 54274 transitions. Second operand 4 states. [2019-09-08 11:13:07,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:07,939 INFO L93 Difference]: Finished difference Result 96462 states and 147988 transitions. [2019-09-08 11:13:07,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:13:07,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-08 11:13:07,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:08,011 INFO L225 Difference]: With dead ends: 96462 [2019-09-08 11:13:08,012 INFO L226 Difference]: Without dead ends: 64060 [2019-09-08 11:13:08,036 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:13:08,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64060 states. [2019-09-08 11:13:16,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64060 to 63642. [2019-09-08 11:13:16,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63642 states. [2019-09-08 11:13:16,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63642 states to 63642 states and 96850 transitions. [2019-09-08 11:13:16,886 INFO L78 Accepts]: Start accepts. Automaton has 63642 states and 96850 transitions. Word has length 88 [2019-09-08 11:13:16,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:16,886 INFO L475 AbstractCegarLoop]: Abstraction has 63642 states and 96850 transitions. [2019-09-08 11:13:16,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 11:13:16,887 INFO L276 IsEmpty]: Start isEmpty. Operand 63642 states and 96850 transitions. [2019-09-08 11:13:16,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:13:16,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:16,895 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:13:16,895 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:16,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:16,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1996814445, now seen corresponding path program 1 times [2019-09-08 11:13:16,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:16,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:16,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:16,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:16,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:16,947 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:13:16,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:16,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:13:16,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:13:16,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:13:16,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:13:16,949 INFO L87 Difference]: Start difference. First operand 63642 states and 96850 transitions. Second operand 3 states. [2019-09-08 11:13:25,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:25,688 INFO L93 Difference]: Finished difference Result 85704 states and 130284 transitions. [2019-09-08 11:13:25,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:13:25,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-09-08 11:13:25,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:25,790 INFO L225 Difference]: With dead ends: 85704 [2019-09-08 11:13:25,790 INFO L226 Difference]: Without dead ends: 69694 [2019-09-08 11:13:25,816 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:13:25,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69694 states. [2019-09-08 11:13:35,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69694 to 62460. [2019-09-08 11:13:35,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62460 states. [2019-09-08 11:13:35,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62460 states to 62460 states and 93758 transitions. [2019-09-08 11:13:35,751 INFO L78 Accepts]: Start accepts. Automaton has 62460 states and 93758 transitions. Word has length 88 [2019-09-08 11:13:35,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:35,751 INFO L475 AbstractCegarLoop]: Abstraction has 62460 states and 93758 transitions. [2019-09-08 11:13:35,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:13:35,751 INFO L276 IsEmpty]: Start isEmpty. Operand 62460 states and 93758 transitions. [2019-09-08 11:13:35,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:13:35,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:35,759 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:13:35,760 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:35,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:35,760 INFO L82 PathProgramCache]: Analyzing trace with hash 154677300, now seen corresponding path program 1 times [2019-09-08 11:13:35,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:35,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:35,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:35,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:35,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:35,822 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:13:35,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:35,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:13:35,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:13:35,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:13:35,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:13:35,823 INFO L87 Difference]: Start difference. First operand 62460 states and 93758 transitions. Second operand 3 states. [2019-09-08 11:13:47,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:47,990 INFO L93 Difference]: Finished difference Result 140913 states and 211942 transitions. [2019-09-08 11:13:47,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:13:47,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-09-08 11:13:47,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:48,098 INFO L225 Difference]: With dead ends: 140913 [2019-09-08 11:13:48,099 INFO L226 Difference]: Without dead ends: 86205 [2019-09-08 11:13:48,140 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:13:48,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86205 states. [2019-09-08 11:13:58,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86205 to 61380. [2019-09-08 11:13:58,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61380 states. [2019-09-08 11:13:58,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61380 states to 61380 states and 91347 transitions. [2019-09-08 11:13:58,240 INFO L78 Accepts]: Start accepts. Automaton has 61380 states and 91347 transitions. Word has length 88 [2019-09-08 11:13:58,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:58,240 INFO L475 AbstractCegarLoop]: Abstraction has 61380 states and 91347 transitions. [2019-09-08 11:13:58,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:13:58,240 INFO L276 IsEmpty]: Start isEmpty. Operand 61380 states and 91347 transitions. [2019-09-08 11:13:58,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:13:58,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:58,248 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:13:58,248 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:58,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:58,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1046527154, now seen corresponding path program 1 times [2019-09-08 11:13:58,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:58,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:58,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:58,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:58,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:58,306 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:13:58,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:58,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:13:58,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:13:58,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:13:58,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:13:58,307 INFO L87 Difference]: Start difference. First operand 61380 states and 91347 transitions. Second operand 3 states. [2019-09-08 11:14:10,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:14:10,623 INFO L93 Difference]: Finished difference Result 97341 states and 145106 transitions. [2019-09-08 11:14:10,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:14:10,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-09-08 11:14:10,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:14:10,704 INFO L225 Difference]: With dead ends: 97341 [2019-09-08 11:14:10,705 INFO L226 Difference]: Without dead ends: 69203 [2019-09-08 11:14:10,733 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:14:10,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69203 states. [2019-09-08 11:14:21,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69203 to 68481. [2019-09-08 11:14:21,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68481 states. [2019-09-08 11:14:21,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68481 states to 68481 states and 100386 transitions. [2019-09-08 11:14:21,693 INFO L78 Accepts]: Start accepts. Automaton has 68481 states and 100386 transitions. Word has length 88 [2019-09-08 11:14:21,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:14:21,694 INFO L475 AbstractCegarLoop]: Abstraction has 68481 states and 100386 transitions. [2019-09-08 11:14:21,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:14:21,694 INFO L276 IsEmpty]: Start isEmpty. Operand 68481 states and 100386 transitions. [2019-09-08 11:14:21,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:14:21,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:14:21,702 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:14:21,702 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:14:21,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:14:21,703 INFO L82 PathProgramCache]: Analyzing trace with hash -2055580396, now seen corresponding path program 1 times [2019-09-08 11:14:21,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:14:21,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:14:21,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:21,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:14:21,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:14:21,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:14:21,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:14:21,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:14:21,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:14:21,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:14:21,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:14:21,758 INFO L87 Difference]: Start difference. First operand 68481 states and 100386 transitions. Second operand 3 states. [2019-09-08 11:14:37,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:14:37,598 INFO L93 Difference]: Finished difference Result 129697 states and 190175 transitions. [2019-09-08 11:14:37,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:14:37,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-09-08 11:14:37,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:14:37,702 INFO L225 Difference]: With dead ends: 129697 [2019-09-08 11:14:37,703 INFO L226 Difference]: Without dead ends: 81171 [2019-09-08 11:14:37,744 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:14:37,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81171 states. [2019-09-08 11:14:51,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81171 to 80377. [2019-09-08 11:14:51,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80377 states. [2019-09-08 11:14:51,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80377 states to 80377 states and 115655 transitions. [2019-09-08 11:14:51,210 INFO L78 Accepts]: Start accepts. Automaton has 80377 states and 115655 transitions. Word has length 88 [2019-09-08 11:14:51,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:14:51,211 INFO L475 AbstractCegarLoop]: Abstraction has 80377 states and 115655 transitions. [2019-09-08 11:14:51,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:14:51,211 INFO L276 IsEmpty]: Start isEmpty. Operand 80377 states and 115655 transitions. [2019-09-08 11:14:51,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:14:51,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:14:51,219 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:14:51,220 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:14:51,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:14:51,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1270861016, now seen corresponding path program 1 times [2019-09-08 11:14:51,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:14:51,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:14:51,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:51,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:14:51,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:14:51,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:14:51,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:14:51,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:14:51,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:14:51,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:14:51,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:14:51,272 INFO L87 Difference]: Start difference. First operand 80377 states and 115655 transitions. Second operand 3 states. [2019-09-08 11:15:13,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:13,420 INFO L93 Difference]: Finished difference Result 179883 states and 258642 transitions. [2019-09-08 11:15:13,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:15:13,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-08 11:15:13,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:13,557 INFO L225 Difference]: With dead ends: 179883 [2019-09-08 11:15:13,558 INFO L226 Difference]: Without dead ends: 107053 [2019-09-08 11:15:13,604 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:13,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107053 states. [2019-09-08 11:15:32,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107053 to 106139. [2019-09-08 11:15:32,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106139 states. [2019-09-08 11:15:32,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106139 states to 106139 states and 150184 transitions. [2019-09-08 11:15:32,988 INFO L78 Accepts]: Start accepts. Automaton has 106139 states and 150184 transitions. Word has length 89 [2019-09-08 11:15:32,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:32,988 INFO L475 AbstractCegarLoop]: Abstraction has 106139 states and 150184 transitions. [2019-09-08 11:15:32,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:15:32,989 INFO L276 IsEmpty]: Start isEmpty. Operand 106139 states and 150184 transitions. [2019-09-08 11:15:32,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:15:32,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:32,994 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:15:32,994 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:32,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:32,995 INFO L82 PathProgramCache]: Analyzing trace with hash -202174862, now seen corresponding path program 1 times [2019-09-08 11:15:32,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:32,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:32,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:32,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:32,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:33,103 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:33,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:33,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:15:33,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:15:33,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:15:33,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:15:33,104 INFO L87 Difference]: Start difference. First operand 106139 states and 150184 transitions. Second operand 7 states. [2019-09-08 11:17:03,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:17:03,037 INFO L93 Difference]: Finished difference Result 469998 states and 657886 transitions. [2019-09-08 11:17:03,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:17:03,037 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-09-08 11:17:03,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:17:03,752 INFO L225 Difference]: With dead ends: 469998 [2019-09-08 11:17:03,752 INFO L226 Difference]: Without dead ends: 437248 [2019-09-08 11:17:03,851 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:17:04,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437248 states. [2019-09-08 11:17:33,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437248 to 106633. [2019-09-08 11:17:33,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106633 states. [2019-09-08 11:17:33,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106633 states to 106633 states and 150781 transitions. [2019-09-08 11:17:33,668 INFO L78 Accepts]: Start accepts. Automaton has 106633 states and 150781 transitions. Word has length 89 [2019-09-08 11:17:33,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:17:33,668 INFO L475 AbstractCegarLoop]: Abstraction has 106633 states and 150781 transitions. [2019-09-08 11:17:33,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:17:33,669 INFO L276 IsEmpty]: Start isEmpty. Operand 106633 states and 150781 transitions. [2019-09-08 11:17:33,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:17:33,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:17:33,674 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:33,674 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:17:33,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:17:33,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1465357821, now seen corresponding path program 1 times [2019-09-08 11:17:33,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:17:33,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:17:33,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:33,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:17:33,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:17:33,767 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:33,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:17:33,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:17:33,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:17:33,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:17:33,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:17:33,769 INFO L87 Difference]: Start difference. First operand 106633 states and 150781 transitions. Second operand 7 states. [2019-09-08 11:18:47,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:18:47,912 INFO L93 Difference]: Finished difference Result 351856 states and 494239 transitions. [2019-09-08 11:18:47,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:18:47,912 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-09-08 11:18:47,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:18:48,419 INFO L225 Difference]: With dead ends: 351856 [2019-09-08 11:18:48,419 INFO L226 Difference]: Without dead ends: 329696 [2019-09-08 11:18:48,504 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:18:48,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329696 states. [2019-09-08 11:19:22,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329696 to 133864. [2019-09-08 11:19:22,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133864 states. [2019-09-08 11:19:22,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133864 states to 133864 states and 188969 transitions. [2019-09-08 11:19:22,449 INFO L78 Accepts]: Start accepts. Automaton has 133864 states and 188969 transitions. Word has length 89 [2019-09-08 11:19:22,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:19:22,449 INFO L475 AbstractCegarLoop]: Abstraction has 133864 states and 188969 transitions. [2019-09-08 11:19:22,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:19:22,449 INFO L276 IsEmpty]: Start isEmpty. Operand 133864 states and 188969 transitions. [2019-09-08 11:19:22,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:19:22,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:19:22,455 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:22,455 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:19:22,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:19:22,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1453207386, now seen corresponding path program 1 times [2019-09-08 11:19:22,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:19:22,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:19:22,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:19:22,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:19:22,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:19:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:19:22,550 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:22,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:19:22,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:19:22,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:19:22,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:19:22,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:19:22,551 INFO L87 Difference]: Start difference. First operand 133864 states and 188969 transitions. Second operand 7 states. [2019-09-08 11:21:32,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:21:32,227 INFO L93 Difference]: Finished difference Result 607527 states and 850073 transitions. [2019-09-08 11:21:32,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:21:32,230 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-09-08 11:21:32,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:21:33,146 INFO L225 Difference]: With dead ends: 607527 [2019-09-08 11:21:33,146 INFO L226 Difference]: Without dead ends: 547111 [2019-09-08 11:21:33,270 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:21:33,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547111 states. [2019-09-08 11:22:11,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547111 to 134233. [2019-09-08 11:22:11,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134233 states. [2019-09-08 11:22:11,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134233 states to 134233 states and 189418 transitions. [2019-09-08 11:22:11,976 INFO L78 Accepts]: Start accepts. Automaton has 134233 states and 189418 transitions. Word has length 89 [2019-09-08 11:22:11,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:22:11,976 INFO L475 AbstractCegarLoop]: Abstraction has 134233 states and 189418 transitions. [2019-09-08 11:22:11,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:22:11,977 INFO L276 IsEmpty]: Start isEmpty. Operand 134233 states and 189418 transitions. [2019-09-08 11:22:11,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:22:11,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:22:11,983 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:22:11,983 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:22:11,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:22:11,984 INFO L82 PathProgramCache]: Analyzing trace with hash -604351932, now seen corresponding path program 1 times [2019-09-08 11:22:11,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:22:11,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:22:11,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:22:11,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:22:11,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:22:12,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:22:12,083 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:22:12,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:22:12,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:22:12,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:22:12,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:22:12,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:22:12,086 INFO L87 Difference]: Start difference. First operand 134233 states and 189418 transitions. Second operand 7 states. [2019-09-08 11:23:40,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:23:40,375 INFO L93 Difference]: Finished difference Result 402990 states and 566786 transitions. [2019-09-08 11:23:40,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:23:40,375 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-09-08 11:23:40,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:23:40,890 INFO L225 Difference]: With dead ends: 402990 [2019-09-08 11:23:40,890 INFO L226 Difference]: Without dead ends: 345275 [2019-09-08 11:23:40,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-09-08 11:23:41,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345275 states.