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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:52:40,152 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:52:40,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:52:40,166 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:52:40,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:52:40,167 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:52:40,168 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:52:40,170 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:52:40,172 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:52:40,173 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:52:40,174 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:52:40,175 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:52:40,175 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:52:40,176 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:52:40,177 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:52:40,178 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:52:40,179 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:52:40,180 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:52:40,181 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:52:40,183 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:52:40,184 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:52:40,185 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:52:40,186 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:52:40,187 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:52:40,189 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:52:40,189 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:52:40,190 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:52:40,190 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:52:40,191 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:52:40,192 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:52:40,192 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:52:40,193 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:52:40,193 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:52:40,194 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:52:40,195 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:52:40,195 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:52:40,196 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:52:40,196 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:52:40,196 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:52:40,197 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:52:40,198 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:52:40,199 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 10:52:40,213 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:52:40,213 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:52:40,215 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:52:40,215 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:52:40,215 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:52:40,215 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:52:40,216 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:52:40,216 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:52:40,216 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:52:40,216 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:52:40,216 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:52:40,216 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:52:40,217 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:52:40,217 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:52:40,217 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:52:40,217 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:52:40,217 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:52:40,218 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:52:40,218 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:52:40,218 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:52:40,218 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:52:40,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:52:40,219 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:52:40,219 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:52:40,219 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:52:40,219 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:52:40,220 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:52:40,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:52:40,220 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:52:40,249 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:52:40,261 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:52:40,265 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:52:40,266 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:52:40,266 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:52:40,267 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 10:52:40,334 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/859e967d7/4437e54aa83f4193a486751d5a0e10d0/FLAG4ba30466b [2019-09-08 10:52:41,075 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:52:41,076 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 10:52:41,107 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/859e967d7/4437e54aa83f4193a486751d5a0e10d0/FLAG4ba30466b [2019-09-08 10:52:41,145 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/859e967d7/4437e54aa83f4193a486751d5a0e10d0 [2019-09-08 10:52:41,155 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:52:41,157 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:52:41,158 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:52:41,158 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:52:41,162 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:52:41,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:52:41" (1/1) ... [2019-09-08 10:52:41,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76f70ff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:52:41, skipping insertion in model container [2019-09-08 10:52:41,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:52:41" (1/1) ... [2019-09-08 10:52:41,174 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:52:41,377 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:52:42,505 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:52:42,521 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:52:43,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:52:43,068 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:52:43,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:52:43 WrapperNode [2019-09-08 10:52:43,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:52:43,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:52:43,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:52:43,071 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:52:43,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:52:43" (1/1) ... [2019-09-08 10:52:43,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:52:43" (1/1) ... [2019-09-08 10:52:43,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:52:43" (1/1) ... [2019-09-08 10:52:43,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:52:43" (1/1) ... [2019-09-08 10:52:43,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:52:43" (1/1) ... [2019-09-08 10:52:43,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:52:43" (1/1) ... [2019-09-08 10:52:43,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:52:43" (1/1) ... [2019-09-08 10:52:43,324 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:52:43,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:52:43,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:52:43,325 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:52:43,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:52:43" (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 10:52:43,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:52:43,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:52:43,391 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:52:43,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:52:43,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:52:43,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:52:43,392 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:52:43,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:52:43,393 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:52:43,393 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:52:43,393 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:52:43,393 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:52:43,394 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:52:43,394 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:52:43,395 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:52:43,395 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:52:43,396 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:52:43,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:52:43,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:52:46,979 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:52:46,979 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:52:46,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:52:46 BoogieIcfgContainer [2019-09-08 10:52:46,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:52:46,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:52:46,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:52:46,985 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:52:46,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:52:41" (1/3) ... [2019-09-08 10:52:46,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e320ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:52:46, skipping insertion in model container [2019-09-08 10:52:46,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:52:43" (2/3) ... [2019-09-08 10:52:46,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e320ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:52:46, skipping insertion in model container [2019-09-08 10:52:46,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:52:46" (3/3) ... [2019-09-08 10:52:46,989 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 10:52:46,998 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:52:47,007 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-09-08 10:52:47,024 INFO L252 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-09-08 10:52:47,062 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:52:47,063 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:52:47,063 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:52:47,063 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:52:47,064 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:52:47,064 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:52:47,064 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:52:47,064 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:52:47,064 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:52:47,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states. [2019-09-08 10:52:47,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 10:52:47,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:52:47,130 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] [2019-09-08 10:52:47,132 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:52:47,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:52:47,138 INFO L82 PathProgramCache]: Analyzing trace with hash 971331392, now seen corresponding path program 1 times [2019-09-08 10:52:47,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:52:47,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:52:47,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:47,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:52:47,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:52:47,823 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 10:52:47,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:52:47,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:52:47,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:52:47,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:52:47,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:52:47,850 INFO L87 Difference]: Start difference. First operand 1111 states. Second operand 5 states. [2019-09-08 10:52:48,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:52:48,991 INFO L93 Difference]: Finished difference Result 1807 states and 3293 transitions. [2019-09-08 10:52:48,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:52:48,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-08 10:52:48,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:52:49,024 INFO L225 Difference]: With dead ends: 1807 [2019-09-08 10:52:49,024 INFO L226 Difference]: Without dead ends: 997 [2019-09-08 10:52:49,036 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 10:52:49,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-09-08 10:52:49,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 989. [2019-09-08 10:52:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 989 states. [2019-09-08 10:52:49,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1318 transitions. [2019-09-08 10:52:49,170 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1318 transitions. Word has length 68 [2019-09-08 10:52:49,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:52:49,171 INFO L475 AbstractCegarLoop]: Abstraction has 989 states and 1318 transitions. [2019-09-08 10:52:49,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:52:49,171 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1318 transitions. [2019-09-08 10:52:49,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 10:52:49,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:52:49,177 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] [2019-09-08 10:52:49,177 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:52:49,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:52:49,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1328541618, now seen corresponding path program 1 times [2019-09-08 10:52:49,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:52:49,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:52:49,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:49,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:52:49,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:49,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:52:49,347 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 10:52:49,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:52:49,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:52:49,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:52:49,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:52:49,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:52:49,351 INFO L87 Difference]: Start difference. First operand 989 states and 1318 transitions. Second operand 3 states. [2019-09-08 10:52:49,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:52:49,425 INFO L93 Difference]: Finished difference Result 1739 states and 2364 transitions. [2019-09-08 10:52:49,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:52:49,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-08 10:52:49,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:52:49,433 INFO L225 Difference]: With dead ends: 1739 [2019-09-08 10:52:49,433 INFO L226 Difference]: Without dead ends: 1414 [2019-09-08 10:52:49,435 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 10:52:49,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2019-09-08 10:52:49,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1405. [2019-09-08 10:52:49,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1405 states. [2019-09-08 10:52:49,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 1866 transitions. [2019-09-08 10:52:49,490 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 1866 transitions. Word has length 69 [2019-09-08 10:52:49,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:52:49,490 INFO L475 AbstractCegarLoop]: Abstraction has 1405 states and 1866 transitions. [2019-09-08 10:52:49,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:52:49,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1866 transitions. [2019-09-08 10:52:49,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 10:52:49,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:52:49,494 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] [2019-09-08 10:52:49,495 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:52:49,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:52:49,495 INFO L82 PathProgramCache]: Analyzing trace with hash 619214809, now seen corresponding path program 1 times [2019-09-08 10:52:49,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:52:49,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:52:49,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:49,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:52:49,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:52:49,614 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 10:52:49,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:52:49,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:52:49,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:52:49,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:52:49,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:52:49,616 INFO L87 Difference]: Start difference. First operand 1405 states and 1866 transitions. Second operand 3 states. [2019-09-08 10:52:49,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:52:49,718 INFO L93 Difference]: Finished difference Result 2263 states and 3133 transitions. [2019-09-08 10:52:49,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:52:49,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-08 10:52:49,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:52:49,728 INFO L225 Difference]: With dead ends: 2263 [2019-09-08 10:52:49,728 INFO L226 Difference]: Without dead ends: 1787 [2019-09-08 10:52:49,730 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 10:52:49,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2019-09-08 10:52:49,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1779. [2019-09-08 10:52:49,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2019-09-08 10:52:49,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2409 transitions. [2019-09-08 10:52:49,792 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2409 transitions. Word has length 69 [2019-09-08 10:52:49,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:52:49,793 INFO L475 AbstractCegarLoop]: Abstraction has 1779 states and 2409 transitions. [2019-09-08 10:52:49,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:52:49,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2409 transitions. [2019-09-08 10:52:49,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 10:52:49,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:52:49,797 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] [2019-09-08 10:52:49,797 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:52:49,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:52:49,798 INFO L82 PathProgramCache]: Analyzing trace with hash 211809038, now seen corresponding path program 1 times [2019-09-08 10:52:49,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:52:49,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:52:49,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:49,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:52:49,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:52:49,945 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 10:52:49,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:52:49,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:52:49,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:52:49,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:52:49,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:52:49,946 INFO L87 Difference]: Start difference. First operand 1779 states and 2409 transitions. Second operand 3 states. [2019-09-08 10:52:50,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:52:50,154 INFO L93 Difference]: Finished difference Result 3155 states and 4408 transitions. [2019-09-08 10:52:50,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:52:50,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-08 10:52:50,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:52:50,171 INFO L225 Difference]: With dead ends: 3155 [2019-09-08 10:52:50,171 INFO L226 Difference]: Without dead ends: 2489 [2019-09-08 10:52:50,173 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 10:52:50,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2489 states. [2019-09-08 10:52:50,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2489 to 2481. [2019-09-08 10:52:50,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2481 states. [2019-09-08 10:52:50,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3399 transitions. [2019-09-08 10:52:50,355 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3399 transitions. Word has length 69 [2019-09-08 10:52:50,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:52:50,355 INFO L475 AbstractCegarLoop]: Abstraction has 2481 states and 3399 transitions. [2019-09-08 10:52:50,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:52:50,356 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3399 transitions. [2019-09-08 10:52:50,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 10:52:50,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:52:50,360 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] [2019-09-08 10:52:50,361 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:52:50,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:52:50,361 INFO L82 PathProgramCache]: Analyzing trace with hash -2052603823, now seen corresponding path program 1 times [2019-09-08 10:52:50,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:52:50,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:52:50,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:50,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:52:50,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:52:50,510 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 10:52:50,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:52:50,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:52:50,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:52:50,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:52:50,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:52:50,512 INFO L87 Difference]: Start difference. First operand 2481 states and 3399 transitions. Second operand 6 states. [2019-09-08 10:52:51,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:52:51,304 INFO L93 Difference]: Finished difference Result 6576 states and 9230 transitions. [2019-09-08 10:52:51,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:52:51,304 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-08 10:52:51,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:52:51,326 INFO L225 Difference]: With dead ends: 6576 [2019-09-08 10:52:51,327 INFO L226 Difference]: Without dead ends: 4425 [2019-09-08 10:52:51,335 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 10:52:51,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4425 states. [2019-09-08 10:52:51,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4425 to 4409. [2019-09-08 10:52:51,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4409 states. [2019-09-08 10:52:51,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 6197 transitions. [2019-09-08 10:52:51,642 INFO L78 Accepts]: Start accepts. Automaton has 4409 states and 6197 transitions. Word has length 69 [2019-09-08 10:52:51,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:52:51,643 INFO L475 AbstractCegarLoop]: Abstraction has 4409 states and 6197 transitions. [2019-09-08 10:52:51,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:52:51,643 INFO L276 IsEmpty]: Start isEmpty. Operand 4409 states and 6197 transitions. [2019-09-08 10:52:51,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:52:51,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:52:51,649 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] [2019-09-08 10:52:51,649 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:52:51,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:52:51,650 INFO L82 PathProgramCache]: Analyzing trace with hash 449186189, now seen corresponding path program 1 times [2019-09-08 10:52:51,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:52:51,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:52:51,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:51,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:52:51,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:52:51,788 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 10:52:51,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:52:51,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:52:51,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:52:51,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:52:51,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:52:51,790 INFO L87 Difference]: Start difference. First operand 4409 states and 6197 transitions. Second operand 6 states. [2019-09-08 10:52:52,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:52:52,642 INFO L93 Difference]: Finished difference Result 12406 states and 17627 transitions. [2019-09-08 10:52:52,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:52:52,642 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-08 10:52:52,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:52:52,684 INFO L225 Difference]: With dead ends: 12406 [2019-09-08 10:52:52,685 INFO L226 Difference]: Without dead ends: 8348 [2019-09-08 10:52:52,697 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 10:52:52,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8348 states. [2019-09-08 10:52:53,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8348 to 8296. [2019-09-08 10:52:53,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8296 states. [2019-09-08 10:52:53,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8296 states to 8296 states and 11769 transitions. [2019-09-08 10:52:53,200 INFO L78 Accepts]: Start accepts. Automaton has 8296 states and 11769 transitions. Word has length 70 [2019-09-08 10:52:53,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:52:53,204 INFO L475 AbstractCegarLoop]: Abstraction has 8296 states and 11769 transitions. [2019-09-08 10:52:53,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:52:53,205 INFO L276 IsEmpty]: Start isEmpty. Operand 8296 states and 11769 transitions. [2019-09-08 10:52:53,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:52:53,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:52:53,217 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] [2019-09-08 10:52:53,217 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:52:53,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:52:53,218 INFO L82 PathProgramCache]: Analyzing trace with hash 178317883, now seen corresponding path program 1 times [2019-09-08 10:52:53,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:52:53,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:52:53,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:53,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:52:53,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:52:53,333 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 10:52:53,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:52:53,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:52:53,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:52:53,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:52:53,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:52:53,334 INFO L87 Difference]: Start difference. First operand 8296 states and 11769 transitions. Second operand 3 states. [2019-09-08 10:52:53,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:52:53,847 INFO L93 Difference]: Finished difference Result 19378 states and 27670 transitions. [2019-09-08 10:52:53,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:52:53,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-08 10:52:53,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:52:53,906 INFO L225 Difference]: With dead ends: 19378 [2019-09-08 10:52:53,907 INFO L226 Difference]: Without dead ends: 12191 [2019-09-08 10:52:53,922 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 10:52:53,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12191 states. [2019-09-08 10:52:54,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12191 to 12123. [2019-09-08 10:52:54,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12123 states. [2019-09-08 10:52:54,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12123 states to 12123 states and 17046 transitions. [2019-09-08 10:52:54,437 INFO L78 Accepts]: Start accepts. Automaton has 12123 states and 17046 transitions. Word has length 70 [2019-09-08 10:52:54,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:52:54,438 INFO L475 AbstractCegarLoop]: Abstraction has 12123 states and 17046 transitions. [2019-09-08 10:52:54,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:52:54,438 INFO L276 IsEmpty]: Start isEmpty. Operand 12123 states and 17046 transitions. [2019-09-08 10:52:54,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:52:54,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:52:54,447 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] [2019-09-08 10:52:54,448 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:52:54,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:52:54,448 INFO L82 PathProgramCache]: Analyzing trace with hash 769375619, now seen corresponding path program 1 times [2019-09-08 10:52:54,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:52:54,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:52:54,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:54,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:52:54,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:52:54,641 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 10:52:54,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:52:54,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:52:54,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:52:54,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:52:54,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:52:54,644 INFO L87 Difference]: Start difference. First operand 12123 states and 17046 transitions. Second operand 6 states. [2019-09-08 10:52:56,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:52:56,171 INFO L93 Difference]: Finished difference Result 36917 states and 52043 transitions. [2019-09-08 10:52:56,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:52:56,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-09-08 10:52:56,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:52:56,229 INFO L225 Difference]: With dead ends: 36917 [2019-09-08 10:52:56,229 INFO L226 Difference]: Without dead ends: 25289 [2019-09-08 10:52:56,253 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 10:52:56,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25289 states. [2019-09-08 10:52:58,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25289 to 25123. [2019-09-08 10:52:58,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25123 states. [2019-09-08 10:52:58,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25123 states to 25123 states and 35264 transitions. [2019-09-08 10:52:58,325 INFO L78 Accepts]: Start accepts. Automaton has 25123 states and 35264 transitions. Word has length 71 [2019-09-08 10:52:58,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:52:58,326 INFO L475 AbstractCegarLoop]: Abstraction has 25123 states and 35264 transitions. [2019-09-08 10:52:58,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:52:58,326 INFO L276 IsEmpty]: Start isEmpty. Operand 25123 states and 35264 transitions. [2019-09-08 10:52:58,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:52:58,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:52:58,337 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] [2019-09-08 10:52:58,337 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:52:58,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:52:58,338 INFO L82 PathProgramCache]: Analyzing trace with hash -94739691, now seen corresponding path program 1 times [2019-09-08 10:52:58,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:52:58,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:52:58,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:58,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:52:58,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:52:58,473 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 10:52:58,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:52:58,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:52:58,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:52:58,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:52:58,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:52:58,475 INFO L87 Difference]: Start difference. First operand 25123 states and 35264 transitions. Second operand 7 states. [2019-09-08 10:53:02,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:53:02,669 INFO L93 Difference]: Finished difference Result 95166 states and 133730 transitions. [2019-09-08 10:53:02,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:53:02,670 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-09-08 10:53:02,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:53:02,853 INFO L225 Difference]: With dead ends: 95166 [2019-09-08 10:53:02,853 INFO L226 Difference]: Without dead ends: 82215 [2019-09-08 10:53:02,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:53:02,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82215 states. [2019-09-08 10:53:04,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82215 to 25151. [2019-09-08 10:53:04,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25151 states. [2019-09-08 10:53:04,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25151 states to 25151 states and 35300 transitions. [2019-09-08 10:53:04,640 INFO L78 Accepts]: Start accepts. Automaton has 25151 states and 35300 transitions. Word has length 72 [2019-09-08 10:53:04,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:53:04,640 INFO L475 AbstractCegarLoop]: Abstraction has 25151 states and 35300 transitions. [2019-09-08 10:53:04,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:53:04,640 INFO L276 IsEmpty]: Start isEmpty. Operand 25151 states and 35300 transitions. [2019-09-08 10:53:04,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:53:04,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:53:04,652 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] [2019-09-08 10:53:04,653 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:53:04,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:53:04,653 INFO L82 PathProgramCache]: Analyzing trace with hash 446727203, now seen corresponding path program 1 times [2019-09-08 10:53:04,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:53:04,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:53:04,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:04,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:53:04,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:53:04,810 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 10:53:04,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:53:04,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:53:04,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:53:04,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:53:04,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:53:04,812 INFO L87 Difference]: Start difference. First operand 25151 states and 35300 transitions. Second operand 7 states. [2019-09-08 10:53:11,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:53:11,427 INFO L93 Difference]: Finished difference Result 105774 states and 149050 transitions. [2019-09-08 10:53:11,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:53:11,428 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-09-08 10:53:11,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:53:11,640 INFO L225 Difference]: With dead ends: 105774 [2019-09-08 10:53:11,641 INFO L226 Difference]: Without dead ends: 93504 [2019-09-08 10:53:11,680 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 10:53:11,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93504 states. [2019-09-08 10:53:13,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93504 to 25239. [2019-09-08 10:53:13,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25239 states. [2019-09-08 10:53:13,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25239 states to 25239 states and 35421 transitions. [2019-09-08 10:53:13,661 INFO L78 Accepts]: Start accepts. Automaton has 25239 states and 35421 transitions. Word has length 72 [2019-09-08 10:53:13,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:53:13,661 INFO L475 AbstractCegarLoop]: Abstraction has 25239 states and 35421 transitions. [2019-09-08 10:53:13,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:53:13,661 INFO L276 IsEmpty]: Start isEmpty. Operand 25239 states and 35421 transitions. [2019-09-08 10:53:13,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:53:13,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:53:13,671 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] [2019-09-08 10:53:13,671 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:53:13,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:53:13,672 INFO L82 PathProgramCache]: Analyzing trace with hash -228168160, now seen corresponding path program 1 times [2019-09-08 10:53:13,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:53:13,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:53:13,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:13,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:53:13,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:53:13,811 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 10:53:13,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:53:13,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:53:13,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:53:13,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:53:13,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:53:13,814 INFO L87 Difference]: Start difference. First operand 25239 states and 35421 transitions. Second operand 7 states. [2019-09-08 10:53:22,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:53:22,993 INFO L93 Difference]: Finished difference Result 150005 states and 213021 transitions. [2019-09-08 10:53:22,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:53:22,994 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-09-08 10:53:22,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:53:23,203 INFO L225 Difference]: With dead ends: 150005 [2019-09-08 10:53:23,203 INFO L226 Difference]: Without dead ends: 135580 [2019-09-08 10:53:23,260 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 10:53:23,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135580 states. [2019-09-08 10:53:27,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135580 to 25307. [2019-09-08 10:53:27,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25307 states. [2019-09-08 10:53:27,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25307 states to 25307 states and 35509 transitions. [2019-09-08 10:53:27,365 INFO L78 Accepts]: Start accepts. Automaton has 25307 states and 35509 transitions. Word has length 72 [2019-09-08 10:53:27,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:53:27,365 INFO L475 AbstractCegarLoop]: Abstraction has 25307 states and 35509 transitions. [2019-09-08 10:53:27,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:53:27,365 INFO L276 IsEmpty]: Start isEmpty. Operand 25307 states and 35509 transitions. [2019-09-08 10:53:27,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:53:27,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:53:27,374 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] [2019-09-08 10:53:27,374 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:53:27,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:53:27,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1184969247, now seen corresponding path program 1 times [2019-09-08 10:53:27,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:53:27,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:53:27,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:27,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:53:27,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:53:27,505 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 10:53:27,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:53:27,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:53:27,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:53:27,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:53:27,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:53:27,506 INFO L87 Difference]: Start difference. First operand 25307 states and 35509 transitions. Second operand 7 states. [2019-09-08 10:53:37,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:53:37,181 INFO L93 Difference]: Finished difference Result 121044 states and 171232 transitions. [2019-09-08 10:53:37,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:53:37,182 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-09-08 10:53:37,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:53:37,316 INFO L225 Difference]: With dead ends: 121044 [2019-09-08 10:53:37,316 INFO L226 Difference]: Without dead ends: 108464 [2019-09-08 10:53:37,344 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 10:53:37,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108464 states. [2019-09-08 10:53:40,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108464 to 25436. [2019-09-08 10:53:40,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25436 states. [2019-09-08 10:53:40,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25436 states to 25436 states and 35680 transitions. [2019-09-08 10:53:40,110 INFO L78 Accepts]: Start accepts. Automaton has 25436 states and 35680 transitions. Word has length 72 [2019-09-08 10:53:40,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:53:40,111 INFO L475 AbstractCegarLoop]: Abstraction has 25436 states and 35680 transitions. [2019-09-08 10:53:40,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:53:40,111 INFO L276 IsEmpty]: Start isEmpty. Operand 25436 states and 35680 transitions. [2019-09-08 10:53:40,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:53:40,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:53:40,117 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] [2019-09-08 10:53:40,117 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:53:40,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:53:40,118 INFO L82 PathProgramCache]: Analyzing trace with hash 961373533, now seen corresponding path program 1 times [2019-09-08 10:53:40,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:53:40,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:53:40,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:40,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:53:40,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:53:40,309 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 10:53:40,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:53:40,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:53:40,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:53:40,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:53:40,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:53:40,311 INFO L87 Difference]: Start difference. First operand 25436 states and 35680 transitions. Second operand 9 states. [2019-09-08 10:53:53,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:53:53,071 INFO L93 Difference]: Finished difference Result 126591 states and 180962 transitions. [2019-09-08 10:53:53,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 10:53:53,071 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-09-08 10:53:53,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:53:53,194 INFO L225 Difference]: With dead ends: 126591 [2019-09-08 10:53:53,195 INFO L226 Difference]: Without dead ends: 105756 [2019-09-08 10:53:53,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-08 10:53:53,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105756 states. [2019-09-08 10:53:57,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105756 to 25408. [2019-09-08 10:53:57,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25408 states. [2019-09-08 10:53:57,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25408 states to 25408 states and 35636 transitions. [2019-09-08 10:53:57,854 INFO L78 Accepts]: Start accepts. Automaton has 25408 states and 35636 transitions. Word has length 73 [2019-09-08 10:53:57,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:53:57,855 INFO L475 AbstractCegarLoop]: Abstraction has 25408 states and 35636 transitions. [2019-09-08 10:53:57,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:53:57,855 INFO L276 IsEmpty]: Start isEmpty. Operand 25408 states and 35636 transitions. [2019-09-08 10:53:57,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:53:57,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:53:57,861 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] [2019-09-08 10:53:57,861 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:53:57,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:53:57,862 INFO L82 PathProgramCache]: Analyzing trace with hash 6553349, now seen corresponding path program 1 times [2019-09-08 10:53:57,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:53:57,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:53:57,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:57,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:53:57,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:53:58,023 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 10:53:58,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:53:58,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:53:58,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:53:58,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:53:58,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:53:58,026 INFO L87 Difference]: Start difference. First operand 25408 states and 35636 transitions. Second operand 7 states. [2019-09-08 10:54:09,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:54:09,570 INFO L93 Difference]: Finished difference Result 105953 states and 149287 transitions. [2019-09-08 10:54:09,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:54:09,570 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-09-08 10:54:09,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:54:09,666 INFO L225 Difference]: With dead ends: 105953 [2019-09-08 10:54:09,667 INFO L226 Difference]: Without dead ends: 93697 [2019-09-08 10:54:09,694 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 10:54:09,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93697 states. [2019-09-08 10:54:12,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93697 to 25477. [2019-09-08 10:54:12,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25477 states. [2019-09-08 10:54:12,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25477 states to 25477 states and 35733 transitions. [2019-09-08 10:54:12,858 INFO L78 Accepts]: Start accepts. Automaton has 25477 states and 35733 transitions. Word has length 73 [2019-09-08 10:54:12,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:54:12,858 INFO L475 AbstractCegarLoop]: Abstraction has 25477 states and 35733 transitions. [2019-09-08 10:54:12,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:54:12,858 INFO L276 IsEmpty]: Start isEmpty. Operand 25477 states and 35733 transitions. [2019-09-08 10:54:12,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:54:12,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:54:12,865 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] [2019-09-08 10:54:12,865 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:54:12,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:54:12,865 INFO L82 PathProgramCache]: Analyzing trace with hash -88849401, now seen corresponding path program 1 times [2019-09-08 10:54:12,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:54:12,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:54:12,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:12,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:54:12,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:54:13,047 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 10:54:13,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:54:13,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:54:13,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:54:13,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:54:13,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:54:13,048 INFO L87 Difference]: Start difference. First operand 25477 states and 35733 transitions. Second operand 9 states. [2019-09-08 10:54:27,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:54:27,869 INFO L93 Difference]: Finished difference Result 126570 states and 180917 transitions. [2019-09-08 10:54:27,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 10:54:27,870 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-09-08 10:54:27,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:54:27,987 INFO L225 Difference]: With dead ends: 126570 [2019-09-08 10:54:27,988 INFO L226 Difference]: Without dead ends: 105773 [2019-09-08 10:54:28,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-08 10:54:28,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105773 states. [2019-09-08 10:54:31,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105773 to 25468. [2019-09-08 10:54:31,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25468 states. [2019-09-08 10:54:31,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25468 states to 25468 states and 35715 transitions. [2019-09-08 10:54:31,979 INFO L78 Accepts]: Start accepts. Automaton has 25468 states and 35715 transitions. Word has length 73 [2019-09-08 10:54:31,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:54:31,979 INFO L475 AbstractCegarLoop]: Abstraction has 25468 states and 35715 transitions. [2019-09-08 10:54:31,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:54:31,979 INFO L276 IsEmpty]: Start isEmpty. Operand 25468 states and 35715 transitions. [2019-09-08 10:54:31,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:54:31,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:54:31,986 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] [2019-09-08 10:54:31,986 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:54:31,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:54:31,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1080005182, now seen corresponding path program 1 times [2019-09-08 10:54:31,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:54:31,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:54:31,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:31,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:54:31,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:54:32,161 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 10:54:32,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:54:32,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:54:32,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:54:32,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:54:32,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:54:32,165 INFO L87 Difference]: Start difference. First operand 25468 states and 35715 transitions. Second operand 9 states. [2019-09-08 10:54:48,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:54:48,279 INFO L93 Difference]: Finished difference Result 125659 states and 178428 transitions. [2019-09-08 10:54:48,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 10:54:48,280 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-09-08 10:54:48,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:54:48,397 INFO L225 Difference]: With dead ends: 125659 [2019-09-08 10:54:48,397 INFO L226 Difference]: Without dead ends: 104506 [2019-09-08 10:54:48,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-08 10:54:48,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104506 states. [2019-09-08 10:54:52,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104506 to 25282. [2019-09-08 10:54:52,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25282 states. [2019-09-08 10:54:52,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25282 states to 25282 states and 35468 transitions. [2019-09-08 10:54:52,217 INFO L78 Accepts]: Start accepts. Automaton has 25282 states and 35468 transitions. Word has length 73 [2019-09-08 10:54:52,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:54:52,218 INFO L475 AbstractCegarLoop]: Abstraction has 25282 states and 35468 transitions. [2019-09-08 10:54:52,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:54:52,218 INFO L276 IsEmpty]: Start isEmpty. Operand 25282 states and 35468 transitions. [2019-09-08 10:54:52,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:54:52,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:54:52,225 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] [2019-09-08 10:54:52,225 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:54:52,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:54:52,226 INFO L82 PathProgramCache]: Analyzing trace with hash 8591348, now seen corresponding path program 1 times [2019-09-08 10:54:52,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:54:52,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:54:52,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:52,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:54:52,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:54:52,394 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 10:54:52,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:54:52,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 10:54:52,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 10:54:52,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 10:54:52,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:54:52,396 INFO L87 Difference]: Start difference. First operand 25282 states and 35468 transitions. Second operand 8 states. [2019-09-08 10:55:00,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:55:00,597 INFO L93 Difference]: Finished difference Result 72425 states and 102598 transitions. [2019-09-08 10:55:00,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:55:00,598 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2019-09-08 10:55:00,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:55:00,649 INFO L225 Difference]: With dead ends: 72425 [2019-09-08 10:55:00,650 INFO L226 Difference]: Without dead ends: 50272 [2019-09-08 10:55:00,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:55:00,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50272 states. [2019-09-08 10:55:04,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50272 to 24690. [2019-09-08 10:55:04,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24690 states. [2019-09-08 10:55:04,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24690 states to 24690 states and 34696 transitions. [2019-09-08 10:55:04,303 INFO L78 Accepts]: Start accepts. Automaton has 24690 states and 34696 transitions. Word has length 73 [2019-09-08 10:55:04,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:55:04,303 INFO L475 AbstractCegarLoop]: Abstraction has 24690 states and 34696 transitions. [2019-09-08 10:55:04,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 10:55:04,303 INFO L276 IsEmpty]: Start isEmpty. Operand 24690 states and 34696 transitions. [2019-09-08 10:55:04,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:55:04,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:55:04,309 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] [2019-09-08 10:55:04,309 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:55:04,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:55:04,310 INFO L82 PathProgramCache]: Analyzing trace with hash 591574109, now seen corresponding path program 1 times [2019-09-08 10:55:04,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:55:04,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:55:04,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:04,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:55:04,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:55:04,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:55:04,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:55:04,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 10:55:04,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:55:04,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:55:04,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:55:04,709 INFO L87 Difference]: Start difference. First operand 24690 states and 34696 transitions. Second operand 11 states. [2019-09-08 10:55:27,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:55:27,991 INFO L93 Difference]: Finished difference Result 149814 states and 213199 transitions. [2019-09-08 10:55:27,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 10:55:27,991 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2019-09-08 10:55:27,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:55:28,137 INFO L225 Difference]: With dead ends: 149814 [2019-09-08 10:55:28,137 INFO L226 Difference]: Without dead ends: 128506 [2019-09-08 10:55:28,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2019-09-08 10:55:28,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128506 states. [2019-09-08 10:55:32,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128506 to 24223. [2019-09-08 10:55:32,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24223 states. [2019-09-08 10:55:32,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24223 states to 24223 states and 34058 transitions. [2019-09-08 10:55:32,792 INFO L78 Accepts]: Start accepts. Automaton has 24223 states and 34058 transitions. Word has length 74 [2019-09-08 10:55:32,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:55:32,793 INFO L475 AbstractCegarLoop]: Abstraction has 24223 states and 34058 transitions. [2019-09-08 10:55:32,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:55:32,793 INFO L276 IsEmpty]: Start isEmpty. Operand 24223 states and 34058 transitions. [2019-09-08 10:55:32,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:55:32,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:55:32,799 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] [2019-09-08 10:55:32,799 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:55:32,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:55:32,800 INFO L82 PathProgramCache]: Analyzing trace with hash 199562019, now seen corresponding path program 1 times [2019-09-08 10:55:32,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:55:32,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:55:32,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:32,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:55:32,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:55:33,381 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 10:55:33,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:55:33,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 10:55:33,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:55:33,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:55:33,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:55:33,385 INFO L87 Difference]: Start difference. First operand 24223 states and 34058 transitions. Second operand 12 states. [2019-09-08 10:56:03,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:56:03,883 INFO L93 Difference]: Finished difference Result 161134 states and 230073 transitions. [2019-09-08 10:56:03,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 10:56:03,885 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2019-09-08 10:56:03,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:56:04,045 INFO L225 Difference]: With dead ends: 161134 [2019-09-08 10:56:04,045 INFO L226 Difference]: Without dead ends: 140303 [2019-09-08 10:56:04,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=204, Invalid=666, Unknown=0, NotChecked=0, Total=870 [2019-09-08 10:56:04,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140303 states. [2019-09-08 10:56:09,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140303 to 24169. [2019-09-08 10:56:09,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24169 states. [2019-09-08 10:56:09,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24169 states to 24169 states and 33981 transitions. [2019-09-08 10:56:09,933 INFO L78 Accepts]: Start accepts. Automaton has 24169 states and 33981 transitions. Word has length 74 [2019-09-08 10:56:09,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:56:09,933 INFO L475 AbstractCegarLoop]: Abstraction has 24169 states and 33981 transitions. [2019-09-08 10:56:09,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 10:56:09,934 INFO L276 IsEmpty]: Start isEmpty. Operand 24169 states and 33981 transitions. [2019-09-08 10:56:09,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:56:09,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:56:09,938 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] [2019-09-08 10:56:09,939 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:56:09,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:56:09,939 INFO L82 PathProgramCache]: Analyzing trace with hash 662330837, now seen corresponding path program 1 times [2019-09-08 10:56:09,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:56:09,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:56:09,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:56:09,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:56:09,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:56:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:56:10,322 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2019-09-08 10:56:10,510 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 10:56:10,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:56:10,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 10:56:10,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:56:10,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:56:10,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:56:10,512 INFO L87 Difference]: Start difference. First operand 24169 states and 33981 transitions. Second operand 12 states. [2019-09-08 10:56:44,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:56:44,137 INFO L93 Difference]: Finished difference Result 161772 states and 230798 transitions. [2019-09-08 10:56:44,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 10:56:44,137 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2019-09-08 10:56:44,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:56:44,297 INFO L225 Difference]: With dead ends: 161772 [2019-09-08 10:56:44,297 INFO L226 Difference]: Without dead ends: 140725 [2019-09-08 10:56:44,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2019-09-08 10:56:44,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140725 states. [2019-09-08 10:56:50,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140725 to 23889. [2019-09-08 10:56:50,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23889 states. [2019-09-08 10:56:50,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23889 states to 23889 states and 33630 transitions. [2019-09-08 10:56:50,422 INFO L78 Accepts]: Start accepts. Automaton has 23889 states and 33630 transitions. Word has length 74 [2019-09-08 10:56:50,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:56:50,422 INFO L475 AbstractCegarLoop]: Abstraction has 23889 states and 33630 transitions. [2019-09-08 10:56:50,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 10:56:50,423 INFO L276 IsEmpty]: Start isEmpty. Operand 23889 states and 33630 transitions. [2019-09-08 10:56:50,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:56:50,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:56:50,426 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] [2019-09-08 10:56:50,427 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:56:50,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:56:50,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1361298504, now seen corresponding path program 1 times [2019-09-08 10:56:50,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:56:50,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:56:50,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:56:50,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:56:50,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:56:50,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:56:50,511 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 10:56:50,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:56:50,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:56:50,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:56:50,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:56:50,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:56:50,513 INFO L87 Difference]: Start difference. First operand 23889 states and 33630 transitions. Second operand 3 states. [2019-09-08 10:56:57,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:56:57,158 INFO L93 Difference]: Finished difference Result 38451 states and 54246 transitions. [2019-09-08 10:56:57,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:56:57,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-08 10:56:57,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:56:57,181 INFO L225 Difference]: With dead ends: 38451 [2019-09-08 10:56:57,181 INFO L226 Difference]: Without dead ends: 23893 [2019-09-08 10:56:57,192 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 10:56:57,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23893 states. [2019-09-08 10:57:02,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23893 to 23889. [2019-09-08 10:57:02,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23889 states. [2019-09-08 10:57:02,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23889 states to 23889 states and 33364 transitions. [2019-09-08 10:57:02,087 INFO L78 Accepts]: Start accepts. Automaton has 23889 states and 33364 transitions. Word has length 75 [2019-09-08 10:57:02,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:57:02,088 INFO L475 AbstractCegarLoop]: Abstraction has 23889 states and 33364 transitions. [2019-09-08 10:57:02,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:57:02,088 INFO L276 IsEmpty]: Start isEmpty. Operand 23889 states and 33364 transitions. [2019-09-08 10:57:02,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:57:02,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:57:02,092 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] [2019-09-08 10:57:02,092 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:57:02,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:57:02,093 INFO L82 PathProgramCache]: Analyzing trace with hash 42269280, now seen corresponding path program 1 times [2019-09-08 10:57:02,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:57:02,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:57:02,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:02,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:57:02,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:57:02,182 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 10:57:02,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:57:02,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:57:02,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:57:02,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:57:02,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:57:02,183 INFO L87 Difference]: Start difference. First operand 23889 states and 33364 transitions. Second operand 3 states. [2019-09-08 10:57:10,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:57:10,247 INFO L93 Difference]: Finished difference Result 49235 states and 69088 transitions. [2019-09-08 10:57:10,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:57:10,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-08 10:57:10,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:57:10,282 INFO L225 Difference]: With dead ends: 49235 [2019-09-08 10:57:10,283 INFO L226 Difference]: Without dead ends: 35475 [2019-09-08 10:57:10,295 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 10:57:10,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35475 states. [2019-09-08 10:57:17,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35475 to 27733. [2019-09-08 10:57:17,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27733 states. [2019-09-08 10:57:17,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27733 states to 27733 states and 38960 transitions. [2019-09-08 10:57:17,334 INFO L78 Accepts]: Start accepts. Automaton has 27733 states and 38960 transitions. Word has length 76 [2019-09-08 10:57:17,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:57:17,334 INFO L475 AbstractCegarLoop]: Abstraction has 27733 states and 38960 transitions. [2019-09-08 10:57:17,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:57:17,335 INFO L276 IsEmpty]: Start isEmpty. Operand 27733 states and 38960 transitions. [2019-09-08 10:57:17,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:57:17,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:57:17,339 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] [2019-09-08 10:57:17,339 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:57:17,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:57:17,339 INFO L82 PathProgramCache]: Analyzing trace with hash 2110038432, now seen corresponding path program 1 times [2019-09-08 10:57:17,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:57:17,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:57:17,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:17,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:57:17,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:57:17,409 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 10:57:17,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:57:17,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:57:17,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:57:17,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:57:17,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:57:17,410 INFO L87 Difference]: Start difference. First operand 27733 states and 38960 transitions. Second operand 3 states. [2019-09-08 10:57:26,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:57:26,775 INFO L93 Difference]: Finished difference Result 53691 states and 75749 transitions. [2019-09-08 10:57:26,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:57:26,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-08 10:57:26,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:57:26,810 INFO L225 Difference]: With dead ends: 53691 [2019-09-08 10:57:26,810 INFO L226 Difference]: Without dead ends: 35751 [2019-09-08 10:57:26,824 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 10:57:26,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35751 states. [2019-09-08 10:57:33,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35751 to 26503. [2019-09-08 10:57:33,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26503 states. [2019-09-08 10:57:33,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26503 states to 26503 states and 37301 transitions. [2019-09-08 10:57:33,658 INFO L78 Accepts]: Start accepts. Automaton has 26503 states and 37301 transitions. Word has length 76 [2019-09-08 10:57:33,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:57:33,658 INFO L475 AbstractCegarLoop]: Abstraction has 26503 states and 37301 transitions. [2019-09-08 10:57:33,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:57:33,658 INFO L276 IsEmpty]: Start isEmpty. Operand 26503 states and 37301 transitions. [2019-09-08 10:57:33,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 10:57:33,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:57:33,662 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] [2019-09-08 10:57:33,662 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:57:33,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:57:33,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1012060291, now seen corresponding path program 1 times [2019-09-08 10:57:33,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:57:33,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:57:33,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:33,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:57:33,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:57:33,829 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 10:57:33,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:57:33,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:57:33,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:57:33,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:57:33,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:57:33,830 INFO L87 Difference]: Start difference. First operand 26503 states and 37301 transitions. Second operand 9 states. [2019-09-08 10:57:57,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:57:57,914 INFO L93 Difference]: Finished difference Result 90869 states and 128832 transitions. [2019-09-08 10:57:57,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 10:57:57,914 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 77 [2019-09-08 10:57:57,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:57:57,997 INFO L225 Difference]: With dead ends: 90869 [2019-09-08 10:57:57,997 INFO L226 Difference]: Without dead ends: 82284 [2019-09-08 10:57:58,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-08 10:57:58,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82284 states. [2019-09-08 10:58:05,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82284 to 26467. [2019-09-08 10:58:05,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26467 states. [2019-09-08 10:58:05,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26467 states to 26467 states and 37252 transitions. [2019-09-08 10:58:05,431 INFO L78 Accepts]: Start accepts. Automaton has 26467 states and 37252 transitions. Word has length 77 [2019-09-08 10:58:05,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:58:05,431 INFO L475 AbstractCegarLoop]: Abstraction has 26467 states and 37252 transitions. [2019-09-08 10:58:05,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:58:05,431 INFO L276 IsEmpty]: Start isEmpty. Operand 26467 states and 37252 transitions. [2019-09-08 10:58:05,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 10:58:05,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:58:05,436 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] [2019-09-08 10:58:05,436 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:58:05,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:58:05,436 INFO L82 PathProgramCache]: Analyzing trace with hash 386283916, now seen corresponding path program 1 times [2019-09-08 10:58:05,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:58:05,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:58:05,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:58:05,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:58:05,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:58:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:58:05,516 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 10:58:05,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:58:05,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:58:05,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:58:05,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:58:05,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:58:05,517 INFO L87 Difference]: Start difference. First operand 26467 states and 37252 transitions. Second operand 3 states. [2019-09-08 10:58:12,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:58:12,552 INFO L93 Difference]: Finished difference Result 41149 states and 57869 transitions. [2019-09-08 10:58:12,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:58:12,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-08 10:58:12,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:58:12,580 INFO L225 Difference]: With dead ends: 41149 [2019-09-08 10:58:12,580 INFO L226 Difference]: Without dead ends: 26471 [2019-09-08 10:58:12,594 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 10:58:12,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26471 states. [2019-09-08 10:58:19,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26471 to 26467. [2019-09-08 10:58:19,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26467 states. [2019-09-08 10:58:19,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26467 states to 26467 states and 36863 transitions. [2019-09-08 10:58:19,716 INFO L78 Accepts]: Start accepts. Automaton has 26467 states and 36863 transitions. Word has length 78 [2019-09-08 10:58:19,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:58:19,716 INFO L475 AbstractCegarLoop]: Abstraction has 26467 states and 36863 transitions. [2019-09-08 10:58:19,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:58:19,716 INFO L276 IsEmpty]: Start isEmpty. Operand 26467 states and 36863 transitions. [2019-09-08 10:58:19,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 10:58:19,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:58:19,721 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] [2019-09-08 10:58:19,721 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:58:19,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:58:19,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1282642039, now seen corresponding path program 1 times [2019-09-08 10:58:19,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:58:19,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:58:19,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:58:19,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:58:19,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:58:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:58:19,787 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 10:58:19,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:58:19,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:58:19,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:58:19,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:58:19,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:58:19,789 INFO L87 Difference]: Start difference. First operand 26467 states and 36863 transitions. Second operand 3 states. [2019-09-08 10:58:30,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:58:30,713 INFO L93 Difference]: Finished difference Result 55766 states and 78062 transitions. [2019-09-08 10:58:30,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:58:30,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-08 10:58:30,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:58:30,755 INFO L225 Difference]: With dead ends: 55766 [2019-09-08 10:58:30,755 INFO L226 Difference]: Without dead ends: 40568 [2019-09-08 10:58:30,771 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 10:58:30,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40568 states. [2019-09-08 10:58:39,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40568 to 26353. [2019-09-08 10:58:39,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26353 states. [2019-09-08 10:58:39,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26353 states to 26353 states and 36637 transitions. [2019-09-08 10:58:39,413 INFO L78 Accepts]: Start accepts. Automaton has 26353 states and 36637 transitions. Word has length 80 [2019-09-08 10:58:39,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:58:39,413 INFO L475 AbstractCegarLoop]: Abstraction has 26353 states and 36637 transitions. [2019-09-08 10:58:39,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:58:39,414 INFO L276 IsEmpty]: Start isEmpty. Operand 26353 states and 36637 transitions. [2019-09-08 10:58:39,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 10:58:39,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:58:39,418 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] [2019-09-08 10:58:39,418 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:58:39,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:58:39,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1433154749, now seen corresponding path program 1 times [2019-09-08 10:58:39,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:58:39,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:58:39,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:58:39,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:58:39,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:58:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:58:40,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:58:40,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:58:40,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 10:58:40,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 10:58:40,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 10:58:40,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-09-08 10:58:40,138 INFO L87 Difference]: Start difference. First operand 26353 states and 36637 transitions. Second operand 17 states. [2019-09-08 10:58:40,716 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-08 10:58:56,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:58:56,832 INFO L93 Difference]: Finished difference Result 47277 states and 65943 transitions. [2019-09-08 10:58:56,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 10:58:56,834 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 80 [2019-09-08 10:58:56,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:58:56,875 INFO L225 Difference]: With dead ends: 47277 [2019-09-08 10:58:56,875 INFO L226 Difference]: Without dead ends: 43733 [2019-09-08 10:58:56,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2019-09-08 10:58:56,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43733 states. [2019-09-08 10:59:05,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43733 to 26321. [2019-09-08 10:59:05,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26321 states. [2019-09-08 10:59:05,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26321 states to 26321 states and 36597 transitions. [2019-09-08 10:59:05,625 INFO L78 Accepts]: Start accepts. Automaton has 26321 states and 36597 transitions. Word has length 80 [2019-09-08 10:59:05,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:59:05,625 INFO L475 AbstractCegarLoop]: Abstraction has 26321 states and 36597 transitions. [2019-09-08 10:59:05,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 10:59:05,625 INFO L276 IsEmpty]: Start isEmpty. Operand 26321 states and 36597 transitions. [2019-09-08 10:59:05,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 10:59:05,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:05,630 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] [2019-09-08 10:59:05,631 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:05,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:05,631 INFO L82 PathProgramCache]: Analyzing trace with hash 81860216, now seen corresponding path program 1 times [2019-09-08 10:59:05,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:05,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:05,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:05,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:05,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:06,505 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 10:59:06,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:59:06,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 10:59:06,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 10:59:06,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 10:59:06,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-09-08 10:59:06,507 INFO L87 Difference]: Start difference. First operand 26321 states and 36597 transitions. Second operand 16 states. [2019-09-08 10:59:07,133 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-09-08 10:59:07,345 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-08 10:59:07,626 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-08 10:59:07,833 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-08 10:59:08,023 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-08 10:59:36,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:59:36,697 INFO L93 Difference]: Finished difference Result 82916 states and 116404 transitions. [2019-09-08 10:59:36,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 10:59:36,698 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 81 [2019-09-08 10:59:36,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:59:36,778 INFO L225 Difference]: With dead ends: 82916 [2019-09-08 10:59:36,778 INFO L226 Difference]: Without dead ends: 79402 [2019-09-08 10:59:36,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2019-09-08 10:59:36,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79402 states. [2019-09-08 10:59:46,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79402 to 26317. [2019-09-08 10:59:46,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26317 states. [2019-09-08 10:59:46,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26317 states to 26317 states and 36592 transitions. [2019-09-08 10:59:46,298 INFO L78 Accepts]: Start accepts. Automaton has 26317 states and 36592 transitions. Word has length 81 [2019-09-08 10:59:46,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:59:46,298 INFO L475 AbstractCegarLoop]: Abstraction has 26317 states and 36592 transitions. [2019-09-08 10:59:46,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 10:59:46,298 INFO L276 IsEmpty]: Start isEmpty. Operand 26317 states and 36592 transitions. [2019-09-08 10:59:46,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 10:59:46,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:46,312 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:59:46,313 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:46,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:46,313 INFO L82 PathProgramCache]: Analyzing trace with hash 2040450539, now seen corresponding path program 1 times [2019-09-08 10:59:46,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:46,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:46,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:46,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:46,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:46,441 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 10:59:46,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:59:46,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:59:46,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:59:46,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:59:46,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:59:46,442 INFO L87 Difference]: Start difference. First operand 26317 states and 36592 transitions. Second operand 7 states. [2019-09-08 11:00:53,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:00:53,796 INFO L93 Difference]: Finished difference Result 203111 states and 284625 transitions. [2019-09-08 11:00:53,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 11:00:53,796 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-08 11:00:53,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:00:54,021 INFO L225 Difference]: With dead ends: 203111 [2019-09-08 11:00:54,021 INFO L226 Difference]: Without dead ends: 178614 [2019-09-08 11:00:54,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:00:54,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178614 states. [2019-09-08 11:01:29,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178614 to 99577. [2019-09-08 11:01:29,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99577 states. [2019-09-08 11:01:29,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99577 states to 99577 states and 137677 transitions. [2019-09-08 11:01:29,369 INFO L78 Accepts]: Start accepts. Automaton has 99577 states and 137677 transitions. Word has length 90 [2019-09-08 11:01:29,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:01:29,370 INFO L475 AbstractCegarLoop]: Abstraction has 99577 states and 137677 transitions. [2019-09-08 11:01:29,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:01:29,370 INFO L276 IsEmpty]: Start isEmpty. Operand 99577 states and 137677 transitions. [2019-09-08 11:01:29,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 11:01:29,389 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:01:29,390 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:01:29,390 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:01:29,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:01:29,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1916809887, now seen corresponding path program 1 times [2019-09-08 11:01:29,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:01:29,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:01:29,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:29,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:01:29,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:01:29,524 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:01:29,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:01:29,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:01:29,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:01:29,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:01:29,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:01:29,526 INFO L87 Difference]: Start difference. First operand 99577 states and 137677 transitions. Second operand 6 states. [2019-09-08 11:02:14,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:14,611 INFO L93 Difference]: Finished difference Result 149324 states and 204862 transitions. [2019-09-08 11:02:14,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:02:14,611 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-09-08 11:02:14,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:14,758 INFO L225 Difference]: With dead ends: 149324 [2019-09-08 11:02:14,758 INFO L226 Difference]: Without dead ends: 113478 [2019-09-08 11:02:14,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:02:14,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113478 states. [2019-09-08 11:02:53,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113478 to 85016. [2019-09-08 11:02:53,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85016 states. [2019-09-08 11:02:53,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85016 states to 85016 states and 115362 transitions. [2019-09-08 11:02:53,573 INFO L78 Accepts]: Start accepts. Automaton has 85016 states and 115362 transitions. Word has length 91 [2019-09-08 11:02:53,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:53,574 INFO L475 AbstractCegarLoop]: Abstraction has 85016 states and 115362 transitions. [2019-09-08 11:02:53,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:02:53,574 INFO L276 IsEmpty]: Start isEmpty. Operand 85016 states and 115362 transitions. [2019-09-08 11:02:53,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 11:02:53,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:53,592 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:02:53,592 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:53,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:53,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1828567747, now seen corresponding path program 1 times [2019-09-08 11:02:53,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:53,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:53,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:53,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:53,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:53,705 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:02:53,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:53,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:02:53,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:02:53,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:02:53,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:02:53,707 INFO L87 Difference]: Start difference. First operand 85016 states and 115362 transitions. Second operand 6 states. [2019-09-08 11:04:00,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:04:00,447 INFO L93 Difference]: Finished difference Result 156106 states and 210339 transitions. [2019-09-08 11:04:00,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:04:00,448 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-09-08 11:04:00,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:04:00,620 INFO L225 Difference]: With dead ends: 156106 [2019-09-08 11:04:00,620 INFO L226 Difference]: Without dead ends: 156104 [2019-09-08 11:04:00,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:04:00,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156104 states. [2019-09-08 11:04:40,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156104 to 86753. [2019-09-08 11:04:40,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86753 states. [2019-09-08 11:04:40,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86753 states to 86753 states and 116520 transitions. [2019-09-08 11:04:40,539 INFO L78 Accepts]: Start accepts. Automaton has 86753 states and 116520 transitions. Word has length 92 [2019-09-08 11:04:40,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:04:40,540 INFO L475 AbstractCegarLoop]: Abstraction has 86753 states and 116520 transitions. [2019-09-08 11:04:40,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:04:40,540 INFO L276 IsEmpty]: Start isEmpty. Operand 86753 states and 116520 transitions. [2019-09-08 11:04:40,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 11:04:40,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:04:40,559 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:04:40,559 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:04:40,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:04:40,560 INFO L82 PathProgramCache]: Analyzing trace with hash -375474182, now seen corresponding path program 1 times [2019-09-08 11:04:40,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:04:40,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:04:40,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:40,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:04:40,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:04:40,638 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:04:40,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:04:40,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:04:40,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:04:40,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:04:40,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:04:40,641 INFO L87 Difference]: Start difference. First operand 86753 states and 116520 transitions. Second operand 3 states. [2019-09-08 11:05:47,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:05:47,527 INFO L93 Difference]: Finished difference Result 242533 states and 325752 transitions. [2019-09-08 11:05:47,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:05:47,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-09-08 11:05:47,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:05:47,742 INFO L225 Difference]: With dead ends: 242533 [2019-09-08 11:05:47,742 INFO L226 Difference]: Without dead ends: 157536 [2019-09-08 11:05:47,807 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:05:47,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157536 states.