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.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:06:05,118 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:06:05,122 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:06:05,140 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:06:05,140 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:06:05,142 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:06:05,144 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:06:05,157 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:06:05,159 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:06:05,160 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:06:05,163 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:06:05,165 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:06:05,165 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:06:05,166 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:06:05,170 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:06:05,172 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:06:05,173 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:06:05,177 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:06:05,179 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:06:05,185 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:06:05,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:06:05,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:06:05,192 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:06:05,193 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:06:05,196 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:06:05,196 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:06:05,196 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:06:05,199 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:06:05,200 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:06:05,201 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:06:05,201 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:06:05,203 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:06:05,204 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:06:05,205 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:06:05,207 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:06:05,207 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:06:05,208 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:06:05,208 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:06:05,208 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:06:05,210 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:06:05,211 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:06:05,212 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 12:06:05,237 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:06:05,237 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:06:05,239 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:06:05,240 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:06:05,240 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:06:05,240 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:06:05,241 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:06:05,241 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:06:05,241 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:06:05,241 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:06:05,242 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:06:05,242 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:06:05,243 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:06:05,243 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:06:05,243 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:06:05,244 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:06:05,244 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:06:05,244 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:06:05,244 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:06:05,244 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:06:05,245 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:06:05,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:06:05,245 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:06:05,245 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:06:05,246 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:06:05,246 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:06:05,246 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:06:05,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:06:05,247 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:06:05,298 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:06:05,315 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:06:05,320 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:06:05,322 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:06:05,322 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:06:05,323 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-08 12:06:05,394 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71422b46d/ee08cc300df245b39bf24d8361c3989f/FLAGaf93c5b21 [2019-09-08 12:06:05,947 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:06:05,948 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-08 12:06:05,967 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71422b46d/ee08cc300df245b39bf24d8361c3989f/FLAGaf93c5b21 [2019-09-08 12:06:06,241 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71422b46d/ee08cc300df245b39bf24d8361c3989f [2019-09-08 12:06:06,252 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:06:06,253 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:06:06,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:06:06,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:06:06,258 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:06:06,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:06:06" (1/1) ... [2019-09-08 12:06:06,261 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45625c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:06:06, skipping insertion in model container [2019-09-08 12:06:06,261 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:06:06" (1/1) ... [2019-09-08 12:06:06,269 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:06:06,324 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:06:06,833 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:06:06,861 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:06:07,161 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:06:07,193 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:06:07,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:06:07 WrapperNode [2019-09-08 12:06:07,195 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:06:07,195 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:06:07,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:06:07,196 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:06:07,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:06:07" (1/1) ... [2019-09-08 12:06:07,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:06:07" (1/1) ... [2019-09-08 12:06:07,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:06:07" (1/1) ... [2019-09-08 12:06:07,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:06:07" (1/1) ... [2019-09-08 12:06:07,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:06:07" (1/1) ... [2019-09-08 12:06:07,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:06:07" (1/1) ... [2019-09-08 12:06:07,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:06:07" (1/1) ... [2019-09-08 12:06:07,329 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:06:07,330 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:06:07,330 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:06:07,330 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:06:07,333 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:06:07" (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 12:06:07,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:06:07,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:06:07,392 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:06:07,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:06:07,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:06:07,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:06:07,393 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:06:07,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:06:07,393 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:06:07,393 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:06:07,394 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:06:07,396 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:06:07,396 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:06:07,397 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:06:07,397 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:06:07,397 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:06:07,397 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:06:07,397 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:06:07,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:06:07,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:06:08,690 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:06:08,692 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:06:08,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:06:08 BoogieIcfgContainer [2019-09-08 12:06:08,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:06:08,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:06:08,694 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:06:08,698 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:06:08,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:06:06" (1/3) ... [2019-09-08 12:06:08,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7424ca9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:06:08, skipping insertion in model container [2019-09-08 12:06:08,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:06:07" (2/3) ... [2019-09-08 12:06:08,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7424ca9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:06:08, skipping insertion in model container [2019-09-08 12:06:08,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:06:08" (3/3) ... [2019-09-08 12:06:08,706 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-08 12:06:08,718 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:06:08,743 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:06:08,762 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:06:08,816 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:06:08,816 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:06:08,817 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:06:08,817 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:06:08,817 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:06:08,817 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:06:08,817 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:06:08,817 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:06:08,817 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:06:08,854 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states. [2019-09-08 12:06:08,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 12:06:08,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:08,886 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:06:08,888 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:08,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:08,895 INFO L82 PathProgramCache]: Analyzing trace with hash 727976503, now seen corresponding path program 1 times [2019-09-08 12:06:08,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:08,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:08,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:08,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:08,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:09,346 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 12:06:09,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:09,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:06:09,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:06:09,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:06:09,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:06:09,373 INFO L87 Difference]: Start difference. First operand 336 states. Second operand 4 states. [2019-09-08 12:06:09,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:09,589 INFO L93 Difference]: Finished difference Result 639 states and 1040 transitions. [2019-09-08 12:06:09,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:06:09,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-09-08 12:06:09,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:09,626 INFO L225 Difference]: With dead ends: 639 [2019-09-08 12:06:09,627 INFO L226 Difference]: Without dead ends: 332 [2019-09-08 12:06:09,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:06:09,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-08 12:06:09,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2019-09-08 12:06:09,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-09-08 12:06:09,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 507 transitions. [2019-09-08 12:06:09,764 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 507 transitions. Word has length 131 [2019-09-08 12:06:09,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:09,765 INFO L475 AbstractCegarLoop]: Abstraction has 332 states and 507 transitions. [2019-09-08 12:06:09,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:06:09,766 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 507 transitions. [2019-09-08 12:06:09,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 12:06:09,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:09,777 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:06:09,778 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:09,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:09,779 INFO L82 PathProgramCache]: Analyzing trace with hash -956343336, now seen corresponding path program 1 times [2019-09-08 12:06:09,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:09,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:09,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:09,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:09,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:10,096 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 12:06:10,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:10,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:06:10,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:06:10,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:06:10,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:06:10,101 INFO L87 Difference]: Start difference. First operand 332 states and 507 transitions. Second operand 3 states. [2019-09-08 12:06:10,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:10,189 INFO L93 Difference]: Finished difference Result 816 states and 1279 transitions. [2019-09-08 12:06:10,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:06:10,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-09-08 12:06:10,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:10,193 INFO L225 Difference]: With dead ends: 816 [2019-09-08 12:06:10,194 INFO L226 Difference]: Without dead ends: 529 [2019-09-08 12:06:10,195 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 12:06:10,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-09-08 12:06:10,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 527. [2019-09-08 12:06:10,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-09-08 12:06:10,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 815 transitions. [2019-09-08 12:06:10,220 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 815 transitions. Word has length 161 [2019-09-08 12:06:10,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:10,221 INFO L475 AbstractCegarLoop]: Abstraction has 527 states and 815 transitions. [2019-09-08 12:06:10,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:06:10,221 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 815 transitions. [2019-09-08 12:06:10,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 12:06:10,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:10,224 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:06:10,224 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:10,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:10,225 INFO L82 PathProgramCache]: Analyzing trace with hash 179469100, now seen corresponding path program 1 times [2019-09-08 12:06:10,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:10,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:10,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:10,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:10,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:10,385 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 12:06:10,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:10,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:06:10,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:06:10,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:06:10,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:06:10,389 INFO L87 Difference]: Start difference. First operand 527 states and 815 transitions. Second operand 3 states. [2019-09-08 12:06:10,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:10,475 INFO L93 Difference]: Finished difference Result 1355 states and 2132 transitions. [2019-09-08 12:06:10,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:06:10,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-09-08 12:06:10,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:10,481 INFO L225 Difference]: With dead ends: 1355 [2019-09-08 12:06:10,482 INFO L226 Difference]: Without dead ends: 879 [2019-09-08 12:06:10,483 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 12:06:10,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2019-09-08 12:06:10,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 877. [2019-09-08 12:06:10,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2019-09-08 12:06:10,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1365 transitions. [2019-09-08 12:06:10,517 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1365 transitions. Word has length 164 [2019-09-08 12:06:10,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:10,518 INFO L475 AbstractCegarLoop]: Abstraction has 877 states and 1365 transitions. [2019-09-08 12:06:10,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:06:10,518 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1365 transitions. [2019-09-08 12:06:10,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 12:06:10,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:10,522 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:06:10,522 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:10,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:10,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1011258605, now seen corresponding path program 1 times [2019-09-08 12:06:10,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:10,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:10,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:10,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:10,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:10,671 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 12:06:10,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:10,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:06:10,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:06:10,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:06:10,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:06:10,673 INFO L87 Difference]: Start difference. First operand 877 states and 1365 transitions. Second operand 3 states. [2019-09-08 12:06:10,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:10,778 INFO L93 Difference]: Finished difference Result 2315 states and 3640 transitions. [2019-09-08 12:06:10,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:06:10,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-09-08 12:06:10,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:10,790 INFO L225 Difference]: With dead ends: 2315 [2019-09-08 12:06:10,790 INFO L226 Difference]: Without dead ends: 1495 [2019-09-08 12:06:10,793 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 12:06:10,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2019-09-08 12:06:10,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1493. [2019-09-08 12:06:10,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1493 states. [2019-09-08 12:06:10,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 2325 transitions. [2019-09-08 12:06:10,856 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 2325 transitions. Word has length 167 [2019-09-08 12:06:10,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:10,858 INFO L475 AbstractCegarLoop]: Abstraction has 1493 states and 2325 transitions. [2019-09-08 12:06:10,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:06:10,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 2325 transitions. [2019-09-08 12:06:10,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 12:06:10,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:10,864 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:06:10,864 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:10,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:10,865 INFO L82 PathProgramCache]: Analyzing trace with hash 654878474, now seen corresponding path program 1 times [2019-09-08 12:06:10,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:10,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:10,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:10,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:10,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:10,962 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 12:06:10,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:10,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:06:10,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:06:10,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:06:10,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:06:10,965 INFO L87 Difference]: Start difference. First operand 1493 states and 2325 transitions. Second operand 3 states. [2019-09-08 12:06:11,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:11,097 INFO L93 Difference]: Finished difference Result 3985 states and 6236 transitions. [2019-09-08 12:06:11,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:06:11,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-09-08 12:06:11,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:11,138 INFO L225 Difference]: With dead ends: 3985 [2019-09-08 12:06:11,138 INFO L226 Difference]: Without dead ends: 2555 [2019-09-08 12:06:11,141 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 12:06:11,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2019-09-08 12:06:11,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 2553. [2019-09-08 12:06:11,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2553 states. [2019-09-08 12:06:11,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 3957 transitions. [2019-09-08 12:06:11,241 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 3957 transitions. Word has length 170 [2019-09-08 12:06:11,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:11,242 INFO L475 AbstractCegarLoop]: Abstraction has 2553 states and 3957 transitions. [2019-09-08 12:06:11,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:06:11,242 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 3957 transitions. [2019-09-08 12:06:11,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 12:06:11,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:11,250 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:06:11,250 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:11,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:11,250 INFO L82 PathProgramCache]: Analyzing trace with hash -2027212929, now seen corresponding path program 1 times [2019-09-08 12:06:11,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:11,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:11,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:11,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:11,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:11,344 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 12:06:11,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:11,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:06:11,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:06:11,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:06:11,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:06:11,346 INFO L87 Difference]: Start difference. First operand 2553 states and 3957 transitions. Second operand 3 states. [2019-09-08 12:06:11,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:11,548 INFO L93 Difference]: Finished difference Result 6811 states and 10564 transitions. [2019-09-08 12:06:11,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:06:11,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-08 12:06:11,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:11,569 INFO L225 Difference]: With dead ends: 6811 [2019-09-08 12:06:11,569 INFO L226 Difference]: Without dead ends: 4327 [2019-09-08 12:06:11,575 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 12:06:11,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4327 states. [2019-09-08 12:06:11,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4327 to 4325. [2019-09-08 12:06:11,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4325 states. [2019-09-08 12:06:11,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4325 states to 4325 states and 6637 transitions. [2019-09-08 12:06:11,855 INFO L78 Accepts]: Start accepts. Automaton has 4325 states and 6637 transitions. Word has length 173 [2019-09-08 12:06:11,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:11,856 INFO L475 AbstractCegarLoop]: Abstraction has 4325 states and 6637 transitions. [2019-09-08 12:06:11,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:06:11,856 INFO L276 IsEmpty]: Start isEmpty. Operand 4325 states and 6637 transitions. [2019-09-08 12:06:11,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 12:06:11,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:11,876 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:06:11,877 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:11,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:11,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1452477050, now seen corresponding path program 1 times [2019-09-08 12:06:11,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:11,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:11,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:11,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:11,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:12,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:06:12,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:12,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:06:12,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:06:12,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:06:12,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:06:12,093 INFO L87 Difference]: Start difference. First operand 4325 states and 6637 transitions. Second operand 3 states. [2019-09-08 12:06:12,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:12,901 INFO L93 Difference]: Finished difference Result 12488 states and 19182 transitions. [2019-09-08 12:06:12,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:06:12,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-08 12:06:12,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:12,942 INFO L225 Difference]: With dead ends: 12488 [2019-09-08 12:06:12,943 INFO L226 Difference]: Without dead ends: 8558 [2019-09-08 12:06:12,954 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 12:06:12,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8558 states. [2019-09-08 12:06:13,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8558 to 8556. [2019-09-08 12:06:13,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8556 states. [2019-09-08 12:06:13,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8556 states to 8556 states and 13081 transitions. [2019-09-08 12:06:13,379 INFO L78 Accepts]: Start accepts. Automaton has 8556 states and 13081 transitions. Word has length 176 [2019-09-08 12:06:13,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:13,379 INFO L475 AbstractCegarLoop]: Abstraction has 8556 states and 13081 transitions. [2019-09-08 12:06:13,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:06:13,380 INFO L276 IsEmpty]: Start isEmpty. Operand 8556 states and 13081 transitions. [2019-09-08 12:06:13,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 12:06:13,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:13,401 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:06:13,401 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:13,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:13,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1141259162, now seen corresponding path program 1 times [2019-09-08 12:06:13,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:13,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:13,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:13,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:13,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:13,520 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 12:06:13,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:13,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:06:13,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:06:13,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:06:13,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:06:13,522 INFO L87 Difference]: Start difference. First operand 8556 states and 13081 transitions. Second operand 3 states. [2019-09-08 12:06:14,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:14,367 INFO L93 Difference]: Finished difference Result 24327 states and 37198 transitions. [2019-09-08 12:06:14,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:06:14,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-08 12:06:14,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:14,423 INFO L225 Difference]: With dead ends: 24327 [2019-09-08 12:06:14,424 INFO L226 Difference]: Without dead ends: 16941 [2019-09-08 12:06:14,442 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 12:06:14,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16941 states. [2019-09-08 12:06:15,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16941 to 16939. [2019-09-08 12:06:15,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16939 states. [2019-09-08 12:06:15,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16939 states to 16939 states and 25772 transitions. [2019-09-08 12:06:15,072 INFO L78 Accepts]: Start accepts. Automaton has 16939 states and 25772 transitions. Word has length 176 [2019-09-08 12:06:15,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:15,072 INFO L475 AbstractCegarLoop]: Abstraction has 16939 states and 25772 transitions. [2019-09-08 12:06:15,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:06:15,073 INFO L276 IsEmpty]: Start isEmpty. Operand 16939 states and 25772 transitions. [2019-09-08 12:06:15,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 12:06:15,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:15,114 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:06:15,114 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:15,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:15,114 INFO L82 PathProgramCache]: Analyzing trace with hash -62348085, now seen corresponding path program 1 times [2019-09-08 12:06:15,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:15,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:15,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:15,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:15,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:15,260 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 12:06:15,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:15,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:06:15,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:06:15,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:06:15,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:06:15,261 INFO L87 Difference]: Start difference. First operand 16939 states and 25772 transitions. Second operand 3 states. [2019-09-08 12:06:16,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:16,856 INFO L93 Difference]: Finished difference Result 47045 states and 71468 transitions. [2019-09-08 12:06:16,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:06:16,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-08 12:06:16,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:16,942 INFO L225 Difference]: With dead ends: 47045 [2019-09-08 12:06:16,943 INFO L226 Difference]: Without dead ends: 33507 [2019-09-08 12:06:16,975 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 12:06:17,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33507 states. [2019-09-08 12:06:17,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33507 to 33505. [2019-09-08 12:06:17,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33505 states. [2019-09-08 12:06:18,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33505 states to 33505 states and 50634 transitions. [2019-09-08 12:06:18,037 INFO L78 Accepts]: Start accepts. Automaton has 33505 states and 50634 transitions. Word has length 176 [2019-09-08 12:06:18,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:18,038 INFO L475 AbstractCegarLoop]: Abstraction has 33505 states and 50634 transitions. [2019-09-08 12:06:18,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:06:18,038 INFO L276 IsEmpty]: Start isEmpty. Operand 33505 states and 50634 transitions. [2019-09-08 12:06:18,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 12:06:18,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:18,139 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:06:18,140 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:18,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:18,140 INFO L82 PathProgramCache]: Analyzing trace with hash 574213830, now seen corresponding path program 1 times [2019-09-08 12:06:18,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:18,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:18,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:18,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:18,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:18,291 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 12:06:18,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:18,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:06:18,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:06:18,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:06:18,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:06:18,293 INFO L87 Difference]: Start difference. First operand 33505 states and 50634 transitions. Second operand 3 states. [2019-09-08 12:06:20,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:20,658 INFO L93 Difference]: Finished difference Result 96581 states and 145824 transitions. [2019-09-08 12:06:20,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:06:20,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-08 12:06:20,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:20,759 INFO L225 Difference]: With dead ends: 96581 [2019-09-08 12:06:20,760 INFO L226 Difference]: Without dead ends: 66555 [2019-09-08 12:06:20,827 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 12:06:20,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66555 states. [2019-09-08 12:06:22,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66555 to 66553. [2019-09-08 12:06:22,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66553 states. [2019-09-08 12:06:22,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66553 states to 66553 states and 100006 transitions. [2019-09-08 12:06:22,466 INFO L78 Accepts]: Start accepts. Automaton has 66553 states and 100006 transitions. Word has length 176 [2019-09-08 12:06:22,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:22,467 INFO L475 AbstractCegarLoop]: Abstraction has 66553 states and 100006 transitions. [2019-09-08 12:06:22,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:06:22,467 INFO L276 IsEmpty]: Start isEmpty. Operand 66553 states and 100006 transitions. [2019-09-08 12:06:23,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 12:06:23,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:23,648 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:06:23,648 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:23,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:23,648 INFO L82 PathProgramCache]: Analyzing trace with hash 446128523, now seen corresponding path program 1 times [2019-09-08 12:06:23,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:23,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:23,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:23,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:23,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:23,756 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 12:06:23,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:23,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:06:23,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:06:23,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:06:23,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:06:23,758 INFO L87 Difference]: Start difference. First operand 66553 states and 100006 transitions. Second operand 3 states. [2019-09-08 12:06:26,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:26,469 INFO L93 Difference]: Finished difference Result 188149 states and 282416 transitions. [2019-09-08 12:06:26,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:06:26,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-08 12:06:26,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:26,626 INFO L225 Difference]: With dead ends: 188149 [2019-09-08 12:06:26,626 INFO L226 Difference]: Without dead ends: 132083 [2019-09-08 12:06:26,694 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 12:06:26,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132083 states. [2019-09-08 12:06:31,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132083 to 132081. [2019-09-08 12:06:31,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132081 states. [2019-09-08 12:06:31,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132081 states to 132081 states and 197166 transitions. [2019-09-08 12:06:31,395 INFO L78 Accepts]: Start accepts. Automaton has 132081 states and 197166 transitions. Word has length 176 [2019-09-08 12:06:31,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:31,395 INFO L475 AbstractCegarLoop]: Abstraction has 132081 states and 197166 transitions. [2019-09-08 12:06:31,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:06:31,396 INFO L276 IsEmpty]: Start isEmpty. Operand 132081 states and 197166 transitions. [2019-09-08 12:06:31,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 12:06:31,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:31,515 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:06:31,516 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:31,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:31,516 INFO L82 PathProgramCache]: Analyzing trace with hash -325735130, now seen corresponding path program 1 times [2019-09-08 12:06:31,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:31,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:31,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:31,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:31,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:31,646 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 12:06:31,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:31,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:06:31,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:06:31,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:06:31,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:06:31,648 INFO L87 Difference]: Start difference. First operand 132081 states and 197166 transitions. Second operand 5 states. [2019-09-08 12:06:35,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:35,650 INFO L93 Difference]: Finished difference Result 190883 states and 284863 transitions. [2019-09-08 12:06:35,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:06:35,651 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 12:06:35,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:35,756 INFO L225 Difference]: With dead ends: 190883 [2019-09-08 12:06:35,756 INFO L226 Difference]: Without dead ends: 66469 [2019-09-08 12:06:35,836 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 12:06:35,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66469 states. [2019-09-08 12:06:37,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66469 to 66469. [2019-09-08 12:06:37,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66469 states. [2019-09-08 12:06:37,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66469 states to 66469 states and 99012 transitions. [2019-09-08 12:06:37,610 INFO L78 Accepts]: Start accepts. Automaton has 66469 states and 99012 transitions. Word has length 176 [2019-09-08 12:06:37,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:37,611 INFO L475 AbstractCegarLoop]: Abstraction has 66469 states and 99012 transitions. [2019-09-08 12:06:37,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:06:37,611 INFO L276 IsEmpty]: Start isEmpty. Operand 66469 states and 99012 transitions. [2019-09-08 12:06:37,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 12:06:37,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:37,676 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:06:37,677 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:37,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:37,677 INFO L82 PathProgramCache]: Analyzing trace with hash 861197675, now seen corresponding path program 1 times [2019-09-08 12:06:37,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:37,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:37,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:37,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:37,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:37,802 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 12:06:37,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:37,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:06:37,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:06:37,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:06:37,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:06:37,804 INFO L87 Difference]: Start difference. First operand 66469 states and 99012 transitions. Second operand 5 states. [2019-09-08 12:06:39,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:39,391 INFO L93 Difference]: Finished difference Result 94151 states and 140261 transitions. [2019-09-08 12:06:39,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:06:39,391 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 12:06:39,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:39,426 INFO L225 Difference]: With dead ends: 94151 [2019-09-08 12:06:39,426 INFO L226 Difference]: Without dead ends: 33505 [2019-09-08 12:06:39,465 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 12:06:39,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33505 states. [2019-09-08 12:06:40,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33505 to 33505. [2019-09-08 12:06:40,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33505 states. [2019-09-08 12:06:40,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33505 states to 33505 states and 49780 transitions. [2019-09-08 12:06:40,330 INFO L78 Accepts]: Start accepts. Automaton has 33505 states and 49780 transitions. Word has length 176 [2019-09-08 12:06:40,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:40,330 INFO L475 AbstractCegarLoop]: Abstraction has 33505 states and 49780 transitions. [2019-09-08 12:06:40,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:06:40,330 INFO L276 IsEmpty]: Start isEmpty. Operand 33505 states and 49780 transitions. [2019-09-08 12:06:40,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 12:06:40,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:40,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:06:40,360 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:40,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:40,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1046466736, now seen corresponding path program 1 times [2019-09-08 12:06:40,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:40,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:40,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:40,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:40,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:40,467 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 12:06:40,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:40,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:06:40,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:06:40,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:06:40,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:06:40,468 INFO L87 Difference]: Start difference. First operand 33505 states and 49780 transitions. Second operand 3 states. [2019-09-08 12:06:41,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:41,468 INFO L93 Difference]: Finished difference Result 51077 states and 75926 transitions. [2019-09-08 12:06:41,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:06:41,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-08 12:06:41,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:41,492 INFO L225 Difference]: With dead ends: 51077 [2019-09-08 12:06:41,492 INFO L226 Difference]: Without dead ends: 21907 [2019-09-08 12:06:41,514 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 12:06:41,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21907 states. [2019-09-08 12:06:42,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21907 to 21905. [2019-09-08 12:06:42,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21905 states. [2019-09-08 12:06:42,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21905 states to 21905 states and 32260 transitions. [2019-09-08 12:06:42,095 INFO L78 Accepts]: Start accepts. Automaton has 21905 states and 32260 transitions. Word has length 176 [2019-09-08 12:06:42,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:42,095 INFO L475 AbstractCegarLoop]: Abstraction has 21905 states and 32260 transitions. [2019-09-08 12:06:42,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:06:42,095 INFO L276 IsEmpty]: Start isEmpty. Operand 21905 states and 32260 transitions. [2019-09-08 12:06:42,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 12:06:42,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:42,110 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:06:42,110 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:42,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:42,111 INFO L82 PathProgramCache]: Analyzing trace with hash -2102840920, now seen corresponding path program 1 times [2019-09-08 12:06:42,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:42,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:42,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:42,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:42,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:42,206 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 12:06:42,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:42,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:06:42,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:06:42,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:06:42,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:06:42,208 INFO L87 Difference]: Start difference. First operand 21905 states and 32260 transitions. Second operand 3 states. [2019-09-08 12:06:42,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:42,559 INFO L93 Difference]: Finished difference Result 29957 states and 44246 transitions. [2019-09-08 12:06:42,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:06:42,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-08 12:06:42,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:42,576 INFO L225 Difference]: With dead ends: 29957 [2019-09-08 12:06:42,576 INFO L226 Difference]: Without dead ends: 11507 [2019-09-08 12:06:42,595 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 12:06:42,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11507 states. [2019-09-08 12:06:43,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11507 to 11505. [2019-09-08 12:06:43,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11505 states. [2019-09-08 12:06:43,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11505 states to 11505 states and 16804 transitions. [2019-09-08 12:06:43,128 INFO L78 Accepts]: Start accepts. Automaton has 11505 states and 16804 transitions. Word has length 176 [2019-09-08 12:06:43,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:43,128 INFO L475 AbstractCegarLoop]: Abstraction has 11505 states and 16804 transitions. [2019-09-08 12:06:43,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:06:43,128 INFO L276 IsEmpty]: Start isEmpty. Operand 11505 states and 16804 transitions. [2019-09-08 12:06:43,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 12:06:43,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:43,135 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:06:43,135 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:43,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:43,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1417214282, now seen corresponding path program 1 times [2019-09-08 12:06:43,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:43,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:43,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:43,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:43,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:43,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 12:06:43,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:43,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:06:43,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:06:43,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:06:43,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:06:43,313 INFO L87 Difference]: Start difference. First operand 11505 states and 16804 transitions. Second operand 7 states. [2019-09-08 12:06:45,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:45,965 INFO L93 Difference]: Finished difference Result 92429 states and 134568 transitions. [2019-09-08 12:06:45,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:06:45,966 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 176 [2019-09-08 12:06:45,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:46,042 INFO L225 Difference]: With dead ends: 92429 [2019-09-08 12:06:46,042 INFO L226 Difference]: Without dead ends: 81103 [2019-09-08 12:06:46,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:06:46,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81103 states. [2019-09-08 12:06:47,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81103 to 33153. [2019-09-08 12:06:47,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33153 states. [2019-09-08 12:06:47,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33153 states to 33153 states and 47724 transitions. [2019-09-08 12:06:47,579 INFO L78 Accepts]: Start accepts. Automaton has 33153 states and 47724 transitions. Word has length 176 [2019-09-08 12:06:47,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:47,579 INFO L475 AbstractCegarLoop]: Abstraction has 33153 states and 47724 transitions. [2019-09-08 12:06:47,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:06:47,580 INFO L276 IsEmpty]: Start isEmpty. Operand 33153 states and 47724 transitions. [2019-09-08 12:06:47,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 12:06:47,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:47,606 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:06:47,606 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:47,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:47,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1798072305, now seen corresponding path program 1 times [2019-09-08 12:06:47,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:47,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:47,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:47,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:47,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:47,717 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 12:06:47,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:47,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:06:47,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:06:47,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:06:47,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:06:47,719 INFO L87 Difference]: Start difference. First operand 33153 states and 47724 transitions. Second operand 3 states. [2019-09-08 12:06:48,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:48,564 INFO L93 Difference]: Finished difference Result 47325 states and 68086 transitions. [2019-09-08 12:06:48,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:06:48,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-08 12:06:48,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:48,583 INFO L225 Difference]: With dead ends: 47325 [2019-09-08 12:06:48,583 INFO L226 Difference]: Without dead ends: 16943 [2019-09-08 12:06:48,605 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 12:06:48,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16943 states. [2019-09-08 12:06:49,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16943 to 16941. [2019-09-08 12:06:49,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16941 states. [2019-09-08 12:06:49,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16941 states to 16941 states and 24208 transitions. [2019-09-08 12:06:49,205 INFO L78 Accepts]: Start accepts. Automaton has 16941 states and 24208 transitions. Word has length 180 [2019-09-08 12:06:49,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:49,206 INFO L475 AbstractCegarLoop]: Abstraction has 16941 states and 24208 transitions. [2019-09-08 12:06:49,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:06:49,206 INFO L276 IsEmpty]: Start isEmpty. Operand 16941 states and 24208 transitions. [2019-09-08 12:06:49,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 12:06:49,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:49,218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:06:49,218 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:49,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:49,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1122250367, now seen corresponding path program 1 times [2019-09-08 12:06:49,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:49,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:49,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:49,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:49,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:49,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:06:49,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:49,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:06:49,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:06:49,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:06:49,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:06:49,412 INFO L87 Difference]: Start difference. First operand 16941 states and 24208 transitions. Second operand 7 states. [2019-09-08 12:06:51,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:51,470 INFO L93 Difference]: Finished difference Result 58801 states and 83574 transitions. [2019-09-08 12:06:51,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 12:06:51,470 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 180 [2019-09-08 12:06:51,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:51,527 INFO L225 Difference]: With dead ends: 58801 [2019-09-08 12:06:51,528 INFO L226 Difference]: Without dead ends: 46111 [2019-09-08 12:06:51,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:06:51,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46111 states. [2019-09-08 12:06:52,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46111 to 27117. [2019-09-08 12:06:52,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27117 states. [2019-09-08 12:06:52,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27117 states to 27117 states and 38432 transitions. [2019-09-08 12:06:52,781 INFO L78 Accepts]: Start accepts. Automaton has 27117 states and 38432 transitions. Word has length 180 [2019-09-08 12:06:52,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:52,782 INFO L475 AbstractCegarLoop]: Abstraction has 27117 states and 38432 transitions. [2019-09-08 12:06:52,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:06:52,782 INFO L276 IsEmpty]: Start isEmpty. Operand 27117 states and 38432 transitions. [2019-09-08 12:06:52,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 12:06:52,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:52,804 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:06:52,804 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:52,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:52,805 INFO L82 PathProgramCache]: Analyzing trace with hash 253022843, now seen corresponding path program 1 times [2019-09-08 12:06:52,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:52,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:52,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:52,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:52,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:53,162 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 12:06:53,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:53,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:06:53,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:06:53,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:06:53,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:06:53,163 INFO L87 Difference]: Start difference. First operand 27117 states and 38432 transitions. Second operand 7 states. [2019-09-08 12:06:55,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:55,884 INFO L93 Difference]: Finished difference Result 67761 states and 96086 transitions. [2019-09-08 12:06:55,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 12:06:55,885 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 180 [2019-09-08 12:06:55,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:55,935 INFO L225 Difference]: With dead ends: 67761 [2019-09-08 12:06:55,935 INFO L226 Difference]: Without dead ends: 56287 [2019-09-08 12:06:55,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:06:55,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56287 states. [2019-09-08 12:06:57,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56287 to 41173. [2019-09-08 12:06:57,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41173 states. [2019-09-08 12:06:57,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41173 states to 41173 states and 58024 transitions. [2019-09-08 12:06:57,924 INFO L78 Accepts]: Start accepts. Automaton has 41173 states and 58024 transitions. Word has length 180 [2019-09-08 12:06:57,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:57,924 INFO L475 AbstractCegarLoop]: Abstraction has 41173 states and 58024 transitions. [2019-09-08 12:06:57,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:06:57,924 INFO L276 IsEmpty]: Start isEmpty. Operand 41173 states and 58024 transitions. [2019-09-08 12:06:57,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 12:06:57,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:57,950 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:06:57,951 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:57,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:57,951 INFO L82 PathProgramCache]: Analyzing trace with hash -440755211, now seen corresponding path program 1 times [2019-09-08 12:06:57,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:57,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:57,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:57,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:57,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:58,143 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 12:06:58,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:58,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:06:58,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:06:58,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:06:58,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:06:58,145 INFO L87 Difference]: Start difference. First operand 41173 states and 58024 transitions. Second operand 7 states. [2019-09-08 12:07:01,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:07:01,549 INFO L93 Difference]: Finished difference Result 77977 states and 110398 transitions. [2019-09-08 12:07:01,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 12:07:01,550 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 180 [2019-09-08 12:07:01,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:07:01,613 INFO L225 Difference]: With dead ends: 77977 [2019-09-08 12:07:01,614 INFO L226 Difference]: Without dead ends: 65287 [2019-09-08 12:07:01,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:07:01,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65287 states. [2019-09-08 12:07:04,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65287 to 51253. [2019-09-08 12:07:04,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51253 states. [2019-09-08 12:07:04,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51253 states to 51253 states and 72104 transitions. [2019-09-08 12:07:04,536 INFO L78 Accepts]: Start accepts. Automaton has 51253 states and 72104 transitions. Word has length 180 [2019-09-08 12:07:04,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:07:04,536 INFO L475 AbstractCegarLoop]: Abstraction has 51253 states and 72104 transitions. [2019-09-08 12:07:04,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:07:04,536 INFO L276 IsEmpty]: Start isEmpty. Operand 51253 states and 72104 transitions. [2019-09-08 12:07:04,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 12:07:04,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:07:04,568 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:07:04,568 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:07:04,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:07:04,568 INFO L82 PathProgramCache]: Analyzing trace with hash 202217735, now seen corresponding path program 1 times [2019-09-08 12:07:04,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:07:04,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:07:04,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:04,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:07:04,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:07:04,737 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 12:07:04,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:07:04,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:07:04,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:07:04,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:07:04,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:07:04,740 INFO L87 Difference]: Start difference. First operand 51253 states and 72104 transitions. Second operand 7 states. [2019-09-08 12:07:09,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:07:09,787 INFO L93 Difference]: Finished difference Result 83901 states and 118906 transitions. [2019-09-08 12:07:09,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 12:07:09,787 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 180 [2019-09-08 12:07:09,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:07:09,866 INFO L225 Difference]: With dead ends: 83901 [2019-09-08 12:07:09,866 INFO L226 Difference]: Without dead ends: 79587 [2019-09-08 12:07:09,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:07:09,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79587 states. [2019-09-08 12:07:12,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79587 to 56277. [2019-09-08 12:07:12,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56277 states. [2019-09-08 12:07:13,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56277 states to 56277 states and 79208 transitions. [2019-09-08 12:07:13,042 INFO L78 Accepts]: Start accepts. Automaton has 56277 states and 79208 transitions. Word has length 180 [2019-09-08 12:07:13,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:07:13,043 INFO L475 AbstractCegarLoop]: Abstraction has 56277 states and 79208 transitions. [2019-09-08 12:07:13,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:07:13,043 INFO L276 IsEmpty]: Start isEmpty. Operand 56277 states and 79208 transitions. [2019-09-08 12:07:13,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 12:07:13,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:07:13,077 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:07:13,077 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:07:13,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:07:13,077 INFO L82 PathProgramCache]: Analyzing trace with hash -200791795, now seen corresponding path program 1 times [2019-09-08 12:07:13,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:07:13,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:07:13,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:13,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:07:13,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:07:13,272 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 12:07:13,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:07:13,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:07:13,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:07:13,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:07:13,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:07:13,275 INFO L87 Difference]: Start difference. First operand 56277 states and 79208 transitions. Second operand 7 states. [2019-09-08 12:07:17,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:07:17,570 INFO L93 Difference]: Finished difference Result 90505 states and 128334 transitions. [2019-09-08 12:07:17,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 12:07:17,572 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 180 [2019-09-08 12:07:17,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:07:17,661 INFO L225 Difference]: With dead ends: 90505 [2019-09-08 12:07:17,662 INFO L226 Difference]: Without dead ends: 85607 [2019-09-08 12:07:17,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:07:17,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85607 states. [2019-09-08 12:07:21,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85607 to 61781. [2019-09-08 12:07:21,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61781 states. [2019-09-08 12:07:21,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61781 states to 61781 states and 87024 transitions. [2019-09-08 12:07:21,649 INFO L78 Accepts]: Start accepts. Automaton has 61781 states and 87024 transitions. Word has length 180 [2019-09-08 12:07:21,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:07:21,650 INFO L475 AbstractCegarLoop]: Abstraction has 61781 states and 87024 transitions. [2019-09-08 12:07:21,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:07:21,650 INFO L276 IsEmpty]: Start isEmpty. Operand 61781 states and 87024 transitions. [2019-09-08 12:07:21,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 12:07:21,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:07:21,707 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:07:21,707 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:07:21,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:07:21,707 INFO L82 PathProgramCache]: Analyzing trace with hash 2013801790, now seen corresponding path program 1 times [2019-09-08 12:07:21,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:07:21,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:07:21,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:21,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:07:21,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:07:22,011 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 12:07:22,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:07:22,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:07:22,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:07:22,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:07:22,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:07:22,013 INFO L87 Difference]: Start difference. First operand 61781 states and 87024 transitions. Second operand 7 states. [2019-09-08 12:07:27,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:07:27,055 INFO L93 Difference]: Finished difference Result 142659 states and 201355 transitions. [2019-09-08 12:07:27,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 12:07:27,055 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 182 [2019-09-08 12:07:27,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:07:27,138 INFO L225 Difference]: With dead ends: 142659 [2019-09-08 12:07:27,138 INFO L226 Difference]: Without dead ends: 81057 [2019-09-08 12:07:27,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:07:27,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81057 states. [2019-09-08 12:07:31,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81057 to 65901. [2019-09-08 12:07:31,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65901 states. [2019-09-08 12:07:31,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65901 states to 65901 states and 91496 transitions. [2019-09-08 12:07:31,974 INFO L78 Accepts]: Start accepts. Automaton has 65901 states and 91496 transitions. Word has length 182 [2019-09-08 12:07:31,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:07:31,975 INFO L475 AbstractCegarLoop]: Abstraction has 65901 states and 91496 transitions. [2019-09-08 12:07:31,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:07:31,975 INFO L276 IsEmpty]: Start isEmpty. Operand 65901 states and 91496 transitions. [2019-09-08 12:07:32,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 12:07:32,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:07:32,016 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:07:32,016 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:07:32,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:07:32,017 INFO L82 PathProgramCache]: Analyzing trace with hash 2051201949, now seen corresponding path program 1 times [2019-09-08 12:07:32,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:07:32,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:07:32,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:32,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:07:32,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:07:32,088 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 12:07:32,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:07:32,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:07:32,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:07:32,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:07:32,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:07:32,090 INFO L87 Difference]: Start difference. First operand 65901 states and 91496 transitions. Second operand 3 states. [2019-09-08 12:07:36,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:07:36,321 INFO L93 Difference]: Finished difference Result 131631 states and 182793 transitions. [2019-09-08 12:07:36,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:07:36,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-09-08 12:07:36,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:07:36,385 INFO L225 Difference]: With dead ends: 131631 [2019-09-08 12:07:36,385 INFO L226 Difference]: Without dead ends: 65893 [2019-09-08 12:07:36,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 12:07:36,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65893 states. [2019-09-08 12:07:41,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65893 to 65893. [2019-09-08 12:07:41,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65893 states. [2019-09-08 12:07:41,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65893 states to 65893 states and 91472 transitions. [2019-09-08 12:07:41,113 INFO L78 Accepts]: Start accepts. Automaton has 65893 states and 91472 transitions. Word has length 182 [2019-09-08 12:07:41,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:07:41,113 INFO L475 AbstractCegarLoop]: Abstraction has 65893 states and 91472 transitions. [2019-09-08 12:07:41,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:07:41,114 INFO L276 IsEmpty]: Start isEmpty. Operand 65893 states and 91472 transitions. [2019-09-08 12:07:41,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-08 12:07:41,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:07:41,152 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:07:41,153 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:07:41,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:07:41,153 INFO L82 PathProgramCache]: Analyzing trace with hash -186993458, now seen corresponding path program 1 times [2019-09-08 12:07:41,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:07:41,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:07:41,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:41,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:07:41,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:07:41,450 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 12:07:41,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:07:41,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:07:41,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:07:41,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:07:41,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:07:41,452 INFO L87 Difference]: Start difference. First operand 65893 states and 91472 transitions. Second operand 10 states. [2019-09-08 12:08:10,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:08:10,376 INFO L93 Difference]: Finished difference Result 398969 states and 552279 transitions. [2019-09-08 12:08:10,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:08:10,377 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 183 [2019-09-08 12:08:10,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:08:10,732 INFO L225 Difference]: With dead ends: 398969 [2019-09-08 12:08:10,733 INFO L226 Difference]: Without dead ends: 334623 [2019-09-08 12:08:10,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=266, Invalid=790, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 12:08:11,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334623 states. [2019-09-08 12:08:17,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334623 to 62573. [2019-09-08 12:08:17,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62573 states. [2019-09-08 12:08:17,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62573 states to 62573 states and 86724 transitions. [2019-09-08 12:08:17,775 INFO L78 Accepts]: Start accepts. Automaton has 62573 states and 86724 transitions. Word has length 183 [2019-09-08 12:08:17,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:08:17,776 INFO L475 AbstractCegarLoop]: Abstraction has 62573 states and 86724 transitions. [2019-09-08 12:08:17,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:08:17,776 INFO L276 IsEmpty]: Start isEmpty. Operand 62573 states and 86724 transitions. [2019-09-08 12:08:17,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-08 12:08:17,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:08:17,813 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:08:17,813 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:08:17,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:08:17,813 INFO L82 PathProgramCache]: Analyzing trace with hash -803841952, now seen corresponding path program 1 times [2019-09-08 12:08:17,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:08:17,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:08:17,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:17,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:08:17,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:08:18,477 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 12:08:18,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:08:18,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 12:08:18,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 12:08:18,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 12:08:18,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:08:18,478 INFO L87 Difference]: Start difference. First operand 62573 states and 86724 transitions. Second operand 14 states. [2019-09-08 12:09:11,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:11,798 INFO L93 Difference]: Finished difference Result 541922 states and 754205 transitions. [2019-09-08 12:09:11,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 12:09:11,798 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 183 [2019-09-08 12:09:11,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:12,399 INFO L225 Difference]: With dead ends: 541922 [2019-09-08 12:09:12,400 INFO L226 Difference]: Without dead ends: 481548 [2019-09-08 12:09:12,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=521, Invalid=1929, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 12:09:12,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481548 states. [2019-09-08 12:09:23,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481548 to 65172. [2019-09-08 12:09:23,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65172 states. [2019-09-08 12:09:23,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65172 states to 65172 states and 90083 transitions. [2019-09-08 12:09:23,743 INFO L78 Accepts]: Start accepts. Automaton has 65172 states and 90083 transitions. Word has length 183 [2019-09-08 12:09:23,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:23,744 INFO L475 AbstractCegarLoop]: Abstraction has 65172 states and 90083 transitions. [2019-09-08 12:09:23,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 12:09:23,744 INFO L276 IsEmpty]: Start isEmpty. Operand 65172 states and 90083 transitions. [2019-09-08 12:09:23,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-08 12:09:23,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:23,787 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:09:23,787 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:23,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:23,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1466595674, now seen corresponding path program 1 times [2019-09-08 12:09:23,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:23,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:23,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:23,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:23,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:23,875 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 12:09:23,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:23,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:09:23,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:09:23,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:09:23,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:09:23,876 INFO L87 Difference]: Start difference. First operand 65172 states and 90083 transitions. Second operand 3 states. [2019-09-08 12:09:28,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:28,027 INFO L93 Difference]: Finished difference Result 94724 states and 131157 transitions. [2019-09-08 12:09:28,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:09:28,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-09-08 12:09:28,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:28,063 INFO L225 Difference]: With dead ends: 94724 [2019-09-08 12:09:28,063 INFO L226 Difference]: Without dead ends: 35213 [2019-09-08 12:09:28,096 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 12:09:28,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35213 states. [2019-09-08 12:09:33,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35213 to 35211. [2019-09-08 12:09:33,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35211 states. [2019-09-08 12:09:33,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35211 states to 35211 states and 47952 transitions. [2019-09-08 12:09:33,737 INFO L78 Accepts]: Start accepts. Automaton has 35211 states and 47952 transitions. Word has length 183 [2019-09-08 12:09:33,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:33,737 INFO L475 AbstractCegarLoop]: Abstraction has 35211 states and 47952 transitions. [2019-09-08 12:09:33,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:09:33,737 INFO L276 IsEmpty]: Start isEmpty. Operand 35211 states and 47952 transitions. [2019-09-08 12:09:33,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 12:09:33,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:33,759 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:09:33,759 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:33,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:33,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1608261022, now seen corresponding path program 1 times [2019-09-08 12:09:33,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:33,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:33,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:33,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:33,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:33,847 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 12:09:33,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:33,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:09:33,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:09:33,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:09:33,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:09:33,849 INFO L87 Difference]: Start difference. First operand 35211 states and 47952 transitions. Second operand 4 states. [2019-09-08 12:09:40,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:40,920 INFO L93 Difference]: Finished difference Result 83071 states and 113784 transitions. [2019-09-08 12:09:40,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:09:40,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2019-09-08 12:09:40,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:40,982 INFO L225 Difference]: With dead ends: 83071 [2019-09-08 12:09:40,983 INFO L226 Difference]: Without dead ends: 61295 [2019-09-08 12:09:41,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:09:41,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61295 states. [2019-09-08 12:09:44,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61295 to 32357. [2019-09-08 12:09:44,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32357 states. [2019-09-08 12:09:45,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32357 states to 32357 states and 44162 transitions. [2019-09-08 12:09:45,008 INFO L78 Accepts]: Start accepts. Automaton has 32357 states and 44162 transitions. Word has length 184 [2019-09-08 12:09:45,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:45,008 INFO L475 AbstractCegarLoop]: Abstraction has 32357 states and 44162 transitions. [2019-09-08 12:09:45,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:09:45,008 INFO L276 IsEmpty]: Start isEmpty. Operand 32357 states and 44162 transitions. [2019-09-08 12:09:45,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 12:09:45,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:45,026 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:09:45,026 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:45,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:45,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1429563028, now seen corresponding path program 1 times [2019-09-08 12:09:45,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:45,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:45,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:45,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:45,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:45,330 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 12:09:45,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:45,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:09:45,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:09:45,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:09:45,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:09:45,333 INFO L87 Difference]: Start difference. First operand 32357 states and 44162 transitions. Second operand 10 states. [2019-09-08 12:10:09,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:09,434 INFO L93 Difference]: Finished difference Result 201562 states and 276515 transitions. [2019-09-08 12:10:09,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:10:09,434 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 184 [2019-09-08 12:10:09,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:09,584 INFO L225 Difference]: With dead ends: 201562 [2019-09-08 12:10:09,584 INFO L226 Difference]: Without dead ends: 171786 [2019-09-08 12:10:09,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 12:10:09,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171786 states. [2019-09-08 12:10:14,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171786 to 32466. [2019-09-08 12:10:14,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32466 states. [2019-09-08 12:10:14,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32466 states to 32466 states and 44284 transitions. [2019-09-08 12:10:14,637 INFO L78 Accepts]: Start accepts. Automaton has 32466 states and 44284 transitions. Word has length 184 [2019-09-08 12:10:14,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:14,637 INFO L475 AbstractCegarLoop]: Abstraction has 32466 states and 44284 transitions. [2019-09-08 12:10:14,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:10:14,637 INFO L276 IsEmpty]: Start isEmpty. Operand 32466 states and 44284 transitions. [2019-09-08 12:10:14,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 12:10:14,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:14,655 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:10:14,655 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:14,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:14,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1301309832, now seen corresponding path program 1 times [2019-09-08 12:10:14,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:14,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:14,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:14,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:14,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:16,423 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 12:10:16,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:16,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:10:16,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:10:16,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:10:16,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:10:16,424 INFO L87 Difference]: Start difference. First operand 32466 states and 44284 transitions. Second operand 12 states. [2019-09-08 12:10:35,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:35,243 INFO L93 Difference]: Finished difference Result 131746 states and 181550 transitions. [2019-09-08 12:10:35,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 12:10:35,243 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 184 [2019-09-08 12:10:35,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:35,350 INFO L225 Difference]: With dead ends: 131746 [2019-09-08 12:10:35,351 INFO L226 Difference]: Without dead ends: 111120 [2019-09-08 12:10:35,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=286, Invalid=770, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 12:10:35,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111120 states. [2019-09-08 12:10:40,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111120 to 31466. [2019-09-08 12:10:40,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31466 states. [2019-09-08 12:10:40,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31466 states to 31466 states and 42916 transitions. [2019-09-08 12:10:40,860 INFO L78 Accepts]: Start accepts. Automaton has 31466 states and 42916 transitions. Word has length 184 [2019-09-08 12:10:40,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:40,860 INFO L475 AbstractCegarLoop]: Abstraction has 31466 states and 42916 transitions. [2019-09-08 12:10:40,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:10:40,860 INFO L276 IsEmpty]: Start isEmpty. Operand 31466 states and 42916 transitions. [2019-09-08 12:10:40,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 12:10:40,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:40,877 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:10:40,877 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:40,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:40,878 INFO L82 PathProgramCache]: Analyzing trace with hash -206160051, now seen corresponding path program 1 times [2019-09-08 12:10:40,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:40,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:40,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:40,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:40,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:41,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:10:41,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:41,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:10:41,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:10:41,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:10:41,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:10:41,150 INFO L87 Difference]: Start difference. First operand 31466 states and 42916 transitions. Second operand 10 states. [2019-09-08 12:11:07,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:07,780 INFO L93 Difference]: Finished difference Result 172684 states and 237194 transitions. [2019-09-08 12:11:07,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 12:11:07,780 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 184 [2019-09-08 12:11:07,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:07,926 INFO L225 Difference]: With dead ends: 172684 [2019-09-08 12:11:07,926 INFO L226 Difference]: Without dead ends: 152594 [2019-09-08 12:11:07,961 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:11:08,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152594 states. [2019-09-08 12:11:16,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152594 to 41618. [2019-09-08 12:11:16,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41618 states. [2019-09-08 12:11:16,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41618 states to 41618 states and 56070 transitions. [2019-09-08 12:11:16,298 INFO L78 Accepts]: Start accepts. Automaton has 41618 states and 56070 transitions. Word has length 184 [2019-09-08 12:11:16,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:16,299 INFO L475 AbstractCegarLoop]: Abstraction has 41618 states and 56070 transitions. [2019-09-08 12:11:16,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:11:16,299 INFO L276 IsEmpty]: Start isEmpty. Operand 41618 states and 56070 transitions. [2019-09-08 12:11:16,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 12:11:16,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11:16,326 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:11:16,326 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:16,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:16,326 INFO L82 PathProgramCache]: Analyzing trace with hash 333790234, now seen corresponding path program 1 times [2019-09-08 12:11:16,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:16,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:16,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:16,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:16,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:16,416 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 12:11:16,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:16,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:11:16,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:11:16,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:11:16,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:11:16,418 INFO L87 Difference]: Start difference. First operand 41618 states and 56070 transitions. Second operand 4 states. [2019-09-08 12:11:28,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:28,066 INFO L93 Difference]: Finished difference Result 81326 states and 110670 transitions. [2019-09-08 12:11:28,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:11:28,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-09-08 12:11:28,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:28,125 INFO L225 Difference]: With dead ends: 81326 [2019-09-08 12:11:28,125 INFO L226 Difference]: Without dead ends: 65412 [2019-09-08 12:11:28,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:11:28,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65412 states. [2019-09-08 12:11:35,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65412 to 41618. [2019-09-08 12:11:35,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41618 states. [2019-09-08 12:11:35,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41618 states to 41618 states and 56070 transitions. [2019-09-08 12:11:35,473 INFO L78 Accepts]: Start accepts. Automaton has 41618 states and 56070 transitions. Word has length 185 [2019-09-08 12:11:35,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:35,474 INFO L475 AbstractCegarLoop]: Abstraction has 41618 states and 56070 transitions. [2019-09-08 12:11:35,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:11:35,474 INFO L276 IsEmpty]: Start isEmpty. Operand 41618 states and 56070 transitions. [2019-09-08 12:11:35,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 12:11:35,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11:35,501 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:11:35,501 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:35,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:35,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1113239361, now seen corresponding path program 1 times [2019-09-08 12:11:35,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:35,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:35,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:35,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:35,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:35,958 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 12:11:35,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:35,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:11:35,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:11:35,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:11:35,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:11:35,960 INFO L87 Difference]: Start difference. First operand 41618 states and 56070 transitions. Second operand 10 states. [2019-09-08 12:12:16,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:16,634 INFO L93 Difference]: Finished difference Result 242418 states and 327798 transitions. [2019-09-08 12:12:16,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 12:12:16,635 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 185 [2019-09-08 12:12:16,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:16,843 INFO L225 Difference]: With dead ends: 242418 [2019-09-08 12:12:16,843 INFO L226 Difference]: Without dead ends: 205262 [2019-09-08 12:12:16,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:12:17,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205262 states. [2019-09-08 12:12:26,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205262 to 41864. [2019-09-08 12:12:26,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41864 states. [2019-09-08 12:12:26,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41864 states to 41864 states and 56352 transitions. [2019-09-08 12:12:26,349 INFO L78 Accepts]: Start accepts. Automaton has 41864 states and 56352 transitions. Word has length 185 [2019-09-08 12:12:26,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:26,350 INFO L475 AbstractCegarLoop]: Abstraction has 41864 states and 56352 transitions. [2019-09-08 12:12:26,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:12:26,350 INFO L276 IsEmpty]: Start isEmpty. Operand 41864 states and 56352 transitions. [2019-09-08 12:12:26,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 12:12:26,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:26,376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:12:26,376 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:26,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:26,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1421876632, now seen corresponding path program 1 times [2019-09-08 12:12:26,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:26,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:26,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:26,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:26,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:26,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:26,679 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 12:12:26,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:26,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:12:26,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:12:26,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:12:26,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:12:26,682 INFO L87 Difference]: Start difference. First operand 41864 states and 56352 transitions. Second operand 10 states. [2019-09-08 12:13:10,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:13:10,885 INFO L93 Difference]: Finished difference Result 236204 states and 318142 transitions. [2019-09-08 12:13:10,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:13:10,885 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 185 [2019-09-08 12:13:10,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:13:11,103 INFO L225 Difference]: With dead ends: 236204 [2019-09-08 12:13:11,103 INFO L226 Difference]: Without dead ends: 207986 [2019-09-08 12:13:11,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=206, Invalid=606, Unknown=0, NotChecked=0, Total=812 [2019-09-08 12:13:11,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207986 states. [2019-09-08 12:13:21,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207986 to 42626. [2019-09-08 12:13:21,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42626 states. [2019-09-08 12:13:21,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42626 states to 42626 states and 57296 transitions. [2019-09-08 12:13:21,643 INFO L78 Accepts]: Start accepts. Automaton has 42626 states and 57296 transitions. Word has length 185 [2019-09-08 12:13:21,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:13:21,643 INFO L475 AbstractCegarLoop]: Abstraction has 42626 states and 57296 transitions. [2019-09-08 12:13:21,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:13:21,643 INFO L276 IsEmpty]: Start isEmpty. Operand 42626 states and 57296 transitions. [2019-09-08 12:13:21,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-08 12:13:21,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:13:21,670 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:21,670 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:13:21,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:13:21,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1890555556, now seen corresponding path program 1 times [2019-09-08 12:13:21,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:13:21,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:13:21,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:21,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:21,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:21,722 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 12:13:21,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:13:21,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:13:21,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:13:21,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:13:21,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:13:21,724 INFO L87 Difference]: Start difference. First operand 42626 states and 57296 transitions. Second operand 3 states. [2019-09-08 12:13:30,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:13:30,203 INFO L93 Difference]: Finished difference Result 82528 states and 111265 transitions. [2019-09-08 12:13:30,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:13:30,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-09-08 12:13:30,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:13:30,237 INFO L225 Difference]: With dead ends: 82528 [2019-09-08 12:13:30,237 INFO L226 Difference]: Without dead ends: 40410 [2019-09-08 12:13:30,257 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 12:13:30,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40410 states. [2019-09-08 12:13:39,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40410 to 40410. [2019-09-08 12:13:39,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40410 states. [2019-09-08 12:13:39,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40410 states to 40410 states and 54014 transitions. [2019-09-08 12:13:39,780 INFO L78 Accepts]: Start accepts. Automaton has 40410 states and 54014 transitions. Word has length 186 [2019-09-08 12:13:39,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:13:39,780 INFO L475 AbstractCegarLoop]: Abstraction has 40410 states and 54014 transitions. [2019-09-08 12:13:39,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:13:39,780 INFO L276 IsEmpty]: Start isEmpty. Operand 40410 states and 54014 transitions. [2019-09-08 12:13:39,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-08 12:13:39,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:13:39,806 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:39,806 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:13:39,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:13:39,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1924059500, now seen corresponding path program 1 times [2019-09-08 12:13:39,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:13:39,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:13:39,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:39,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:39,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:39,858 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 12:13:39,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:13:39,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:13:39,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:13:39,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:13:39,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:13:39,860 INFO L87 Difference]: Start difference. First operand 40410 states and 54014 transitions. Second operand 3 states. [2019-09-08 12:13:47,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:13:47,599 INFO L93 Difference]: Finished difference Result 79212 states and 106087 transitions. [2019-09-08 12:13:47,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:13:47,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-09-08 12:13:47,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:13:47,634 INFO L225 Difference]: With dead ends: 79212 [2019-09-08 12:13:47,634 INFO L226 Difference]: Without dead ends: 39354 [2019-09-08 12:13:47,657 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 12:13:47,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39354 states. [2019-09-08 12:13:55,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39354 to 39354. [2019-09-08 12:13:55,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39354 states. [2019-09-08 12:13:55,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39354 states to 39354 states and 52274 transitions. [2019-09-08 12:13:55,188 INFO L78 Accepts]: Start accepts. Automaton has 39354 states and 52274 transitions. Word has length 186 [2019-09-08 12:13:55,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:13:55,188 INFO L475 AbstractCegarLoop]: Abstraction has 39354 states and 52274 transitions. [2019-09-08 12:13:55,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:13:55,189 INFO L276 IsEmpty]: Start isEmpty. Operand 39354 states and 52274 transitions. [2019-09-08 12:13:55,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-08 12:13:55,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:13:55,215 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:55,215 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:13:55,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:13:55,216 INFO L82 PathProgramCache]: Analyzing trace with hash -2108182768, now seen corresponding path program 1 times [2019-09-08 12:13:55,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:13:55,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:13:55,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:55,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:55,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:55,461 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 12:13:55,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:13:55,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:13:55,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:13:55,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:13:55,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:13:55,464 INFO L87 Difference]: Start difference. First operand 39354 states and 52274 transitions. Second operand 10 states. [2019-09-08 12:14:49,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:49,145 INFO L93 Difference]: Finished difference Result 264043 states and 353969 transitions. [2019-09-08 12:14:49,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 12:14:49,146 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 186 [2019-09-08 12:14:49,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:49,384 INFO L225 Difference]: With dead ends: 264043 [2019-09-08 12:14:49,385 INFO L226 Difference]: Without dead ends: 226327 [2019-09-08 12:14:49,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=326, Invalid=1080, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 12:14:49,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226327 states. [2019-09-08 12:14:59,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226327 to 37335. [2019-09-08 12:14:59,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37335 states. [2019-09-08 12:14:59,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37335 states to 37335 states and 49646 transitions. [2019-09-08 12:14:59,338 INFO L78 Accepts]: Start accepts. Automaton has 37335 states and 49646 transitions. Word has length 186 [2019-09-08 12:14:59,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:59,339 INFO L475 AbstractCegarLoop]: Abstraction has 37335 states and 49646 transitions. [2019-09-08 12:14:59,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:14:59,339 INFO L276 IsEmpty]: Start isEmpty. Operand 37335 states and 49646 transitions. [2019-09-08 12:14:59,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-08 12:14:59,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:59,363 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:14:59,364 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:59,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:59,364 INFO L82 PathProgramCache]: Analyzing trace with hash 687128316, now seen corresponding path program 1 times [2019-09-08 12:14:59,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:59,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:59,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:59,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:59,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:59,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:59,746 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 12:14:59,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:59,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:14:59,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:14:59,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:14:59,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:14:59,748 INFO L87 Difference]: Start difference. First operand 37335 states and 49646 transitions. Second operand 3 states. [2019-09-08 12:15:04,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:04,334 INFO L93 Difference]: Finished difference Result 51519 states and 68936 transitions. [2019-09-08 12:15:04,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:15:04,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-09-08 12:15:04,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:04,351 INFO L225 Difference]: With dead ends: 51519 [2019-09-08 12:15:04,352 INFO L226 Difference]: Without dead ends: 19364 [2019-09-08 12:15:04,368 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 12:15:04,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19364 states. [2019-09-08 12:15:08,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19364 to 19362. [2019-09-08 12:15:08,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19362 states. [2019-09-08 12:15:08,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19362 states to 19362 states and 25365 transitions. [2019-09-08 12:15:08,679 INFO L78 Accepts]: Start accepts. Automaton has 19362 states and 25365 transitions. Word has length 186 [2019-09-08 12:15:08,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:08,679 INFO L475 AbstractCegarLoop]: Abstraction has 19362 states and 25365 transitions. [2019-09-08 12:15:08,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:15:08,679 INFO L276 IsEmpty]: Start isEmpty. Operand 19362 states and 25365 transitions. [2019-09-08 12:15:08,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-08 12:15:08,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:08,691 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:15:08,691 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:08,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:08,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1797936065, now seen corresponding path program 1 times [2019-09-08 12:15:08,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:08,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:08,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:08,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:08,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:09,206 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 12:15:09,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:09,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:15:09,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:15:09,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:15:09,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:15:09,207 INFO L87 Difference]: Start difference. First operand 19362 states and 25365 transitions. Second operand 12 states. [2019-09-08 12:15:24,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:24,311 INFO L93 Difference]: Finished difference Result 62177 states and 82638 transitions. [2019-09-08 12:15:24,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:15:24,311 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 187 [2019-09-08 12:15:24,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:24,360 INFO L225 Difference]: With dead ends: 62177 [2019-09-08 12:15:24,360 INFO L226 Difference]: Without dead ends: 53623 [2019-09-08 12:15:24,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:15:24,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53623 states. [2019-09-08 12:15:30,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53623 to 27257. [2019-09-08 12:15:30,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27257 states. [2019-09-08 12:15:30,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27257 states to 27257 states and 35306 transitions. [2019-09-08 12:15:30,841 INFO L78 Accepts]: Start accepts. Automaton has 27257 states and 35306 transitions. Word has length 187 [2019-09-08 12:15:30,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:30,841 INFO L475 AbstractCegarLoop]: Abstraction has 27257 states and 35306 transitions. [2019-09-08 12:15:30,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:15:30,841 INFO L276 IsEmpty]: Start isEmpty. Operand 27257 states and 35306 transitions. [2019-09-08 12:15:30,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-08 12:15:30,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:30,857 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:15:30,857 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:30,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:30,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1617981026, now seen corresponding path program 1 times [2019-09-08 12:15:30,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:30,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:30,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:30,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:30,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:31,159 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 12:15:31,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:31,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:15:31,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:15:31,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:15:31,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:15:31,160 INFO L87 Difference]: Start difference. First operand 27257 states and 35306 transitions. Second operand 12 states. [2019-09-08 12:15:46,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:46,011 INFO L93 Difference]: Finished difference Result 58843 states and 78495 transitions. [2019-09-08 12:15:46,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:15:46,011 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 187 [2019-09-08 12:15:46,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:46,056 INFO L225 Difference]: With dead ends: 58843 [2019-09-08 12:15:46,056 INFO L226 Difference]: Without dead ends: 48657 [2019-09-08 12:15:46,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:15:46,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48657 states. [2019-09-08 12:15:54,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48657 to 20182. [2019-09-08 12:15:54,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20182 states. [2019-09-08 12:15:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20182 states to 20182 states and 26451 transitions. [2019-09-08 12:15:54,104 INFO L78 Accepts]: Start accepts. Automaton has 20182 states and 26451 transitions. Word has length 187 [2019-09-08 12:15:54,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:54,104 INFO L475 AbstractCegarLoop]: Abstraction has 20182 states and 26451 transitions. [2019-09-08 12:15:54,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:15:54,104 INFO L276 IsEmpty]: Start isEmpty. Operand 20182 states and 26451 transitions. [2019-09-08 12:15:54,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-08 12:15:54,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:54,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:15:54,117 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:54,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:54,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1274732102, now seen corresponding path program 1 times [2019-09-08 12:15:54,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:54,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:54,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:54,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:54,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:54,190 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 12:15:54,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:54,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:15:54,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:15:54,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:15:54,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:15:54,192 INFO L87 Difference]: Start difference. First operand 20182 states and 26451 transitions. Second operand 4 states. [2019-09-08 12:15:59,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:59,493 INFO L93 Difference]: Finished difference Result 31360 states and 41415 transitions. [2019-09-08 12:15:59,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:15:59,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2019-09-08 12:15:59,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:59,508 INFO L225 Difference]: With dead ends: 31360 [2019-09-08 12:15:59,509 INFO L226 Difference]: Without dead ends: 18054 [2019-09-08 12:15:59,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:15:59,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18054 states. [2019-09-08 12:16:03,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18054 to 14672. [2019-09-08 12:16:03,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14672 states. [2019-09-08 12:16:03,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14672 states to 14672 states and 19323 transitions. [2019-09-08 12:16:03,617 INFO L78 Accepts]: Start accepts. Automaton has 14672 states and 19323 transitions. Word has length 188 [2019-09-08 12:16:03,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:03,618 INFO L475 AbstractCegarLoop]: Abstraction has 14672 states and 19323 transitions. [2019-09-08 12:16:03,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:16:03,618 INFO L276 IsEmpty]: Start isEmpty. Operand 14672 states and 19323 transitions. [2019-09-08 12:16:03,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-08 12:16:03,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:03,624 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:16:03,625 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:03,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:03,625 INFO L82 PathProgramCache]: Analyzing trace with hash 2128134123, now seen corresponding path program 1 times [2019-09-08 12:16:03,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:03,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:03,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:03,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:03,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:03,928 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 12:16:03,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:03,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:16:03,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:16:03,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:16:03,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:16:03,930 INFO L87 Difference]: Start difference. First operand 14672 states and 19323 transitions. Second operand 12 states. [2019-09-08 12:16:20,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:20,990 INFO L93 Difference]: Finished difference Result 56446 states and 75616 transitions. [2019-09-08 12:16:20,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:16:20,990 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 188 [2019-09-08 12:16:20,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:21,030 INFO L225 Difference]: With dead ends: 56446 [2019-09-08 12:16:21,030 INFO L226 Difference]: Without dead ends: 46122 [2019-09-08 12:16:21,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=275, Invalid=717, Unknown=0, NotChecked=0, Total=992 [2019-09-08 12:16:21,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46122 states. [2019-09-08 12:16:25,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46122 to 13500. [2019-09-08 12:16:25,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13500 states. [2019-09-08 12:16:25,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13500 states to 13500 states and 17645 transitions. [2019-09-08 12:16:25,311 INFO L78 Accepts]: Start accepts. Automaton has 13500 states and 17645 transitions. Word has length 188 [2019-09-08 12:16:25,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:25,312 INFO L475 AbstractCegarLoop]: Abstraction has 13500 states and 17645 transitions. [2019-09-08 12:16:25,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:16:25,312 INFO L276 IsEmpty]: Start isEmpty. Operand 13500 states and 17645 transitions. [2019-09-08 12:16:25,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-08 12:16:25,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:25,318 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:16:25,318 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:25,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:25,318 INFO L82 PathProgramCache]: Analyzing trace with hash -641922616, now seen corresponding path program 1 times [2019-09-08 12:16:25,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:25,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:25,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:25,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:25,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:25,581 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 12:16:25,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:25,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:16:25,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:16:25,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:16:25,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:16:25,583 INFO L87 Difference]: Start difference. First operand 13500 states and 17645 transitions. Second operand 10 states. [2019-09-08 12:16:36,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:36,548 INFO L93 Difference]: Finished difference Result 38104 states and 50870 transitions. [2019-09-08 12:16:36,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:16:36,549 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 188 [2019-09-08 12:16:36,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:36,574 INFO L225 Difference]: With dead ends: 38104 [2019-09-08 12:16:36,575 INFO L226 Difference]: Without dead ends: 30120 [2019-09-08 12:16:36,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:16:36,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30120 states. [2019-09-08 12:16:40,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30120 to 11269. [2019-09-08 12:16:40,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11269 states. [2019-09-08 12:16:40,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11269 states to 11269 states and 14865 transitions. [2019-09-08 12:16:40,280 INFO L78 Accepts]: Start accepts. Automaton has 11269 states and 14865 transitions. Word has length 188 [2019-09-08 12:16:40,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:40,281 INFO L475 AbstractCegarLoop]: Abstraction has 11269 states and 14865 transitions. [2019-09-08 12:16:40,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:16:40,281 INFO L276 IsEmpty]: Start isEmpty. Operand 11269 states and 14865 transitions. [2019-09-08 12:16:40,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 12:16:40,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:40,286 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:16:40,286 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:40,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:40,286 INFO L82 PathProgramCache]: Analyzing trace with hash -310390411, now seen corresponding path program 1 times [2019-09-08 12:16:40,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:40,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:40,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:40,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:40,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:40,360 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 12:16:40,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:40,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:16:40,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:16:40,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:16:40,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:16:40,362 INFO L87 Difference]: Start difference. First operand 11269 states and 14865 transitions. Second operand 4 states. [2019-09-08 12:16:44,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:44,511 INFO L93 Difference]: Finished difference Result 19684 states and 26060 transitions. [2019-09-08 12:16:44,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:16:44,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-09-08 12:16:44,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:44,522 INFO L225 Difference]: With dead ends: 19684 [2019-09-08 12:16:44,522 INFO L226 Difference]: Without dead ends: 11934 [2019-09-08 12:16:44,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:16:44,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11934 states. [2019-09-08 12:16:48,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11934 to 11035. [2019-09-08 12:16:48,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11035 states. [2019-09-08 12:16:48,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11035 states to 11035 states and 14553 transitions. [2019-09-08 12:16:48,217 INFO L78 Accepts]: Start accepts. Automaton has 11035 states and 14553 transitions. Word has length 189 [2019-09-08 12:16:48,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:48,218 INFO L475 AbstractCegarLoop]: Abstraction has 11035 states and 14553 transitions. [2019-09-08 12:16:48,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:16:48,218 INFO L276 IsEmpty]: Start isEmpty. Operand 11035 states and 14553 transitions. [2019-09-08 12:16:48,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 12:16:48,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:48,221 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:16:48,221 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:48,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:48,222 INFO L82 PathProgramCache]: Analyzing trace with hash 963477594, now seen corresponding path program 1 times [2019-09-08 12:16:48,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:48,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:48,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:48,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:48,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:48,619 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 12:16:48,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:48,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:16:48,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:16:48,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:16:48,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:16:48,621 INFO L87 Difference]: Start difference. First operand 11035 states and 14553 transitions. Second operand 10 states. [2019-09-08 12:17:06,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:06,461 INFO L93 Difference]: Finished difference Result 50430 states and 67599 transitions. [2019-09-08 12:17:06,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:17:06,461 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 189 [2019-09-08 12:17:06,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:06,498 INFO L225 Difference]: With dead ends: 50430 [2019-09-08 12:17:06,498 INFO L226 Difference]: Without dead ends: 42199 [2019-09-08 12:17:06,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:17:06,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42199 states. [2019-09-08 12:17:10,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42199 to 10492. [2019-09-08 12:17:10,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10492 states. [2019-09-08 12:17:10,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10492 states to 10492 states and 13939 transitions. [2019-09-08 12:17:10,437 INFO L78 Accepts]: Start accepts. Automaton has 10492 states and 13939 transitions. Word has length 189 [2019-09-08 12:17:10,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:10,437 INFO L475 AbstractCegarLoop]: Abstraction has 10492 states and 13939 transitions. [2019-09-08 12:17:10,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:17:10,437 INFO L276 IsEmpty]: Start isEmpty. Operand 10492 states and 13939 transitions. [2019-09-08 12:17:10,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-08 12:17:10,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:10,440 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:17:10,440 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:10,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:10,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1907125491, now seen corresponding path program 1 times [2019-09-08 12:17:10,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:10,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:10,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:10,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:10,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:10,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 12:17:10,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:10,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:17:10,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:17:10,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:17:10,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:17:10,512 INFO L87 Difference]: Start difference. First operand 10492 states and 13939 transitions. Second operand 4 states. [2019-09-08 12:17:17,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:17,547 INFO L93 Difference]: Finished difference Result 26750 states and 35847 transitions. [2019-09-08 12:17:17,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:17:17,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-09-08 12:17:17,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:17,564 INFO L225 Difference]: With dead ends: 26750 [2019-09-08 12:17:17,565 INFO L226 Difference]: Without dead ends: 19000 [2019-09-08 12:17:17,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:17:17,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19000 states. [2019-09-08 12:17:21,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19000 to 10011. [2019-09-08 12:17:21,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10011 states. [2019-09-08 12:17:21,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10011 states to 10011 states and 13289 transitions. [2019-09-08 12:17:21,446 INFO L78 Accepts]: Start accepts. Automaton has 10011 states and 13289 transitions. Word has length 190 [2019-09-08 12:17:21,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:21,447 INFO L475 AbstractCegarLoop]: Abstraction has 10011 states and 13289 transitions. [2019-09-08 12:17:21,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:17:21,447 INFO L276 IsEmpty]: Start isEmpty. Operand 10011 states and 13289 transitions. [2019-09-08 12:17:21,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-08 12:17:21,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:21,449 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:17:21,449 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:21,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:21,450 INFO L82 PathProgramCache]: Analyzing trace with hash -579740302, now seen corresponding path program 1 times [2019-09-08 12:17:21,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:21,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:21,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:21,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:21,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:21,733 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 12:17:21,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:21,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:17:21,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:17:21,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:17:21,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:17:21,735 INFO L87 Difference]: Start difference. First operand 10011 states and 13289 transitions. Second operand 10 states. [2019-09-08 12:17:47,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:47,577 INFO L93 Difference]: Finished difference Result 66706 states and 89261 transitions. [2019-09-08 12:17:47,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:17:47,578 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 190 [2019-09-08 12:17:47,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:47,637 INFO L225 Difference]: With dead ends: 66706 [2019-09-08 12:17:47,638 INFO L226 Difference]: Without dead ends: 58761 [2019-09-08 12:17:47,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 12:17:47,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58761 states. [2019-09-08 12:17:52,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58761 to 11652. [2019-09-08 12:17:52,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11652 states. [2019-09-08 12:17:52,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11652 states to 11652 states and 15338 transitions. [2019-09-08 12:17:52,434 INFO L78 Accepts]: Start accepts. Automaton has 11652 states and 15338 transitions. Word has length 190 [2019-09-08 12:17:52,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:52,435 INFO L475 AbstractCegarLoop]: Abstraction has 11652 states and 15338 transitions. [2019-09-08 12:17:52,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:17:52,435 INFO L276 IsEmpty]: Start isEmpty. Operand 11652 states and 15338 transitions. [2019-09-08 12:17:52,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-08 12:17:52,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:52,438 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:17:52,439 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:52,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:52,439 INFO L82 PathProgramCache]: Analyzing trace with hash -2013895406, now seen corresponding path program 1 times [2019-09-08 12:17:52,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:52,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:52,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:52,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:52,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:52,544 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 12:17:52,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:52,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:17:52,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:17:52,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:17:52,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:17:52,546 INFO L87 Difference]: Start difference. First operand 11652 states and 15338 transitions. Second operand 4 states. [2019-09-08 12:17:57,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:57,471 INFO L93 Difference]: Finished difference Result 22741 states and 29956 transitions. [2019-09-08 12:17:57,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:17:57,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-09-08 12:17:57,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:57,486 INFO L225 Difference]: With dead ends: 22741 [2019-09-08 12:17:57,487 INFO L226 Difference]: Without dead ends: 11639 [2019-09-08 12:17:57,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:17:57,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11639 states. [2019-09-08 12:18:01,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11639 to 11639. [2019-09-08 12:18:01,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11639 states. [2019-09-08 12:18:01,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11639 states to 11639 states and 15288 transitions. [2019-09-08 12:18:01,964 INFO L78 Accepts]: Start accepts. Automaton has 11639 states and 15288 transitions. Word has length 190 [2019-09-08 12:18:01,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:01,964 INFO L475 AbstractCegarLoop]: Abstraction has 11639 states and 15288 transitions. [2019-09-08 12:18:01,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:18:01,964 INFO L276 IsEmpty]: Start isEmpty. Operand 11639 states and 15288 transitions. [2019-09-08 12:18:01,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-08 12:18:01,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:01,968 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:01,968 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:01,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:01,968 INFO L82 PathProgramCache]: Analyzing trace with hash -2097126577, now seen corresponding path program 1 times [2019-09-08 12:18:01,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:01,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:01,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:01,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:01,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:02,016 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 12:18:02,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:02,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:18:02,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:18:02,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:18:02,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:18:02,017 INFO L87 Difference]: Start difference. First operand 11639 states and 15288 transitions. Second operand 3 states. [2019-09-08 12:18:08,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:08,656 INFO L93 Difference]: Finished difference Result 26196 states and 34027 transitions. [2019-09-08 12:18:08,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:18:08,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-09-08 12:18:08,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:08,671 INFO L225 Difference]: With dead ends: 26196 [2019-09-08 12:18:08,671 INFO L226 Difference]: Without dead ends: 15918 [2019-09-08 12:18:08,678 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 12:18:08,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15918 states. [2019-09-08 12:18:15,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15918 to 15172. [2019-09-08 12:18:15,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15172 states. [2019-09-08 12:18:15,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15172 states to 15172 states and 18986 transitions. [2019-09-08 12:18:15,016 INFO L78 Accepts]: Start accepts. Automaton has 15172 states and 18986 transitions. Word has length 192 [2019-09-08 12:18:15,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:15,017 INFO L475 AbstractCegarLoop]: Abstraction has 15172 states and 18986 transitions. [2019-09-08 12:18:15,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:18:15,017 INFO L276 IsEmpty]: Start isEmpty. Operand 15172 states and 18986 transitions. [2019-09-08 12:18:15,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-08 12:18:15,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:15,021 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:15,021 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:15,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:15,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1274241064, now seen corresponding path program 1 times [2019-09-08 12:18:15,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:15,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:15,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:15,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:15,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:15,092 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 12:18:15,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:15,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:18:15,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:18:15,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:18:15,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:18:15,094 INFO L87 Difference]: Start difference. First operand 15172 states and 18986 transitions. Second operand 3 states. [2019-09-08 12:18:22,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:22,149 INFO L93 Difference]: Finished difference Result 18315 states and 23110 transitions. [2019-09-08 12:18:22,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:18:22,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-09-08 12:18:22,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:22,163 INFO L225 Difference]: With dead ends: 18315 [2019-09-08 12:18:22,163 INFO L226 Difference]: Without dead ends: 16472 [2019-09-08 12:18:22,167 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 12:18:22,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16472 states. [2019-09-08 12:18:28,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16472 to 15757. [2019-09-08 12:18:28,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15757 states. [2019-09-08 12:18:28,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15757 states to 15757 states and 19730 transitions. [2019-09-08 12:18:28,851 INFO L78 Accepts]: Start accepts. Automaton has 15757 states and 19730 transitions. Word has length 193 [2019-09-08 12:18:28,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:28,851 INFO L475 AbstractCegarLoop]: Abstraction has 15757 states and 19730 transitions. [2019-09-08 12:18:28,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:18:28,851 INFO L276 IsEmpty]: Start isEmpty. Operand 15757 states and 19730 transitions. [2019-09-08 12:18:28,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-08 12:18:28,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:28,855 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:28,855 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:28,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:28,856 INFO L82 PathProgramCache]: Analyzing trace with hash -972264404, now seen corresponding path program 1 times [2019-09-08 12:18:28,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:28,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:28,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:28,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:28,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:28,997 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 12:18:28,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:28,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:18:28,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:18:28,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:18:28,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:18:28,998 INFO L87 Difference]: Start difference. First operand 15757 states and 19730 transitions. Second operand 4 states. [2019-09-08 12:18:35,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:35,195 INFO L93 Difference]: Finished difference Result 28501 states and 35925 transitions. [2019-09-08 12:18:35,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:18:35,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 196 [2019-09-08 12:18:35,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:35,208 INFO L225 Difference]: With dead ends: 28501 [2019-09-08 12:18:35,208 INFO L226 Difference]: Without dead ends: 14281 [2019-09-08 12:18:35,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:18:35,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14281 states. [2019-09-08 12:18:41,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14281 to 14281. [2019-09-08 12:18:41,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14281 states. [2019-09-08 12:18:41,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14281 states to 14281 states and 17895 transitions. [2019-09-08 12:18:41,328 INFO L78 Accepts]: Start accepts. Automaton has 14281 states and 17895 transitions. Word has length 196 [2019-09-08 12:18:41,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:41,328 INFO L475 AbstractCegarLoop]: Abstraction has 14281 states and 17895 transitions. [2019-09-08 12:18:41,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:18:41,328 INFO L276 IsEmpty]: Start isEmpty. Operand 14281 states and 17895 transitions. [2019-09-08 12:18:41,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-08 12:18:41,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:41,332 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:41,332 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:41,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:41,333 INFO L82 PathProgramCache]: Analyzing trace with hash 282804136, now seen corresponding path program 1 times [2019-09-08 12:18:41,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:41,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:41,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:41,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:41,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:41,460 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 12:18:41,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:41,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 12:18:41,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 12:18:41,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 12:18:41,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:18:41,461 INFO L87 Difference]: Start difference. First operand 14281 states and 17895 transitions. Second operand 6 states. [2019-09-08 12:18:49,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:49,150 INFO L93 Difference]: Finished difference Result 21261 states and 26847 transitions. [2019-09-08 12:18:49,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:18:49,150 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 196 [2019-09-08 12:18:49,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:49,165 INFO L225 Difference]: With dead ends: 21261 [2019-09-08 12:18:49,165 INFO L226 Difference]: Without dead ends: 17265 [2019-09-08 12:18:49,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:18:49,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17265 states. [2019-09-08 12:18:56,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17265 to 14281. [2019-09-08 12:18:56,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14281 states. [2019-09-08 12:18:56,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14281 states to 14281 states and 17895 transitions. [2019-09-08 12:18:56,043 INFO L78 Accepts]: Start accepts. Automaton has 14281 states and 17895 transitions. Word has length 196 [2019-09-08 12:18:56,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:56,043 INFO L475 AbstractCegarLoop]: Abstraction has 14281 states and 17895 transitions. [2019-09-08 12:18:56,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 12:18:56,043 INFO L276 IsEmpty]: Start isEmpty. Operand 14281 states and 17895 transitions. [2019-09-08 12:18:56,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-08 12:18:56,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:56,047 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:56,047 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:56,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:56,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1640400656, now seen corresponding path program 1 times [2019-09-08 12:18:56,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:56,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:56,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:56,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:56,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:56,162 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 12:18:56,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:56,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 12:18:56,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 12:18:56,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 12:18:56,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:18:56,164 INFO L87 Difference]: Start difference. First operand 14281 states and 17895 transitions. Second operand 6 states. [2019-09-08 12:19:05,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:05,397 INFO L93 Difference]: Finished difference Result 23810 states and 30135 transitions. [2019-09-08 12:19:05,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:19:05,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 196 [2019-09-08 12:19:05,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:05,413 INFO L225 Difference]: With dead ends: 23810 [2019-09-08 12:19:05,413 INFO L226 Difference]: Without dead ends: 18086 [2019-09-08 12:19:05,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:19:05,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18086 states. [2019-09-08 12:19:13,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18086 to 15473. [2019-09-08 12:19:13,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15473 states. [2019-09-08 12:19:13,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15473 states to 15473 states and 19430 transitions. [2019-09-08 12:19:13,826 INFO L78 Accepts]: Start accepts. Automaton has 15473 states and 19430 transitions. Word has length 196 [2019-09-08 12:19:13,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:13,827 INFO L475 AbstractCegarLoop]: Abstraction has 15473 states and 19430 transitions. [2019-09-08 12:19:13,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 12:19:13,827 INFO L276 IsEmpty]: Start isEmpty. Operand 15473 states and 19430 transitions. [2019-09-08 12:19:13,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-08 12:19:13,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:13,830 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:19:13,830 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:13,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:13,831 INFO L82 PathProgramCache]: Analyzing trace with hash 2093055856, now seen corresponding path program 1 times [2019-09-08 12:19:13,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:13,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:13,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:13,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:13,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:14,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:14,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:14,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:19:14,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:19:14,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:19:14,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:19:14,014 INFO L87 Difference]: Start difference. First operand 15473 states and 19430 transitions. Second operand 10 states.