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_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:29:26,231 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:29:26,233 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:29:26,245 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:29:26,245 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:29:26,246 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:29:26,248 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:29:26,249 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:29:26,251 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:29:26,252 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:29:26,253 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:29:26,254 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:29:26,254 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:29:26,255 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:29:26,256 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:29:26,257 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:29:26,258 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:29:26,259 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:29:26,260 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:29:26,262 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:29:26,264 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:29:26,265 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:29:26,266 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:29:26,267 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:29:26,269 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:29:26,269 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:29:26,269 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:29:26,270 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:29:26,271 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:29:26,272 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:29:26,272 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:29:26,273 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:29:26,273 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:29:26,274 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:29:26,275 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:29:26,275 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:29:26,276 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:29:26,276 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:29:26,276 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:29:26,277 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:29:26,278 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:29:26,279 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 13:29:26,302 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:29:26,303 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:29:26,304 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:29:26,304 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:29:26,305 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:29:26,305 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:29:26,305 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:29:26,305 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:29:26,305 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:29:26,306 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:29:26,306 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:29:26,306 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:29:26,307 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:29:26,307 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:29:26,308 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:29:26,308 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:29:26,308 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:29:26,308 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:29:26,308 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:29:26,309 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:29:26,309 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:29:26,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:29:26,309 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:29:26,310 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:29:26,310 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:29:26,310 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:29:26,310 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:29:26,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:29:26,311 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:29:26,354 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:29:26,365 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:29:26,368 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:29:26,370 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:29:26,370 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:29:26,371 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 13:29:26,444 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ca9825e5/2dd90fc81c9c4f19a54debd186e7d414/FLAG5d5f42457 [2019-09-08 13:29:27,081 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:29:27,082 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 13:29:27,100 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ca9825e5/2dd90fc81c9c4f19a54debd186e7d414/FLAG5d5f42457 [2019-09-08 13:29:27,326 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ca9825e5/2dd90fc81c9c4f19a54debd186e7d414 [2019-09-08 13:29:27,337 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:29:27,339 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:29:27,340 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:29:27,340 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:29:27,345 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:29:27,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:29:27" (1/1) ... [2019-09-08 13:29:27,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8d75d99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:27, skipping insertion in model container [2019-09-08 13:29:27,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:29:27" (1/1) ... [2019-09-08 13:29:27,355 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:29:27,427 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:29:27,931 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:29:27,949 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:29:28,237 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:29:28,280 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:29:28,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:28 WrapperNode [2019-09-08 13:29:28,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:29:28,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:29:28,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:29:28,282 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:29:28,305 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:28" (1/1) ... [2019-09-08 13:29:28,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:28" (1/1) ... [2019-09-08 13:29:28,343 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:28" (1/1) ... [2019-09-08 13:29:28,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:28" (1/1) ... [2019-09-08 13:29:28,389 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:28" (1/1) ... [2019-09-08 13:29:28,413 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:28" (1/1) ... [2019-09-08 13:29:28,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:28" (1/1) ... [2019-09-08 13:29:28,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:29:28,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:29:28,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:29:28,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:29:28,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:28" (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 13:29:28,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:29:28,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:29:28,506 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:29:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:29:28,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:29:28,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 13:29:28,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:29:28,508 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:29:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:29:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:29:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:29:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:29:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:29:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:29:28,511 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:29:28,511 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:29:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:29:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:29:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:29:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:29:29,931 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:29:29,932 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:29:29,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:29:29 BoogieIcfgContainer [2019-09-08 13:29:29,933 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:29:29,935 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:29:29,936 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:29:29,940 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:29:29,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:29:27" (1/3) ... [2019-09-08 13:29:29,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42841a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:29:29, skipping insertion in model container [2019-09-08 13:29:29,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:28" (2/3) ... [2019-09-08 13:29:29,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42841a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:29:29, skipping insertion in model container [2019-09-08 13:29:29,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:29:29" (3/3) ... [2019-09-08 13:29:29,947 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 13:29:29,958 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:29:29,985 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:29:30,002 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:29:30,052 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:29:30,053 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:29:30,053 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:29:30,053 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:29:30,053 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:29:30,054 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:29:30,054 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:29:30,054 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:29:30,054 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:29:30,092 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states. [2019-09-08 13:29:30,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 13:29:30,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:30,128 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] [2019-09-08 13:29:30,130 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:30,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:30,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1819873083, now seen corresponding path program 1 times [2019-09-08 13:29:30,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:30,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:30,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:30,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:30,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:30,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:30,740 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 13:29:30,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:30,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:30,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:30,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:30,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:30,768 INFO L87 Difference]: Start difference. First operand 356 states. Second operand 3 states. [2019-09-08 13:29:30,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:30,990 INFO L93 Difference]: Finished difference Result 662 states and 1137 transitions. [2019-09-08 13:29:30,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:29:30,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-08 13:29:30,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:31,012 INFO L225 Difference]: With dead ends: 662 [2019-09-08 13:29:31,013 INFO L226 Difference]: Without dead ends: 495 [2019-09-08 13:29:31,018 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 13:29:31,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-09-08 13:29:31,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 492. [2019-09-08 13:29:31,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-09-08 13:29:31,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 809 transitions. [2019-09-08 13:29:31,150 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 809 transitions. Word has length 122 [2019-09-08 13:29:31,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:31,151 INFO L475 AbstractCegarLoop]: Abstraction has 492 states and 809 transitions. [2019-09-08 13:29:31,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:29:31,152 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 809 transitions. [2019-09-08 13:29:31,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 13:29:31,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:31,155 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] [2019-09-08 13:29:31,156 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:31,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:31,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1319699854, now seen corresponding path program 1 times [2019-09-08 13:29:31,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:31,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:31,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:31,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:31,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:31,382 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 13:29:31,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:31,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:31,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:31,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:31,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:31,388 INFO L87 Difference]: Start difference. First operand 492 states and 809 transitions. Second operand 3 states. [2019-09-08 13:29:31,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:31,496 INFO L93 Difference]: Finished difference Result 1062 states and 1757 transitions. [2019-09-08 13:29:31,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:29:31,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-09-08 13:29:31,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:31,505 INFO L225 Difference]: With dead ends: 1062 [2019-09-08 13:29:31,505 INFO L226 Difference]: Without dead ends: 767 [2019-09-08 13:29:31,511 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 13:29:31,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2019-09-08 13:29:31,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 763. [2019-09-08 13:29:31,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2019-09-08 13:29:31,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1258 transitions. [2019-09-08 13:29:31,575 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1258 transitions. Word has length 125 [2019-09-08 13:29:31,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:31,575 INFO L475 AbstractCegarLoop]: Abstraction has 763 states and 1258 transitions. [2019-09-08 13:29:31,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:29:31,576 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1258 transitions. [2019-09-08 13:29:31,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 13:29:31,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:31,583 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] [2019-09-08 13:29:31,583 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:31,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:31,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1711238682, now seen corresponding path program 1 times [2019-09-08 13:29:31,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:31,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:31,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:31,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:31,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:31,807 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 13:29:31,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:31,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:31,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:31,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:31,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:31,812 INFO L87 Difference]: Start difference. First operand 763 states and 1258 transitions. Second operand 3 states. [2019-09-08 13:29:31,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:31,893 INFO L93 Difference]: Finished difference Result 1855 states and 3068 transitions. [2019-09-08 13:29:31,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:29:31,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-08 13:29:31,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:31,905 INFO L225 Difference]: With dead ends: 1855 [2019-09-08 13:29:31,906 INFO L226 Difference]: Without dead ends: 1289 [2019-09-08 13:29:31,915 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 13:29:31,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2019-09-08 13:29:31,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1283. [2019-09-08 13:29:31,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-09-08 13:29:31,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 2114 transitions. [2019-09-08 13:29:31,997 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 2114 transitions. Word has length 128 [2019-09-08 13:29:31,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:31,998 INFO L475 AbstractCegarLoop]: Abstraction has 1283 states and 2114 transitions. [2019-09-08 13:29:31,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:29:31,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 2114 transitions. [2019-09-08 13:29:32,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 13:29:32,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:32,001 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:29:32,001 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:32,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:32,002 INFO L82 PathProgramCache]: Analyzing trace with hash 820062537, now seen corresponding path program 1 times [2019-09-08 13:29:32,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:32,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:32,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:32,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:32,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:32,138 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 13:29:32,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:32,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:32,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:32,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:32,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:32,140 INFO L87 Difference]: Start difference. First operand 1283 states and 2114 transitions. Second operand 3 states. [2019-09-08 13:29:32,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:32,264 INFO L93 Difference]: Finished difference Result 3375 states and 5564 transitions. [2019-09-08 13:29:32,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:29:32,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-09-08 13:29:32,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:32,279 INFO L225 Difference]: With dead ends: 3375 [2019-09-08 13:29:32,280 INFO L226 Difference]: Without dead ends: 2289 [2019-09-08 13:29:32,283 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 13:29:32,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2289 states. [2019-09-08 13:29:32,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2289 to 2279. [2019-09-08 13:29:32,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2279 states. [2019-09-08 13:29:32,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 3734 transitions. [2019-09-08 13:29:32,397 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 3734 transitions. Word has length 131 [2019-09-08 13:29:32,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:32,397 INFO L475 AbstractCegarLoop]: Abstraction has 2279 states and 3734 transitions. [2019-09-08 13:29:32,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:29:32,398 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 3734 transitions. [2019-09-08 13:29:32,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 13:29:32,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:32,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] [2019-09-08 13:29:32,401 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:32,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:32,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1594765883, now seen corresponding path program 1 times [2019-09-08 13:29:32,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:32,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:32,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:32,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:32,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:32,667 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 13:29:32,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:32,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:29:32,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:29:32,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:29:32,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:29:32,670 INFO L87 Difference]: Start difference. First operand 2279 states and 3734 transitions. Second operand 6 states. [2019-09-08 13:29:33,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:33,458 INFO L93 Difference]: Finished difference Result 8697 states and 14339 transitions. [2019-09-08 13:29:33,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:29:33,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-09-08 13:29:33,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:33,495 INFO L225 Difference]: With dead ends: 8697 [2019-09-08 13:29:33,495 INFO L226 Difference]: Without dead ends: 6615 [2019-09-08 13:29:33,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:29:33,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6615 states. [2019-09-08 13:29:33,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6615 to 5202. [2019-09-08 13:29:33,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5202 states. [2019-09-08 13:29:33,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5202 states to 5202 states and 8546 transitions. [2019-09-08 13:29:33,867 INFO L78 Accepts]: Start accepts. Automaton has 5202 states and 8546 transitions. Word has length 134 [2019-09-08 13:29:33,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:33,868 INFO L475 AbstractCegarLoop]: Abstraction has 5202 states and 8546 transitions. [2019-09-08 13:29:33,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:29:33,868 INFO L276 IsEmpty]: Start isEmpty. Operand 5202 states and 8546 transitions. [2019-09-08 13:29:33,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 13:29:33,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:33,872 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] [2019-09-08 13:29:33,873 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:33,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:33,873 INFO L82 PathProgramCache]: Analyzing trace with hash 2126933855, now seen corresponding path program 1 times [2019-09-08 13:29:33,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:33,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:33,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:33,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:33,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:33,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:34,155 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 13:29:34,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:34,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:29:34,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:29:34,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:29:34,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:29:34,158 INFO L87 Difference]: Start difference. First operand 5202 states and 8546 transitions. Second operand 4 states. [2019-09-08 13:29:34,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:34,876 INFO L93 Difference]: Finished difference Result 13804 states and 22775 transitions. [2019-09-08 13:29:34,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:29:34,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-09-08 13:29:34,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:34,928 INFO L225 Difference]: With dead ends: 13804 [2019-09-08 13:29:34,929 INFO L226 Difference]: Without dead ends: 8799 [2019-09-08 13:29:34,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:29:34,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8799 states. [2019-09-08 13:29:35,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8799 to 7685. [2019-09-08 13:29:35,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7685 states. [2019-09-08 13:29:35,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7685 states to 7685 states and 12648 transitions. [2019-09-08 13:29:35,497 INFO L78 Accepts]: Start accepts. Automaton has 7685 states and 12648 transitions. Word has length 135 [2019-09-08 13:29:35,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:35,498 INFO L475 AbstractCegarLoop]: Abstraction has 7685 states and 12648 transitions. [2019-09-08 13:29:35,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:29:35,498 INFO L276 IsEmpty]: Start isEmpty. Operand 7685 states and 12648 transitions. [2019-09-08 13:29:35,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:29:35,503 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:35,504 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] [2019-09-08 13:29:35,504 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:35,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:35,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1448829826, now seen corresponding path program 1 times [2019-09-08 13:29:35,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:35,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:35,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:35,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:35,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:35,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 13:29:35,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:35,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:29:35,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:29:35,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:29:35,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:29:35,681 INFO L87 Difference]: Start difference. First operand 7685 states and 12648 transitions. Second operand 4 states. [2019-09-08 13:29:36,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:36,408 INFO L93 Difference]: Finished difference Result 20452 states and 33726 transitions. [2019-09-08 13:29:36,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:29:36,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-09-08 13:29:36,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:36,457 INFO L225 Difference]: With dead ends: 20452 [2019-09-08 13:29:36,457 INFO L226 Difference]: Without dead ends: 12964 [2019-09-08 13:29:36,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:29:36,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12964 states. [2019-09-08 13:29:37,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12964 to 11286. [2019-09-08 13:29:37,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11286 states. [2019-09-08 13:29:37,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11286 states to 11286 states and 18559 transitions. [2019-09-08 13:29:37,167 INFO L78 Accepts]: Start accepts. Automaton has 11286 states and 18559 transitions. Word has length 136 [2019-09-08 13:29:37,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:37,168 INFO L475 AbstractCegarLoop]: Abstraction has 11286 states and 18559 transitions. [2019-09-08 13:29:37,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:29:37,168 INFO L276 IsEmpty]: Start isEmpty. Operand 11286 states and 18559 transitions. [2019-09-08 13:29:37,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 13:29:37,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:37,174 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] [2019-09-08 13:29:37,174 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:37,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:37,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1906999430, now seen corresponding path program 1 times [2019-09-08 13:29:37,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:37,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:37,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:37,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:37,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:37,334 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 13:29:37,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:37,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 13:29:37,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 13:29:37,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 13:29:37,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:29:37,336 INFO L87 Difference]: Start difference. First operand 11286 states and 18559 transitions. Second operand 7 states. [2019-09-08 13:29:40,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:40,048 INFO L93 Difference]: Finished difference Result 52740 states and 86789 transitions. [2019-09-08 13:29:40,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 13:29:40,049 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 137 [2019-09-08 13:29:40,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:40,182 INFO L225 Difference]: With dead ends: 52740 [2019-09-08 13:29:40,182 INFO L226 Difference]: Without dead ends: 41651 [2019-09-08 13:29:40,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-08 13:29:40,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41651 states. [2019-09-08 13:29:41,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41651 to 32467. [2019-09-08 13:29:41,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32467 states. [2019-09-08 13:29:42,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32467 states to 32467 states and 53209 transitions. [2019-09-08 13:29:42,038 INFO L78 Accepts]: Start accepts. Automaton has 32467 states and 53209 transitions. Word has length 137 [2019-09-08 13:29:42,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:42,038 INFO L475 AbstractCegarLoop]: Abstraction has 32467 states and 53209 transitions. [2019-09-08 13:29:42,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 13:29:42,038 INFO L276 IsEmpty]: Start isEmpty. Operand 32467 states and 53209 transitions. [2019-09-08 13:29:42,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 13:29:42,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:42,046 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] [2019-09-08 13:29:42,047 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:42,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:42,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1629889350, now seen corresponding path program 1 times [2019-09-08 13:29:42,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:42,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:42,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:42,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:42,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:42,146 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 13:29:42,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:42,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:42,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:42,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:42,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:42,148 INFO L87 Difference]: Start difference. First operand 32467 states and 53209 transitions. Second operand 3 states. [2019-09-08 13:29:44,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:44,285 INFO L93 Difference]: Finished difference Result 71332 states and 117301 transitions. [2019-09-08 13:29:44,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:29:44,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-08 13:29:44,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:44,405 INFO L225 Difference]: With dead ends: 71332 [2019-09-08 13:29:44,405 INFO L226 Difference]: Without dead ends: 48696 [2019-09-08 13:29:44,462 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 13:29:44,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48696 states. [2019-09-08 13:29:46,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48696 to 48694. [2019-09-08 13:29:46,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48694 states. [2019-09-08 13:29:46,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48694 states to 48694 states and 79748 transitions. [2019-09-08 13:29:46,856 INFO L78 Accepts]: Start accepts. Automaton has 48694 states and 79748 transitions. Word has length 138 [2019-09-08 13:29:46,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:46,856 INFO L475 AbstractCegarLoop]: Abstraction has 48694 states and 79748 transitions. [2019-09-08 13:29:46,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:29:46,856 INFO L276 IsEmpty]: Start isEmpty. Operand 48694 states and 79748 transitions. [2019-09-08 13:29:46,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 13:29:46,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:46,860 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] [2019-09-08 13:29:46,860 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:46,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:46,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1317118186, now seen corresponding path program 1 times [2019-09-08 13:29:46,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:46,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:46,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:46,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:46,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:46,949 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 13:29:46,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:46,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:46,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:46,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:46,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:46,951 INFO L87 Difference]: Start difference. First operand 48694 states and 79748 transitions. Second operand 3 states. [2019-09-08 13:29:50,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:50,657 INFO L93 Difference]: Finished difference Result 106927 states and 175312 transitions. [2019-09-08 13:29:50,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:29:50,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-08 13:29:50,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:50,807 INFO L225 Difference]: With dead ends: 106927 [2019-09-08 13:29:50,808 INFO L226 Difference]: Without dead ends: 72964 [2019-09-08 13:29:50,875 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 13:29:50,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72964 states. [2019-09-08 13:29:53,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72964 to 72962. [2019-09-08 13:29:53,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72962 states. [2019-09-08 13:29:53,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72962 states to 72962 states and 119155 transitions. [2019-09-08 13:29:53,803 INFO L78 Accepts]: Start accepts. Automaton has 72962 states and 119155 transitions. Word has length 138 [2019-09-08 13:29:53,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:53,804 INFO L475 AbstractCegarLoop]: Abstraction has 72962 states and 119155 transitions. [2019-09-08 13:29:53,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:29:53,804 INFO L276 IsEmpty]: Start isEmpty. Operand 72962 states and 119155 transitions. [2019-09-08 13:29:53,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 13:29:53,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:53,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] [2019-09-08 13:29:53,807 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:53,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:53,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1065054007, now seen corresponding path program 1 times [2019-09-08 13:29:53,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:53,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:53,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:53,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:53,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:53,910 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 13:29:53,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:53,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:29:53,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:29:53,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:29:53,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:29:53,912 INFO L87 Difference]: Start difference. First operand 72962 states and 119155 transitions. Second operand 4 states. [2019-09-08 13:29:59,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:59,309 INFO L93 Difference]: Finished difference Result 195257 states and 319653 transitions. [2019-09-08 13:29:59,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:29:59,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-08 13:29:59,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:59,505 INFO L225 Difference]: With dead ends: 195257 [2019-09-08 13:29:59,505 INFO L226 Difference]: Without dead ends: 126794 [2019-09-08 13:29:59,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 13:29:59,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126794 states. [2019-09-08 13:30:06,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126794 to 99644. [2019-09-08 13:30:06,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99644 states. [2019-09-08 13:30:06,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99644 states to 99644 states and 162703 transitions. [2019-09-08 13:30:06,164 INFO L78 Accepts]: Start accepts. Automaton has 99644 states and 162703 transitions. Word has length 138 [2019-09-08 13:30:06,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:30:06,165 INFO L475 AbstractCegarLoop]: Abstraction has 99644 states and 162703 transitions. [2019-09-08 13:30:06,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:30:06,165 INFO L276 IsEmpty]: Start isEmpty. Operand 99644 states and 162703 transitions. [2019-09-08 13:30:06,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 13:30:06,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:30:06,169 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] [2019-09-08 13:30:06,169 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:30:06,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:30:06,169 INFO L82 PathProgramCache]: Analyzing trace with hash 192784978, now seen corresponding path program 1 times [2019-09-08 13:30:06,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:30:06,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:30:06,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:06,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:30:06,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:30:06,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:30:06,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:30:06,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:30:06,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:30:06,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:30:06,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:30:06,272 INFO L87 Difference]: Start difference. First operand 99644 states and 162703 transitions. Second operand 3 states. [2019-09-08 13:30:13,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:30:13,781 INFO L93 Difference]: Finished difference Result 217808 states and 355395 transitions. [2019-09-08 13:30:13,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:30:13,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-08 13:30:13,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:30:13,988 INFO L225 Difference]: With dead ends: 217808 [2019-09-08 13:30:13,988 INFO L226 Difference]: Without dead ends: 149226 [2019-09-08 13:30:14,054 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 13:30:14,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149226 states. [2019-09-08 13:30:19,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149226 to 149224. [2019-09-08 13:30:19,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149224 states. [2019-09-08 13:30:19,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149224 states to 149224 states and 242456 transitions. [2019-09-08 13:30:19,884 INFO L78 Accepts]: Start accepts. Automaton has 149224 states and 242456 transitions. Word has length 138 [2019-09-08 13:30:19,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:30:19,885 INFO L475 AbstractCegarLoop]: Abstraction has 149224 states and 242456 transitions. [2019-09-08 13:30:19,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:30:19,885 INFO L276 IsEmpty]: Start isEmpty. Operand 149224 states and 242456 transitions. [2019-09-08 13:30:19,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 13:30:19,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:30:19,887 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] [2019-09-08 13:30:19,887 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:30:19,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:30:19,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1141935655, now seen corresponding path program 1 times [2019-09-08 13:30:19,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:30:19,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:30:19,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:19,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:30:19,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:30:19,990 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 13:30:19,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:30:19,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:30:19,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:30:19,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:30:19,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:30:19,992 INFO L87 Difference]: Start difference. First operand 149224 states and 242456 transitions. Second operand 3 states. [2019-09-08 13:30:29,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:30:29,870 INFO L93 Difference]: Finished difference Result 329840 states and 536210 transitions. [2019-09-08 13:30:29,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:30:29,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-09-08 13:30:29,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:30:30,225 INFO L225 Difference]: With dead ends: 329840 [2019-09-08 13:30:30,226 INFO L226 Difference]: Without dead ends: 218383 [2019-09-08 13:30:30,318 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 13:30:30,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218383 states. [2019-09-08 13:30:43,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218383 to 218381. [2019-09-08 13:30:43,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218381 states. [2019-09-08 13:30:44,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218381 states to 218381 states and 352760 transitions. [2019-09-08 13:30:44,151 INFO L78 Accepts]: Start accepts. Automaton has 218381 states and 352760 transitions. Word has length 139 [2019-09-08 13:30:44,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:30:44,151 INFO L475 AbstractCegarLoop]: Abstraction has 218381 states and 352760 transitions. [2019-09-08 13:30:44,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:30:44,151 INFO L276 IsEmpty]: Start isEmpty. Operand 218381 states and 352760 transitions. [2019-09-08 13:30:44,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 13:30:44,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:30:44,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] [2019-09-08 13:30:44,153 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:30:44,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:30:44,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1490654585, now seen corresponding path program 1 times [2019-09-08 13:30:44,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:30:44,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:30:44,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:44,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:30:44,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:44,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:30:44,468 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 13:30:44,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:30:44,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:30:44,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:30:44,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:30:44,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:30:44,469 INFO L87 Difference]: Start difference. First operand 218381 states and 352760 transitions. Second operand 6 states. [2019-09-08 13:31:02,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:02,246 INFO L93 Difference]: Finished difference Result 533372 states and 862446 transitions. [2019-09-08 13:31:02,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:31:02,247 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-09-08 13:31:02,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:02,878 INFO L225 Difference]: With dead ends: 533372 [2019-09-08 13:31:02,878 INFO L226 Difference]: Without dead ends: 315256 [2019-09-08 13:31:03,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:31:03,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315256 states. [2019-09-08 13:31:24,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315256 to 249116. [2019-09-08 13:31:24,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249116 states. [2019-09-08 13:31:25,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249116 states to 249116 states and 401720 transitions. [2019-09-08 13:31:25,124 INFO L78 Accepts]: Start accepts. Automaton has 249116 states and 401720 transitions. Word has length 140 [2019-09-08 13:31:25,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:31:25,125 INFO L475 AbstractCegarLoop]: Abstraction has 249116 states and 401720 transitions. [2019-09-08 13:31:25,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:31:25,125 INFO L276 IsEmpty]: Start isEmpty. Operand 249116 states and 401720 transitions. [2019-09-08 13:31:25,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 13:31:25,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:25,126 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] [2019-09-08 13:31:25,126 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:25,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:25,126 INFO L82 PathProgramCache]: Analyzing trace with hash 374584311, now seen corresponding path program 1 times [2019-09-08 13:31:25,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:25,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:25,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:25,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:25,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:25,355 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 13:31:25,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:31:25,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:31:25,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:31:25,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:31:25,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:31:25,357 INFO L87 Difference]: Start difference. First operand 249116 states and 401720 transitions. Second operand 6 states. [2019-09-08 13:31:54,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:54,475 INFO L93 Difference]: Finished difference Result 732822 states and 1184410 transitions. [2019-09-08 13:31:54,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:31:54,476 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-08 13:31:54,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:55,417 INFO L225 Difference]: With dead ends: 732822 [2019-09-08 13:31:55,417 INFO L226 Difference]: Without dead ends: 483971 [2019-09-08 13:31:55,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:31:56,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483971 states. [2019-09-08 13:32:32,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483971 to 443345. [2019-09-08 13:32:32,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443345 states. [2019-09-08 13:32:33,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443345 states to 443345 states and 714601 transitions. [2019-09-08 13:32:33,600 INFO L78 Accepts]: Start accepts. Automaton has 443345 states and 714601 transitions. Word has length 143 [2019-09-08 13:32:33,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:32:33,600 INFO L475 AbstractCegarLoop]: Abstraction has 443345 states and 714601 transitions. [2019-09-08 13:32:33,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:32:33,600 INFO L276 IsEmpty]: Start isEmpty. Operand 443345 states and 714601 transitions. [2019-09-08 13:32:33,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 13:32:33,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:32:33,602 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] [2019-09-08 13:32:33,602 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:32:33,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:32:33,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1274697322, now seen corresponding path program 1 times [2019-09-08 13:32:33,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:32:33,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:32:33,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:33,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:32:33,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:32:33,758 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 13:32:33,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:32:33,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:32:33,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:32:33,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:32:33,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:32:33,759 INFO L87 Difference]: Start difference. First operand 443345 states and 714601 transitions. Second operand 5 states. [2019-09-08 13:33:23,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:33:23,964 INFO L93 Difference]: Finished difference Result 742229 states and 1192264 transitions. [2019-09-08 13:33:23,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:33:23,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-08 13:33:23,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:33:25,268 INFO L225 Difference]: With dead ends: 742229 [2019-09-08 13:33:25,268 INFO L226 Difference]: Without dead ends: 742227 [2019-09-08 13:33:25,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:33:25,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742227 states. [2019-09-08 13:34:07,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742227 to 449257. [2019-09-08 13:34:07,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449257 states. [2019-09-08 13:34:07,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449257 states to 449257 states and 720468 transitions. [2019-09-08 13:34:07,968 INFO L78 Accepts]: Start accepts. Automaton has 449257 states and 720468 transitions. Word has length 144 [2019-09-08 13:34:07,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:34:07,968 INFO L475 AbstractCegarLoop]: Abstraction has 449257 states and 720468 transitions. [2019-09-08 13:34:07,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:34:07,969 INFO L276 IsEmpty]: Start isEmpty. Operand 449257 states and 720468 transitions. [2019-09-08 13:34:07,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 13:34:07,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:34:07,973 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:34:07,974 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:34:07,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:34:07,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1097787199, now seen corresponding path program 1 times [2019-09-08 13:34:07,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:34:07,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:34:07,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:34:07,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:34:07,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:34:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:34:08,191 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 13:34:08,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:34:08,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:34:08,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:34:08,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:34:08,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:34:08,193 INFO L87 Difference]: Start difference. First operand 449257 states and 720468 transitions. Second operand 6 states. [2019-09-08 13:34:53,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:34:53,704 INFO L93 Difference]: Finished difference Result 741989 states and 1195501 transitions. [2019-09-08 13:34:53,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:34:53,705 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2019-09-08 13:34:53,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:34:54,746 INFO L225 Difference]: With dead ends: 741989 [2019-09-08 13:34:54,747 INFO L226 Difference]: Without dead ends: 615855 [2019-09-08 13:34:54,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:34:55,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615855 states. [2019-09-08 13:35:38,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615855 to 513853. [2019-09-08 13:35:38,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513853 states. [2019-09-08 13:35:47,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513853 states to 513853 states and 824544 transitions. [2019-09-08 13:35:47,863 INFO L78 Accepts]: Start accepts. Automaton has 513853 states and 824544 transitions. Word has length 180 [2019-09-08 13:35:47,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:35:47,863 INFO L475 AbstractCegarLoop]: Abstraction has 513853 states and 824544 transitions. [2019-09-08 13:35:47,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:35:47,864 INFO L276 IsEmpty]: Start isEmpty. Operand 513853 states and 824544 transitions. [2019-09-08 13:35:47,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 13:35:47,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:35:47,871 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:35:47,872 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:35:47,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:35:47,872 INFO L82 PathProgramCache]: Analyzing trace with hash 785016035, now seen corresponding path program 1 times [2019-09-08 13:35:47,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:35:47,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:35:47,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:35:47,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:35:47,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:35:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:35:48,094 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 13:35:48,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:35:48,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:35:48,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:35:48,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:35:48,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:35:48,097 INFO L87 Difference]: Start difference. First operand 513853 states and 824544 transitions. Second operand 6 states. [2019-09-08 13:36:40,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:36:40,471 INFO L93 Difference]: Finished difference Result 797915 states and 1285057 transitions. [2019-09-08 13:36:40,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:36:40,471 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2019-09-08 13:36:40,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:36:41,765 INFO L225 Difference]: With dead ends: 797915 [2019-09-08 13:36:41,765 INFO L226 Difference]: Without dead ends: 672261 [2019-09-08 13:36:41,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:36:42,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672261 states. [2019-09-08 13:37:33,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672261 to 570043. [2019-09-08 13:37:33,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570043 states. [2019-09-08 13:37:34,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570043 states to 570043 states and 914988 transitions. [2019-09-08 13:37:34,852 INFO L78 Accepts]: Start accepts. Automaton has 570043 states and 914988 transitions. Word has length 180 [2019-09-08 13:37:34,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:34,852 INFO L475 AbstractCegarLoop]: Abstraction has 570043 states and 914988 transitions. [2019-09-08 13:37:34,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:37:34,853 INFO L276 IsEmpty]: Start isEmpty. Operand 570043 states and 914988 transitions. [2019-09-08 13:37:34,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 13:37:34,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:34,860 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:37:34,860 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:34,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:34,860 INFO L82 PathProgramCache]: Analyzing trace with hash -339317173, now seen corresponding path program 1 times [2019-09-08 13:37:34,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:34,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:34,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:34,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:34,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:35,036 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 13:37:35,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:35,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:37:35,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:37:35,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:37:35,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:37:35,039 INFO L87 Difference]: Start difference. First operand 570043 states and 914988 transitions. Second operand 6 states. [2019-09-08 13:38:27,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:38:27,319 INFO L93 Difference]: Finished difference Result 889634 states and 1431630 transitions. [2019-09-08 13:38:27,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:38:27,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2019-09-08 13:38:27,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:38:28,605 INFO L225 Difference]: With dead ends: 889634 [2019-09-08 13:38:28,606 INFO L226 Difference]: Without dead ends: 662436 [2019-09-08 13:38:28,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:38:29,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662436 states. [2019-09-08 13:39:31,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662436 to 622718. [2019-09-08 13:39:31,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622718 states. [2019-09-08 13:39:32,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622718 states to 622718 states and 999511 transitions. [2019-09-08 13:39:32,810 INFO L78 Accepts]: Start accepts. Automaton has 622718 states and 999511 transitions. Word has length 180 [2019-09-08 13:39:32,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:32,810 INFO L475 AbstractCegarLoop]: Abstraction has 622718 states and 999511 transitions. [2019-09-08 13:39:32,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:39:32,810 INFO L276 IsEmpty]: Start isEmpty. Operand 622718 states and 999511 transitions. [2019-09-08 13:39:32,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 13:39:32,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:32,816 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:32,816 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:32,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:32,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1593145434, now seen corresponding path program 1 times [2019-09-08 13:39:32,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:32,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:32,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:32,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:32,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:32,923 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 13:39:32,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:32,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:39:32,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:39:32,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:39:32,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:39:32,925 INFO L87 Difference]: Start difference. First operand 622718 states and 999511 transitions. Second operand 3 states.