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_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 14:48:21,410 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 14:48:21,413 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 14:48:21,425 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 14:48:21,426 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 14:48:21,427 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 14:48:21,428 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 14:48:21,430 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 14:48:21,432 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 14:48:21,433 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 14:48:21,434 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 14:48:21,435 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 14:48:21,435 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 14:48:21,436 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 14:48:21,437 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 14:48:21,438 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 14:48:21,439 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 14:48:21,443 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 14:48:21,446 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 14:48:21,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 14:48:21,453 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 14:48:21,456 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 14:48:21,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 14:48:21,460 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 14:48:21,464 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 14:48:21,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 14:48:21,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 14:48:21,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 14:48:21,467 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 14:48:21,468 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 14:48:21,469 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 14:48:21,470 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 14:48:21,471 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 14:48:21,471 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 14:48:21,474 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 14:48:21,474 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 14:48:21,475 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 14:48:21,476 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 14:48:21,476 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 14:48:21,478 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 14:48:21,481 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 14:48:21,483 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-10-02 14:48:21,506 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 14:48:21,506 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 14:48:21,508 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 14:48:21,508 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 14:48:21,508 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 14:48:21,509 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 14:48:21,509 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 14:48:21,509 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 14:48:21,509 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 14:48:21,509 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 14:48:21,510 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 14:48:21,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 14:48:21,510 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 14:48:21,510 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 14:48:21,511 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 14:48:21,511 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 14:48:21,511 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 14:48:21,511 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 14:48:21,511 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 14:48:21,512 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 14:48:21,512 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 14:48:21,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:48:21,512 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 14:48:21,513 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 14:48:21,513 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 14:48:21,513 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 14:48:21,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 14:48:21,514 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 14:48:21,514 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 14:48:21,543 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 14:48:21,561 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 14:48:21,565 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 14:48:21,566 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 14:48:21,567 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 14:48:21,569 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-02 14:48:21,642 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92162b26e/973a183f8fc3415c8d21c898516d1e59/FLAG512e42b3b [2019-10-02 14:48:22,148 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 14:48:22,149 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-02 14:48:22,176 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92162b26e/973a183f8fc3415c8d21c898516d1e59/FLAG512e42b3b [2019-10-02 14:48:22,436 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92162b26e/973a183f8fc3415c8d21c898516d1e59 [2019-10-02 14:48:22,447 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 14:48:22,449 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 14:48:22,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 14:48:22,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 14:48:22,454 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 14:48:22,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:48:22" (1/1) ... [2019-10-02 14:48:22,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3335b144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:48:22, skipping insertion in model container [2019-10-02 14:48:22,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:48:22" (1/1) ... [2019-10-02 14:48:22,464 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 14:48:22,541 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 14:48:23,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:48:23,122 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 14:48:23,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:48:23,309 INFO L192 MainTranslator]: Completed translation [2019-10-02 14:48:23,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:48:23 WrapperNode [2019-10-02 14:48:23,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 14:48:23,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 14:48:23,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 14:48:23,311 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 14:48:23,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:48:23" (1/1) ... [2019-10-02 14:48:23,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:48:23" (1/1) ... [2019-10-02 14:48:23,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:48:23" (1/1) ... [2019-10-02 14:48:23,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:48:23" (1/1) ... [2019-10-02 14:48:23,367 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:48:23" (1/1) ... [2019-10-02 14:48:23,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:48:23" (1/1) ... [2019-10-02 14:48:23,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:48:23" (1/1) ... [2019-10-02 14:48:23,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 14:48:23,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 14:48:23,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 14:48:23,403 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 14:48:23,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:48:23" (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-10-02 14:48:23,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 14:48:23,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 14:48:23,490 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 14:48:23,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 14:48:23,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-02 14:48:23,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-02 14:48:23,492 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-02 14:48:23,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 14:48:23,492 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-02 14:48:23,493 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-02 14:48:23,493 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-02 14:48:23,493 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-02 14:48:23,494 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-02 14:48:23,494 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-02 14:48:23,495 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-02 14:48:23,495 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 14:48:23,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 14:48:23,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 14:48:25,002 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 14:48:25,003 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-02 14:48:25,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:48:25 BoogieIcfgContainer [2019-10-02 14:48:25,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 14:48:25,007 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 14:48:25,007 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 14:48:25,010 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 14:48:25,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:48:22" (1/3) ... [2019-10-02 14:48:25,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@398a8ebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:48:25, skipping insertion in model container [2019-10-02 14:48:25,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:48:23" (2/3) ... [2019-10-02 14:48:25,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@398a8ebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:48:25, skipping insertion in model container [2019-10-02 14:48:25,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:48:25" (3/3) ... [2019-10-02 14:48:25,014 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-02 14:48:25,025 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 14:48:25,034 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 14:48:25,052 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 14:48:25,109 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 14:48:25,110 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 14:48:25,111 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 14:48:25,111 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 14:48:25,111 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 14:48:25,111 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 14:48:25,112 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 14:48:25,112 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 14:48:25,112 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 14:48:25,139 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states. [2019-10-02 14:48:25,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-02 14:48:25,153 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:48:25,155 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:48:25,157 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:48:25,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:48:25,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1850165601, now seen corresponding path program 1 times [2019-10-02 14:48:25,163 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:48:25,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:48:25,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:48:25,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:48:25,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:48:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:48:25,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:48:25,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:48:25,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:48:25,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:48:25,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:48:25,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:48:25,897 INFO L87 Difference]: Start difference. First operand 310 states. Second operand 3 states. [2019-10-02 14:48:26,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:48:26,239 INFO L93 Difference]: Finished difference Result 605 states and 1058 transitions. [2019-10-02 14:48:26,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:48:26,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-10-02 14:48:26,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:48:26,274 INFO L225 Difference]: With dead ends: 605 [2019-10-02 14:48:26,274 INFO L226 Difference]: Without dead ends: 493 [2019-10-02 14:48:26,279 INFO L640 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-10-02 14:48:26,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-10-02 14:48:26,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 491. [2019-10-02 14:48:26,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2019-10-02 14:48:26,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 730 transitions. [2019-10-02 14:48:26,422 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 730 transitions. Word has length 148 [2019-10-02 14:48:26,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:48:26,425 INFO L475 AbstractCegarLoop]: Abstraction has 491 states and 730 transitions. [2019-10-02 14:48:26,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:48:26,425 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 730 transitions. [2019-10-02 14:48:26,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-02 14:48:26,437 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:48:26,438 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:48:26,438 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:48:26,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:48:26,439 INFO L82 PathProgramCache]: Analyzing trace with hash -835560269, now seen corresponding path program 1 times [2019-10-02 14:48:26,439 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:48:26,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:48:26,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:48:26,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:48:26,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:48:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:48:26,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:48:26,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:48:26,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 14:48:26,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:48:26,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:48:26,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:48:26,963 INFO L87 Difference]: Start difference. First operand 491 states and 730 transitions. Second operand 4 states. [2019-10-02 14:48:27,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:48:27,116 INFO L93 Difference]: Finished difference Result 1423 states and 2113 transitions. [2019-10-02 14:48:27,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:48:27,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-10-02 14:48:27,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:48:27,124 INFO L225 Difference]: With dead ends: 1423 [2019-10-02 14:48:27,125 INFO L226 Difference]: Without dead ends: 945 [2019-10-02 14:48:27,132 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:48:27,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-10-02 14:48:27,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 943. [2019-10-02 14:48:27,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2019-10-02 14:48:27,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1389 transitions. [2019-10-02 14:48:27,195 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1389 transitions. Word has length 148 [2019-10-02 14:48:27,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:48:27,196 INFO L475 AbstractCegarLoop]: Abstraction has 943 states and 1389 transitions. [2019-10-02 14:48:27,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:48:27,196 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1389 transitions. [2019-10-02 14:48:27,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-02 14:48:27,199 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:48:27,199 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:48:27,199 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:48:27,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:48:27,200 INFO L82 PathProgramCache]: Analyzing trace with hash -312485947, now seen corresponding path program 1 times [2019-10-02 14:48:27,200 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:48:27,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:48:27,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:48:27,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:48:27,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:48:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:48:27,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:48:27,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:48:27,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:48:27,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:48:27,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:48:27,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:48:27,315 INFO L87 Difference]: Start difference. First operand 943 states and 1389 transitions. Second operand 3 states. [2019-10-02 14:48:27,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:48:27,401 INFO L93 Difference]: Finished difference Result 2783 states and 4097 transitions. [2019-10-02 14:48:27,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:48:27,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-02 14:48:27,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:48:27,412 INFO L225 Difference]: With dead ends: 2783 [2019-10-02 14:48:27,413 INFO L226 Difference]: Without dead ends: 1872 [2019-10-02 14:48:27,416 INFO L640 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-10-02 14:48:27,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2019-10-02 14:48:27,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 945. [2019-10-02 14:48:27,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-10-02 14:48:27,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1391 transitions. [2019-10-02 14:48:27,503 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1391 transitions. Word has length 149 [2019-10-02 14:48:27,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:48:27,503 INFO L475 AbstractCegarLoop]: Abstraction has 945 states and 1391 transitions. [2019-10-02 14:48:27,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:48:27,504 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1391 transitions. [2019-10-02 14:48:27,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-02 14:48:27,508 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:48:27,509 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:48:27,509 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:48:27,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:48:27,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1358823732, now seen corresponding path program 1 times [2019-10-02 14:48:27,510 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:48:27,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:48:27,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:48:27,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:48:27,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:48:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:48:27,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:48:27,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:48:27,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 14:48:27,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:48:27,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:48:27,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:48:27,771 INFO L87 Difference]: Start difference. First operand 945 states and 1391 transitions. Second operand 4 states. [2019-10-02 14:48:27,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:48:27,876 INFO L93 Difference]: Finished difference Result 1876 states and 2764 transitions. [2019-10-02 14:48:27,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:48:27,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-10-02 14:48:27,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:48:27,883 INFO L225 Difference]: With dead ends: 1876 [2019-10-02 14:48:27,883 INFO L226 Difference]: Without dead ends: 943 [2019-10-02 14:48:27,886 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:48:27,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-10-02 14:48:27,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 943. [2019-10-02 14:48:27,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2019-10-02 14:48:28,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1387 transitions. [2019-10-02 14:48:28,041 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1387 transitions. Word has length 150 [2019-10-02 14:48:28,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:48:28,042 INFO L475 AbstractCegarLoop]: Abstraction has 943 states and 1387 transitions. [2019-10-02 14:48:28,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:48:28,043 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1387 transitions. [2019-10-02 14:48:28,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-02 14:48:28,047 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:48:28,048 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:48:28,048 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:48:28,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:48:28,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1528940934, now seen corresponding path program 1 times [2019-10-02 14:48:28,049 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:48:28,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:48:28,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:48:28,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:48:28,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:48:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:48:28,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:48:28,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:48:28,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:48:28,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:48:28,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:48:28,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:48:28,180 INFO L87 Difference]: Start difference. First operand 943 states and 1387 transitions. Second operand 3 states. [2019-10-02 14:48:28,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:48:28,298 INFO L93 Difference]: Finished difference Result 2159 states and 3193 transitions. [2019-10-02 14:48:28,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:48:28,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-10-02 14:48:28,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:48:28,306 INFO L225 Difference]: With dead ends: 2159 [2019-10-02 14:48:28,307 INFO L226 Difference]: Without dead ends: 1396 [2019-10-02 14:48:28,309 INFO L640 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-10-02 14:48:28,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2019-10-02 14:48:28,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1394. [2019-10-02 14:48:28,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1394 states. [2019-10-02 14:48:28,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2025 transitions. [2019-10-02 14:48:28,392 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2025 transitions. Word has length 150 [2019-10-02 14:48:28,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:48:28,393 INFO L475 AbstractCegarLoop]: Abstraction has 1394 states and 2025 transitions. [2019-10-02 14:48:28,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:48:28,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2025 transitions. [2019-10-02 14:48:28,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 14:48:28,396 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:48:28,397 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:48:28,397 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:48:28,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:48:28,397 INFO L82 PathProgramCache]: Analyzing trace with hash 2049235060, now seen corresponding path program 1 times [2019-10-02 14:48:28,398 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:48:28,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:48:28,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:48:28,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:48:28,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:48:28,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:48:28,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:48:28,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:48:28,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:48:28,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:48:28,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:48:28,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:48:28,514 INFO L87 Difference]: Start difference. First operand 1394 states and 2025 transitions. Second operand 3 states. [2019-10-02 14:48:29,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:48:29,124 INFO L93 Difference]: Finished difference Result 3707 states and 5443 transitions. [2019-10-02 14:48:29,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:48:29,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-10-02 14:48:29,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:48:29,146 INFO L225 Difference]: With dead ends: 3707 [2019-10-02 14:48:29,146 INFO L226 Difference]: Without dead ends: 2595 [2019-10-02 14:48:29,151 INFO L640 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-10-02 14:48:29,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2595 states. [2019-10-02 14:48:29,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2595 to 2593. [2019-10-02 14:48:29,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2593 states. [2019-10-02 14:48:29,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2593 states to 2593 states and 3764 transitions. [2019-10-02 14:48:29,403 INFO L78 Accepts]: Start accepts. Automaton has 2593 states and 3764 transitions. Word has length 156 [2019-10-02 14:48:29,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:48:29,405 INFO L475 AbstractCegarLoop]: Abstraction has 2593 states and 3764 transitions. [2019-10-02 14:48:29,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:48:29,406 INFO L276 IsEmpty]: Start isEmpty. Operand 2593 states and 3764 transitions. [2019-10-02 14:48:29,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 14:48:29,413 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:48:29,414 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:48:29,414 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:48:29,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:48:29,415 INFO L82 PathProgramCache]: Analyzing trace with hash 327258095, now seen corresponding path program 1 times [2019-10-02 14:48:29,415 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:48:29,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:48:29,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:48:29,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:48:29,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:48:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:48:29,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:48:29,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:48:29,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:48:29,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:48:29,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:48:29,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:48:29,691 INFO L87 Difference]: Start difference. First operand 2593 states and 3764 transitions. Second operand 6 states. [2019-10-02 14:48:30,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:48:30,406 INFO L93 Difference]: Finished difference Result 6395 states and 10006 transitions. [2019-10-02 14:48:30,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 14:48:30,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 156 [2019-10-02 14:48:30,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:48:30,436 INFO L225 Difference]: With dead ends: 6395 [2019-10-02 14:48:30,436 INFO L226 Difference]: Without dead ends: 5489 [2019-10-02 14:48:30,440 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:48:30,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5489 states. [2019-10-02 14:48:30,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5489 to 5453. [2019-10-02 14:48:30,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5453 states. [2019-10-02 14:48:30,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5453 states to 5453 states and 8364 transitions. [2019-10-02 14:48:30,923 INFO L78 Accepts]: Start accepts. Automaton has 5453 states and 8364 transitions. Word has length 156 [2019-10-02 14:48:30,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:48:30,923 INFO L475 AbstractCegarLoop]: Abstraction has 5453 states and 8364 transitions. [2019-10-02 14:48:30,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:48:30,923 INFO L276 IsEmpty]: Start isEmpty. Operand 5453 states and 8364 transitions. [2019-10-02 14:48:30,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 14:48:30,929 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:48:30,929 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:48:30,929 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:48:30,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:48:30,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1936499521, now seen corresponding path program 1 times [2019-10-02 14:48:30,930 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:48:30,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:48:30,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:48:30,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:48:30,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:48:30,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:48:31,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:48:31,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:48:31,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 14:48:31,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:48:31,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:48:31,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:48:31,256 INFO L87 Difference]: Start difference. First operand 5453 states and 8364 transitions. Second operand 8 states. [2019-10-02 14:48:31,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:48:31,760 INFO L93 Difference]: Finished difference Result 9061 states and 14264 transitions. [2019-10-02 14:48:31,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:48:31,761 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 156 [2019-10-02 14:48:31,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:48:31,793 INFO L225 Difference]: With dead ends: 9061 [2019-10-02 14:48:31,794 INFO L226 Difference]: Without dead ends: 5455 [2019-10-02 14:48:31,805 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:48:31,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5455 states. [2019-10-02 14:48:32,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5455 to 5453. [2019-10-02 14:48:32,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5453 states. [2019-10-02 14:48:32,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5453 states to 5453 states and 8328 transitions. [2019-10-02 14:48:32,237 INFO L78 Accepts]: Start accepts. Automaton has 5453 states and 8328 transitions. Word has length 156 [2019-10-02 14:48:32,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:48:32,238 INFO L475 AbstractCegarLoop]: Abstraction has 5453 states and 8328 transitions. [2019-10-02 14:48:32,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:48:32,238 INFO L276 IsEmpty]: Start isEmpty. Operand 5453 states and 8328 transitions. [2019-10-02 14:48:32,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 14:48:32,247 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:48:32,248 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:48:32,248 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:48:32,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:48:32,249 INFO L82 PathProgramCache]: Analyzing trace with hash -681147618, now seen corresponding path program 1 times [2019-10-02 14:48:32,249 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:48:32,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:48:32,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:48:32,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:48:32,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:48:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:48:32,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:48:32,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:48:32,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 14:48:32,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:48:32,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:48:32,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:48:32,548 INFO L87 Difference]: Start difference. First operand 5453 states and 8328 transitions. Second operand 4 states. [2019-10-02 14:48:33,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:48:33,057 INFO L93 Difference]: Finished difference Result 14216 states and 21721 transitions. [2019-10-02 14:48:33,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:48:33,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-10-02 14:48:33,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:48:33,100 INFO L225 Difference]: With dead ends: 14216 [2019-10-02 14:48:33,100 INFO L226 Difference]: Without dead ends: 8786 [2019-10-02 14:48:33,115 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:48:33,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8786 states. [2019-10-02 14:48:33,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8786 to 8784. [2019-10-02 14:48:33,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8784 states. [2019-10-02 14:48:33,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8784 states to 8784 states and 13279 transitions. [2019-10-02 14:48:33,732 INFO L78 Accepts]: Start accepts. Automaton has 8784 states and 13279 transitions. Word has length 156 [2019-10-02 14:48:33,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:48:33,733 INFO L475 AbstractCegarLoop]: Abstraction has 8784 states and 13279 transitions. [2019-10-02 14:48:33,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:48:33,733 INFO L276 IsEmpty]: Start isEmpty. Operand 8784 states and 13279 transitions. [2019-10-02 14:48:33,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 14:48:33,740 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:48:33,741 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:48:33,741 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:48:33,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:48:33,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1122789079, now seen corresponding path program 1 times [2019-10-02 14:48:33,742 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:48:33,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:48:33,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:48:33,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:48:33,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:48:33,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:48:33,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:48:33,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:48:33,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:48:33,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:48:33,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:48:33,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:48:33,856 INFO L87 Difference]: Start difference. First operand 8784 states and 13279 transitions. Second operand 3 states. [2019-10-02 14:48:34,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:48:34,623 INFO L93 Difference]: Finished difference Result 25169 states and 38128 transitions. [2019-10-02 14:48:34,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:48:34,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-10-02 14:48:34,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:48:34,662 INFO L225 Difference]: With dead ends: 25169 [2019-10-02 14:48:34,662 INFO L226 Difference]: Without dead ends: 16843 [2019-10-02 14:48:34,681 INFO L640 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-10-02 14:48:34,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16843 states. [2019-10-02 14:48:36,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16843 to 16841. [2019-10-02 14:48:36,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16841 states. [2019-10-02 14:48:36,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16841 states to 16841 states and 25210 transitions. [2019-10-02 14:48:36,118 INFO L78 Accepts]: Start accepts. Automaton has 16841 states and 25210 transitions. Word has length 158 [2019-10-02 14:48:36,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:48:36,118 INFO L475 AbstractCegarLoop]: Abstraction has 16841 states and 25210 transitions. [2019-10-02 14:48:36,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:48:36,119 INFO L276 IsEmpty]: Start isEmpty. Operand 16841 states and 25210 transitions. [2019-10-02 14:48:36,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 14:48:36,131 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:48:36,131 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:48:36,132 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:48:36,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:48:36,132 INFO L82 PathProgramCache]: Analyzing trace with hash 725817844, now seen corresponding path program 1 times [2019-10-02 14:48:36,132 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:48:36,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:48:36,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:48:36,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:48:36,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:48:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:48:36,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:48:36,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:48:36,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 14:48:36,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:48:36,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:48:36,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:48:36,289 INFO L87 Difference]: Start difference. First operand 16841 states and 25210 transitions. Second operand 4 states. [2019-10-02 14:48:37,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:48:37,076 INFO L93 Difference]: Finished difference Result 26903 states and 40236 transitions. [2019-10-02 14:48:37,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:48:37,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-10-02 14:48:37,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:48:37,108 INFO L225 Difference]: With dead ends: 26903 [2019-10-02 14:48:37,108 INFO L226 Difference]: Without dead ends: 13712 [2019-10-02 14:48:37,136 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:48:37,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13712 states. [2019-10-02 14:48:37,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13712 to 13712. [2019-10-02 14:48:37,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13712 states. [2019-10-02 14:48:37,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13712 states to 13712 states and 20437 transitions. [2019-10-02 14:48:37,823 INFO L78 Accepts]: Start accepts. Automaton has 13712 states and 20437 transitions. Word has length 158 [2019-10-02 14:48:37,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:48:37,824 INFO L475 AbstractCegarLoop]: Abstraction has 13712 states and 20437 transitions. [2019-10-02 14:48:37,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:48:37,824 INFO L276 IsEmpty]: Start isEmpty. Operand 13712 states and 20437 transitions. [2019-10-02 14:48:37,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-02 14:48:37,837 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:48:37,837 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:48:37,838 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:48:37,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:48:37,838 INFO L82 PathProgramCache]: Analyzing trace with hash 579616721, now seen corresponding path program 1 times [2019-10-02 14:48:37,838 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:48:37,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:48:37,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:48:37,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:48:37,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:48:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:48:38,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:48:38,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:48:38,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 14:48:38,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:48:38,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:48:38,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:48:38,160 INFO L87 Difference]: Start difference. First operand 13712 states and 20437 transitions. Second operand 4 states. [2019-10-02 14:48:39,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:48:39,309 INFO L93 Difference]: Finished difference Result 40158 states and 59777 transitions. [2019-10-02 14:48:39,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:48:39,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-10-02 14:48:39,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:48:39,364 INFO L225 Difference]: With dead ends: 40158 [2019-10-02 14:48:39,364 INFO L226 Difference]: Without dead ends: 26489 [2019-10-02 14:48:39,392 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:48:39,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26489 states. [2019-10-02 14:48:41,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26489 to 26487. [2019-10-02 14:48:41,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26487 states. [2019-10-02 14:48:41,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26487 states to 26487 states and 39050 transitions. [2019-10-02 14:48:41,289 INFO L78 Accepts]: Start accepts. Automaton has 26487 states and 39050 transitions. Word has length 164 [2019-10-02 14:48:41,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:48:41,290 INFO L475 AbstractCegarLoop]: Abstraction has 26487 states and 39050 transitions. [2019-10-02 14:48:41,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:48:41,290 INFO L276 IsEmpty]: Start isEmpty. Operand 26487 states and 39050 transitions. [2019-10-02 14:48:41,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-02 14:48:41,306 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:48:41,306 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:48:41,306 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:48:41,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:48:41,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1599816613, now seen corresponding path program 1 times [2019-10-02 14:48:41,307 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:48:41,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:48:41,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:48:41,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:48:41,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:48:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:48:41,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:48:41,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:48:41,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:48:41,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:48:41,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:48:41,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:48:41,371 INFO L87 Difference]: Start difference. First operand 26487 states and 39050 transitions. Second operand 3 states. [2019-10-02 14:48:43,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:48:43,190 INFO L93 Difference]: Finished difference Result 79261 states and 116893 transitions. [2019-10-02 14:48:43,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:48:43,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-10-02 14:48:43,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:48:43,282 INFO L225 Difference]: With dead ends: 79261 [2019-10-02 14:48:43,282 INFO L226 Difference]: Without dead ends: 52883 [2019-10-02 14:48:43,331 INFO L640 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-10-02 14:48:43,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52883 states. [2019-10-02 14:48:44,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52883 to 26493. [2019-10-02 14:48:44,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26493 states. [2019-10-02 14:48:44,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26493 states to 26493 states and 39056 transitions. [2019-10-02 14:48:44,858 INFO L78 Accepts]: Start accepts. Automaton has 26493 states and 39056 transitions. Word has length 165 [2019-10-02 14:48:44,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:48:44,858 INFO L475 AbstractCegarLoop]: Abstraction has 26493 states and 39056 transitions. [2019-10-02 14:48:44,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:48:44,859 INFO L276 IsEmpty]: Start isEmpty. Operand 26493 states and 39056 transitions. [2019-10-02 14:48:44,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 14:48:44,873 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:48:44,874 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:48:44,874 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:48:44,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:48:44,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1477917308, now seen corresponding path program 1 times [2019-10-02 14:48:44,874 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:48:44,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:48:44,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:48:44,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:48:44,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:48:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:48:44,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:48:44,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:48:44,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:48:44,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:48:44,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:48:44,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:48:44,976 INFO L87 Difference]: Start difference. First operand 26493 states and 39056 transitions. Second operand 3 states. [2019-10-02 14:48:47,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:48:47,918 INFO L93 Difference]: Finished difference Result 76746 states and 113125 transitions. [2019-10-02 14:48:47,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:48:47,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-10-02 14:48:47,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:48:47,983 INFO L225 Difference]: With dead ends: 76746 [2019-10-02 14:48:47,983 INFO L226 Difference]: Without dead ends: 51200 [2019-10-02 14:48:48,017 INFO L640 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-10-02 14:48:48,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51200 states. [2019-10-02 14:48:50,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51200 to 51198. [2019-10-02 14:48:50,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51198 states. [2019-10-02 14:48:50,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51198 states to 51198 states and 74563 transitions. [2019-10-02 14:48:50,266 INFO L78 Accepts]: Start accepts. Automaton has 51198 states and 74563 transitions. Word has length 166 [2019-10-02 14:48:50,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:48:50,266 INFO L475 AbstractCegarLoop]: Abstraction has 51198 states and 74563 transitions. [2019-10-02 14:48:50,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:48:50,266 INFO L276 IsEmpty]: Start isEmpty. Operand 51198 states and 74563 transitions. [2019-10-02 14:48:50,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 14:48:50,286 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:48:50,286 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:48:50,286 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:48:50,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:48:50,287 INFO L82 PathProgramCache]: Analyzing trace with hash 561013721, now seen corresponding path program 1 times [2019-10-02 14:48:50,287 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:48:50,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:48:50,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:48:50,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:48:50,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:48:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:48:50,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:48:50,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:48:50,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 14:48:50,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:48:50,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:48:50,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:48:50,446 INFO L87 Difference]: Start difference. First operand 51198 states and 74563 transitions. Second operand 4 states. [2019-10-02 14:48:52,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:48:52,328 INFO L93 Difference]: Finished difference Result 89658 states and 130557 transitions. [2019-10-02 14:48:52,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:48:52,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-10-02 14:48:52,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:48:52,383 INFO L225 Difference]: With dead ends: 89658 [2019-10-02 14:48:52,383 INFO L226 Difference]: Without dead ends: 39289 [2019-10-02 14:48:52,436 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:48:52,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39289 states. [2019-10-02 14:48:55,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39289 to 39289. [2019-10-02 14:48:55,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39289 states. [2019-10-02 14:48:55,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39289 states to 39289 states and 56981 transitions. [2019-10-02 14:48:55,555 INFO L78 Accepts]: Start accepts. Automaton has 39289 states and 56981 transitions. Word has length 166 [2019-10-02 14:48:55,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:48:55,556 INFO L475 AbstractCegarLoop]: Abstraction has 39289 states and 56981 transitions. [2019-10-02 14:48:55,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:48:55,556 INFO L276 IsEmpty]: Start isEmpty. Operand 39289 states and 56981 transitions. [2019-10-02 14:48:55,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 14:48:55,572 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:48:55,572 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:48:55,572 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:48:55,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:48:55,572 INFO L82 PathProgramCache]: Analyzing trace with hash 2055563735, now seen corresponding path program 1 times [2019-10-02 14:48:55,572 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:48:55,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:48:55,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:48:55,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:48:55,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:48:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:48:55,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:48:55,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:48:55,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:48:55,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:48:55,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:48:55,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:48:55,658 INFO L87 Difference]: Start difference. First operand 39289 states and 56981 transitions. Second operand 3 states. [2019-10-02 14:48:58,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:48:58,326 INFO L93 Difference]: Finished difference Result 89984 states and 132648 transitions. [2019-10-02 14:48:58,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:48:58,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-10-02 14:48:58,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:48:58,425 INFO L225 Difference]: With dead ends: 89984 [2019-10-02 14:48:58,425 INFO L226 Difference]: Without dead ends: 54812 [2019-10-02 14:48:58,475 INFO L640 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-10-02 14:48:58,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54812 states. [2019-10-02 14:49:01,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54812 to 54810. [2019-10-02 14:49:01,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54810 states. [2019-10-02 14:49:01,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54810 states to 54810 states and 80195 transitions. [2019-10-02 14:49:01,256 INFO L78 Accepts]: Start accepts. Automaton has 54810 states and 80195 transitions. Word has length 172 [2019-10-02 14:49:01,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:49:01,256 INFO L475 AbstractCegarLoop]: Abstraction has 54810 states and 80195 transitions. [2019-10-02 14:49:01,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:49:01,256 INFO L276 IsEmpty]: Start isEmpty. Operand 54810 states and 80195 transitions. [2019-10-02 14:49:01,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 14:49:01,270 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:49:01,270 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:49:01,270 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:49:01,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:49:01,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1864738212, now seen corresponding path program 1 times [2019-10-02 14:49:01,271 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:49:01,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:49:01,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:49:01,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:49:01,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:49:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:49:01,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:49:01,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:49:01,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:49:01,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:49:01,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:49:01,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:49:01,407 INFO L87 Difference]: Start difference. First operand 54810 states and 80195 transitions. Second operand 3 states. [2019-10-02 14:49:06,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:49:06,629 INFO L93 Difference]: Finished difference Result 143020 states and 210665 transitions. [2019-10-02 14:49:06,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:49:06,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-10-02 14:49:06,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:49:06,770 INFO L225 Difference]: With dead ends: 143020 [2019-10-02 14:49:06,771 INFO L226 Difference]: Without dead ends: 99481 [2019-10-02 14:49:06,997 INFO L640 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-10-02 14:49:07,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99481 states. [2019-10-02 14:49:11,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99481 to 99479. [2019-10-02 14:49:11,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99479 states. [2019-10-02 14:49:11,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99479 states to 99479 states and 144973 transitions. [2019-10-02 14:49:11,464 INFO L78 Accepts]: Start accepts. Automaton has 99479 states and 144973 transitions. Word has length 172 [2019-10-02 14:49:11,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:49:11,464 INFO L475 AbstractCegarLoop]: Abstraction has 99479 states and 144973 transitions. [2019-10-02 14:49:11,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:49:11,464 INFO L276 IsEmpty]: Start isEmpty. Operand 99479 states and 144973 transitions. [2019-10-02 14:49:11,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 14:49:11,491 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:49:11,491 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:49:11,491 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:49:11,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:49:11,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1996973343, now seen corresponding path program 1 times [2019-10-02 14:49:11,492 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:49:11,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:49:11,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:49:11,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:49:11,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:49:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:49:11,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:49:11,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:49:11,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 14:49:11,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:49:11,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:49:11,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:49:11,800 INFO L87 Difference]: Start difference. First operand 99479 states and 144973 transitions. Second operand 10 states. [2019-10-02 14:49:16,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:49:16,503 INFO L93 Difference]: Finished difference Result 160145 states and 235376 transitions. [2019-10-02 14:49:16,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:49:16,503 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 172 [2019-10-02 14:49:16,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:49:16,596 INFO L225 Difference]: With dead ends: 160145 [2019-10-02 14:49:16,596 INFO L226 Difference]: Without dead ends: 64617 [2019-10-02 14:49:16,681 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:49:16,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64617 states. [2019-10-02 14:49:18,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64617 to 36144. [2019-10-02 14:49:18,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36144 states. [2019-10-02 14:49:18,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36144 states to 36144 states and 51968 transitions. [2019-10-02 14:49:18,974 INFO L78 Accepts]: Start accepts. Automaton has 36144 states and 51968 transitions. Word has length 172 [2019-10-02 14:49:18,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:49:18,975 INFO L475 AbstractCegarLoop]: Abstraction has 36144 states and 51968 transitions. [2019-10-02 14:49:18,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:49:18,975 INFO L276 IsEmpty]: Start isEmpty. Operand 36144 states and 51968 transitions. [2019-10-02 14:49:18,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 14:49:18,989 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:49:18,989 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:49:18,989 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:49:18,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:49:18,990 INFO L82 PathProgramCache]: Analyzing trace with hash 406501079, now seen corresponding path program 1 times [2019-10-02 14:49:18,990 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:49:18,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:49:18,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:49:18,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:49:18,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:49:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:49:19,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:49:19,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:49:19,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:49:19,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:49:19,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:49:19,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:49:19,303 INFO L87 Difference]: Start difference. First operand 36144 states and 51968 transitions. Second operand 9 states. [2019-10-02 14:49:24,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:49:24,443 INFO L93 Difference]: Finished difference Result 93711 states and 137610 transitions. [2019-10-02 14:49:24,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:49:24,443 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 172 [2019-10-02 14:49:24,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:49:24,521 INFO L225 Difference]: With dead ends: 93711 [2019-10-02 14:49:24,521 INFO L226 Difference]: Without dead ends: 66827 [2019-10-02 14:49:24,547 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:49:24,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66827 states. [2019-10-02 14:49:28,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66827 to 66555. [2019-10-02 14:49:28,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66555 states. [2019-10-02 14:49:28,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66555 states to 66555 states and 96275 transitions. [2019-10-02 14:49:28,345 INFO L78 Accepts]: Start accepts. Automaton has 66555 states and 96275 transitions. Word has length 172 [2019-10-02 14:49:28,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:49:28,345 INFO L475 AbstractCegarLoop]: Abstraction has 66555 states and 96275 transitions. [2019-10-02 14:49:28,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:49:28,346 INFO L276 IsEmpty]: Start isEmpty. Operand 66555 states and 96275 transitions. [2019-10-02 14:49:28,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 14:49:28,359 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:49:28,359 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:49:28,359 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:49:28,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:49:28,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1518935673, now seen corresponding path program 1 times [2019-10-02 14:49:28,360 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:49:28,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:49:28,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:49:28,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:49:28,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:49:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:49:28,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:49:28,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:49:28,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 14:49:28,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 14:49:28,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 14:49:28,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:49:28,826 INFO L87 Difference]: Start difference. First operand 66555 states and 96275 transitions. Second operand 15 states. [2019-10-02 14:49:40,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:49:40,503 INFO L93 Difference]: Finished difference Result 147370 states and 214570 transitions. [2019-10-02 14:49:40,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 14:49:40,503 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 172 [2019-10-02 14:49:40,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:49:40,683 INFO L225 Difference]: With dead ends: 147370 [2019-10-02 14:49:40,683 INFO L226 Difference]: Without dead ends: 140642 [2019-10-02 14:49:40,719 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=380, Invalid=1026, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 14:49:40,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140642 states. [2019-10-02 14:49:48,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140642 to 69483. [2019-10-02 14:49:48,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69483 states. [2019-10-02 14:49:48,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69483 states to 69483 states and 99712 transitions. [2019-10-02 14:49:48,522 INFO L78 Accepts]: Start accepts. Automaton has 69483 states and 99712 transitions. Word has length 172 [2019-10-02 14:49:48,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:49:48,523 INFO L475 AbstractCegarLoop]: Abstraction has 69483 states and 99712 transitions. [2019-10-02 14:49:48,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 14:49:48,523 INFO L276 IsEmpty]: Start isEmpty. Operand 69483 states and 99712 transitions. [2019-10-02 14:49:48,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 14:49:48,538 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:49:48,538 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:49:48,538 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:49:48,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:49:48,539 INFO L82 PathProgramCache]: Analyzing trace with hash 323129642, now seen corresponding path program 1 times [2019-10-02 14:49:48,539 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:49:48,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:49:48,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:49:48,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:49:48,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:49:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:49:48,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:49:48,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:49:48,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 14:49:48,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 14:49:48,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 14:49:48,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-10-02 14:49:48,943 INFO L87 Difference]: Start difference. First operand 69483 states and 99712 transitions. Second operand 13 states. [2019-10-02 14:49:58,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:49:58,155 INFO L93 Difference]: Finished difference Result 115065 states and 167101 transitions. [2019-10-02 14:49:58,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 14:49:58,156 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 172 [2019-10-02 14:49:58,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:49:58,284 INFO L225 Difference]: With dead ends: 115065 [2019-10-02 14:49:58,284 INFO L226 Difference]: Without dead ends: 101289 [2019-10-02 14:49:58,318 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=216, Invalid=654, Unknown=0, NotChecked=0, Total=870 [2019-10-02 14:49:58,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101289 states. [2019-10-02 14:50:04,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101289 to 70729. [2019-10-02 14:50:04,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70729 states. [2019-10-02 14:50:04,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70729 states to 70729 states and 101144 transitions. [2019-10-02 14:50:04,685 INFO L78 Accepts]: Start accepts. Automaton has 70729 states and 101144 transitions. Word has length 172 [2019-10-02 14:50:04,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:50:04,685 INFO L475 AbstractCegarLoop]: Abstraction has 70729 states and 101144 transitions. [2019-10-02 14:50:04,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 14:50:04,685 INFO L276 IsEmpty]: Start isEmpty. Operand 70729 states and 101144 transitions. [2019-10-02 14:50:04,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 14:50:04,702 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:50:04,702 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:50:04,702 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:50:04,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:50:04,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1983572546, now seen corresponding path program 1 times [2019-10-02 14:50:04,702 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:50:04,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:50:04,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:04,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:50:04,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:04,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:50:04,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:50:04,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:50:04,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 14:50:04,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:50:04,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:50:04,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:50:04,896 INFO L87 Difference]: Start difference. First operand 70729 states and 101144 transitions. Second operand 4 states. [2019-10-02 14:50:12,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:50:12,844 INFO L93 Difference]: Finished difference Result 136816 states and 195561 transitions. [2019-10-02 14:50:12,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:50:12,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-10-02 14:50:12,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:50:12,933 INFO L225 Difference]: With dead ends: 136816 [2019-10-02 14:50:12,933 INFO L226 Difference]: Without dead ends: 66492 [2019-10-02 14:50:12,988 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:50:13,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66492 states. [2019-10-02 14:50:18,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66492 to 66445. [2019-10-02 14:50:18,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66445 states. [2019-10-02 14:50:18,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66445 states to 66445 states and 94828 transitions. [2019-10-02 14:50:18,286 INFO L78 Accepts]: Start accepts. Automaton has 66445 states and 94828 transitions. Word has length 172 [2019-10-02 14:50:18,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:50:18,286 INFO L475 AbstractCegarLoop]: Abstraction has 66445 states and 94828 transitions. [2019-10-02 14:50:18,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:50:18,286 INFO L276 IsEmpty]: Start isEmpty. Operand 66445 states and 94828 transitions. [2019-10-02 14:50:18,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-02 14:50:18,303 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:50:18,303 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:50:18,303 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:50:18,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:50:18,303 INFO L82 PathProgramCache]: Analyzing trace with hash 920545503, now seen corresponding path program 1 times [2019-10-02 14:50:18,304 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:50:18,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:50:18,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:18,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:50:18,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:50:18,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:50:18,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:50:18,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 14:50:18,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:50:18,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:50:18,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:50:18,484 INFO L87 Difference]: Start difference. First operand 66445 states and 94828 transitions. Second operand 4 states. [2019-10-02 14:50:24,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:50:24,513 INFO L93 Difference]: Finished difference Result 133000 states and 189792 transitions. [2019-10-02 14:50:24,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:50:24,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-10-02 14:50:24,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:50:24,591 INFO L225 Difference]: With dead ends: 133000 [2019-10-02 14:50:24,591 INFO L226 Difference]: Without dead ends: 66710 [2019-10-02 14:50:24,632 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:50:24,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66710 states. [2019-10-02 14:50:31,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66710 to 66576. [2019-10-02 14:50:31,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66576 states. [2019-10-02 14:50:31,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66576 states to 66576 states and 94966 transitions. [2019-10-02 14:50:31,643 INFO L78 Accepts]: Start accepts. Automaton has 66576 states and 94966 transitions. Word has length 174 [2019-10-02 14:50:31,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:50:31,644 INFO L475 AbstractCegarLoop]: Abstraction has 66576 states and 94966 transitions. [2019-10-02 14:50:31,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:50:31,644 INFO L276 IsEmpty]: Start isEmpty. Operand 66576 states and 94966 transitions. [2019-10-02 14:50:31,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 14:50:31,660 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:50:31,660 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:50:31,661 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:50:31,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:50:31,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1952765221, now seen corresponding path program 1 times [2019-10-02 14:50:31,661 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:50:31,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:50:31,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:31,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:50:31,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:50:31,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:50:31,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:50:31,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:50:31,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:50:31,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:50:31,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:50:31,721 INFO L87 Difference]: Start difference. First operand 66576 states and 94966 transitions. Second operand 3 states. [2019-10-02 14:50:43,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:50:43,129 INFO L93 Difference]: Finished difference Result 184237 states and 262647 transitions. [2019-10-02 14:50:43,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:50:43,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-10-02 14:50:43,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:50:43,281 INFO L225 Difference]: With dead ends: 184237 [2019-10-02 14:50:43,281 INFO L226 Difference]: Without dead ends: 132947 [2019-10-02 14:50:43,322 INFO L640 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-10-02 14:50:43,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132947 states. [2019-10-02 14:50:49,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132947 to 66586. [2019-10-02 14:50:49,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66586 states. [2019-10-02 14:50:49,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66586 states to 66586 states and 94976 transitions. [2019-10-02 14:50:49,909 INFO L78 Accepts]: Start accepts. Automaton has 66586 states and 94976 transitions. Word has length 175 [2019-10-02 14:50:49,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:50:49,909 INFO L475 AbstractCegarLoop]: Abstraction has 66586 states and 94976 transitions. [2019-10-02 14:50:49,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:50:49,910 INFO L276 IsEmpty]: Start isEmpty. Operand 66586 states and 94976 transitions. [2019-10-02 14:50:49,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 14:50:49,925 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:50:49,925 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:50:49,926 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:50:49,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:50:49,926 INFO L82 PathProgramCache]: Analyzing trace with hash 246843552, now seen corresponding path program 1 times [2019-10-02 14:50:49,926 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:50:49,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:50:49,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:49,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:50:49,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:50:50,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:50:50,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:50:50,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 14:50:50,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:50:50,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:50:50,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:50:50,048 INFO L87 Difference]: Start difference. First operand 66586 states and 94976 transitions. Second operand 4 states. [2019-10-02 14:50:56,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:50:56,969 INFO L93 Difference]: Finished difference Result 118394 states and 168503 transitions. [2019-10-02 14:50:56,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:50:56,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-10-02 14:50:56,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:50:57,047 INFO L225 Difference]: With dead ends: 118394 [2019-10-02 14:50:57,047 INFO L226 Difference]: Without dead ends: 66576 [2019-10-02 14:50:57,088 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:50:57,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66576 states. [2019-10-02 14:51:02,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66576 to 66576. [2019-10-02 14:51:02,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66576 states. [2019-10-02 14:51:02,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66576 states to 66576 states and 94961 transitions. [2019-10-02 14:51:02,789 INFO L78 Accepts]: Start accepts. Automaton has 66576 states and 94961 transitions. Word has length 176 [2019-10-02 14:51:02,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:51:02,790 INFO L475 AbstractCegarLoop]: Abstraction has 66576 states and 94961 transitions. [2019-10-02 14:51:02,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:51:02,790 INFO L276 IsEmpty]: Start isEmpty. Operand 66576 states and 94961 transitions. [2019-10-02 14:51:02,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 14:51:02,805 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:51:02,806 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:51:02,806 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:51:02,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:51:02,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1598358574, now seen corresponding path program 1 times [2019-10-02 14:51:02,806 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:51:02,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:51:02,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:51:02,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:51:02,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:51:02,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:51:03,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:51:03,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:51:03,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 14:51:03,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:51:03,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:51:03,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:51:03,007 INFO L87 Difference]: Start difference. First operand 66576 states and 94961 transitions. Second operand 4 states. [2019-10-02 14:51:08,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:51:08,773 INFO L93 Difference]: Finished difference Result 124210 states and 177091 transitions. [2019-10-02 14:51:08,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:51:08,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-10-02 14:51:08,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:51:08,846 INFO L225 Difference]: With dead ends: 124210 [2019-10-02 14:51:08,846 INFO L226 Difference]: Without dead ends: 57938 [2019-10-02 14:51:08,893 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:51:08,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57938 states. [2019-10-02 14:51:15,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57938 to 57700. [2019-10-02 14:51:15,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57700 states. [2019-10-02 14:51:15,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57700 states to 57700 states and 82171 transitions. [2019-10-02 14:51:15,590 INFO L78 Accepts]: Start accepts. Automaton has 57700 states and 82171 transitions. Word has length 176 [2019-10-02 14:51:15,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:51:15,590 INFO L475 AbstractCegarLoop]: Abstraction has 57700 states and 82171 transitions. [2019-10-02 14:51:15,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:51:15,590 INFO L276 IsEmpty]: Start isEmpty. Operand 57700 states and 82171 transitions. [2019-10-02 14:51:15,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 14:51:15,603 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:51:15,603 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:51:15,604 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:51:15,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:51:15,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1729659236, now seen corresponding path program 1 times [2019-10-02 14:51:15,604 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:51:15,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:51:15,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:51:15,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:51:15,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:51:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:51:15,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:51:15,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:51:15,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:51:15,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:51:15,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:51:15,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:51:15,688 INFO L87 Difference]: Start difference. First operand 57700 states and 82171 transitions. Second operand 3 states. [2019-10-02 14:51:22,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:51:22,391 INFO L93 Difference]: Finished difference Result 103676 states and 150358 transitions. [2019-10-02 14:51:22,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:51:22,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-10-02 14:51:22,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:51:22,475 INFO L225 Difference]: With dead ends: 103676 [2019-10-02 14:51:22,475 INFO L226 Difference]: Without dead ends: 67756 [2019-10-02 14:51:22,505 INFO L640 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-10-02 14:51:22,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67756 states. [2019-10-02 14:51:28,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67756 to 67754. [2019-10-02 14:51:28,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67754 states. [2019-10-02 14:51:29,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67754 states to 67754 states and 97023 transitions. [2019-10-02 14:51:29,257 INFO L78 Accepts]: Start accepts. Automaton has 67754 states and 97023 transitions. Word has length 178 [2019-10-02 14:51:29,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:51:29,257 INFO L475 AbstractCegarLoop]: Abstraction has 67754 states and 97023 transitions. [2019-10-02 14:51:29,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:51:29,257 INFO L276 IsEmpty]: Start isEmpty. Operand 67754 states and 97023 transitions. [2019-10-02 14:51:29,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 14:51:29,271 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:51:29,271 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:51:29,271 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:51:29,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:51:29,272 INFO L82 PathProgramCache]: Analyzing trace with hash 629623711, now seen corresponding path program 1 times [2019-10-02 14:51:29,272 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:51:29,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:51:29,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:51:29,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:51:29,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:51:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:51:29,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:51:29,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:51:29,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:51:29,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:51:29,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:51:29,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:51:29,361 INFO L87 Difference]: Start difference. First operand 67754 states and 97023 transitions. Second operand 3 states. [2019-10-02 14:51:42,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:51:42,448 INFO L93 Difference]: Finished difference Result 194068 states and 279045 transitions. [2019-10-02 14:51:42,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:51:42,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-10-02 14:51:42,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:51:42,620 INFO L225 Difference]: With dead ends: 194068 [2019-10-02 14:51:42,620 INFO L226 Difference]: Without dead ends: 132718 [2019-10-02 14:51:42,676 INFO L640 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-10-02 14:51:42,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132718 states. [2019-10-02 14:51:55,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132718 to 132716. [2019-10-02 14:51:55,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132716 states. [2019-10-02 14:51:55,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132716 states to 132716 states and 188347 transitions. [2019-10-02 14:51:55,321 INFO L78 Accepts]: Start accepts. Automaton has 132716 states and 188347 transitions. Word has length 178 [2019-10-02 14:51:55,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:51:55,321 INFO L475 AbstractCegarLoop]: Abstraction has 132716 states and 188347 transitions. [2019-10-02 14:51:55,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:51:55,321 INFO L276 IsEmpty]: Start isEmpty. Operand 132716 states and 188347 transitions. [2019-10-02 14:51:55,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 14:51:55,351 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:51:55,351 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:51:55,352 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:51:55,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:51:55,352 INFO L82 PathProgramCache]: Analyzing trace with hash 877619674, now seen corresponding path program 1 times [2019-10-02 14:51:55,352 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:51:55,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:51:55,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:51:55,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:51:55,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:51:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:51:55,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:51:55,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:51:55,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 14:51:55,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 14:51:55,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 14:51:55,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:51:55,726 INFO L87 Difference]: Start difference. First operand 132716 states and 188347 transitions. Second operand 12 states. [2019-10-02 14:52:37,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:52:37,966 INFO L93 Difference]: Finished difference Result 456766 states and 665895 transitions. [2019-10-02 14:52:37,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 14:52:37,966 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 178 [2019-10-02 14:52:37,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:52:38,480 INFO L225 Difference]: With dead ends: 456766 [2019-10-02 14:52:38,480 INFO L226 Difference]: Without dead ends: 339018 [2019-10-02 14:52:38,594 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=237, Invalid=693, Unknown=0, NotChecked=0, Total=930 [2019-10-02 14:52:38,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339018 states. [2019-10-02 14:53:08,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339018 to 220918. [2019-10-02 14:53:08,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220918 states. [2019-10-02 14:53:08,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220918 states to 220918 states and 319822 transitions. [2019-10-02 14:53:08,906 INFO L78 Accepts]: Start accepts. Automaton has 220918 states and 319822 transitions. Word has length 178 [2019-10-02 14:53:08,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:53:08,906 INFO L475 AbstractCegarLoop]: Abstraction has 220918 states and 319822 transitions. [2019-10-02 14:53:08,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 14:53:08,906 INFO L276 IsEmpty]: Start isEmpty. Operand 220918 states and 319822 transitions. [2019-10-02 14:53:08,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 14:53:08,935 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:53:08,935 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:53:08,935 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:53:08,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:53:08,936 INFO L82 PathProgramCache]: Analyzing trace with hash 398907811, now seen corresponding path program 1 times [2019-10-02 14:53:08,936 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:53:08,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:53:08,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:53:08,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:53:08,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:53:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:53:09,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:53:09,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:53:09,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:53:09,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:53:09,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:53:09,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:53:09,115 INFO L87 Difference]: Start difference. First operand 220918 states and 319822 transitions. Second operand 5 states. [2019-10-02 14:54:01,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:54:01,299 INFO L93 Difference]: Finished difference Result 596995 states and 882568 transitions. [2019-10-02 14:54:01,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:54:01,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2019-10-02 14:54:01,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:54:01,975 INFO L225 Difference]: With dead ends: 596995 [2019-10-02 14:54:01,976 INFO L226 Difference]: Without dead ends: 416457 [2019-10-02 14:54:02,166 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:54:02,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416457 states. [2019-10-02 14:54:40,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416457 to 269929. [2019-10-02 14:54:40,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269929 states. [2019-10-02 14:54:41,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269929 states to 269929 states and 393434 transitions. [2019-10-02 14:54:41,290 INFO L78 Accepts]: Start accepts. Automaton has 269929 states and 393434 transitions. Word has length 178 [2019-10-02 14:54:41,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:54:41,290 INFO L475 AbstractCegarLoop]: Abstraction has 269929 states and 393434 transitions. [2019-10-02 14:54:41,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:54:41,290 INFO L276 IsEmpty]: Start isEmpty. Operand 269929 states and 393434 transitions. [2019-10-02 14:54:41,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 14:54:41,322 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:54:41,322 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:54:41,323 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:54:41,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:54:41,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1242603885, now seen corresponding path program 1 times [2019-10-02 14:54:41,323 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:54:41,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:54:41,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:54:41,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:54:41,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:54:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:54:43,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:54:43,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:54:43,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2019-10-02 14:54:43,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 14:54:43,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 14:54:43,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2019-10-02 14:54:43,143 INFO L87 Difference]: Start difference. First operand 269929 states and 393434 transitions. Second operand 29 states. [2019-10-02 14:54:43,780 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-10-02 14:54:43,958 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-10-02 14:54:44,242 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-10-02 14:54:44,445 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-10-02 14:54:45,246 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-10-02 14:54:45,460 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-10-02 14:55:47,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:55:47,017 INFO L93 Difference]: Finished difference Result 566035 states and 833751 transitions. [2019-10-02 14:55:47,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 14:55:47,017 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 178 [2019-10-02 14:55:47,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:55:47,782 INFO L225 Difference]: With dead ends: 566035 [2019-10-02 14:55:47,782 INFO L226 Difference]: Without dead ends: 432332 [2019-10-02 14:55:47,924 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=444, Invalid=1812, Unknown=0, NotChecked=0, Total=2256 [2019-10-02 14:55:48,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432332 states. [2019-10-02 14:56:36,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432332 to 315284. [2019-10-02 14:56:36,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315284 states. [2019-10-02 14:56:37,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315284 states to 315284 states and 459813 transitions. [2019-10-02 14:56:37,103 INFO L78 Accepts]: Start accepts. Automaton has 315284 states and 459813 transitions. Word has length 178 [2019-10-02 14:56:37,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:37,104 INFO L475 AbstractCegarLoop]: Abstraction has 315284 states and 459813 transitions. [2019-10-02 14:56:37,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 14:56:37,104 INFO L276 IsEmpty]: Start isEmpty. Operand 315284 states and 459813 transitions. [2019-10-02 14:56:37,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 14:56:37,135 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:37,135 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:56:37,136 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:37,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:37,136 INFO L82 PathProgramCache]: Analyzing trace with hash -432423841, now seen corresponding path program 1 times [2019-10-02 14:56:37,136 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:37,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:37,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:37,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:37,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:37,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:37,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:37,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:37,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 14:56:37,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:56:37,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:56:37,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:56:37,337 INFO L87 Difference]: Start difference. First operand 315284 states and 459813 transitions. Second operand 8 states. [2019-10-02 14:57:47,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:47,069 INFO L93 Difference]: Finished difference Result 628498 states and 923163 transitions. [2019-10-02 14:57:47,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:57:47,367 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 178 [2019-10-02 14:57:47,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:48,229 INFO L225 Difference]: With dead ends: 628498 [2019-10-02 14:57:48,229 INFO L226 Difference]: Without dead ends: 504296 [2019-10-02 14:57:48,388 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:57:48,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504296 states. [2019-10-02 14:58:49,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504296 to 399791. [2019-10-02 14:58:49,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399791 states. [2019-10-02 14:58:49,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399791 states to 399791 states and 583276 transitions. [2019-10-02 14:58:49,801 INFO L78 Accepts]: Start accepts. Automaton has 399791 states and 583276 transitions. Word has length 178 [2019-10-02 14:58:49,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:49,802 INFO L475 AbstractCegarLoop]: Abstraction has 399791 states and 583276 transitions. [2019-10-02 14:58:49,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:58:49,802 INFO L276 IsEmpty]: Start isEmpty. Operand 399791 states and 583276 transitions. [2019-10-02 14:58:49,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 14:58:49,853 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:49,853 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:58:49,854 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:49,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:49,854 INFO L82 PathProgramCache]: Analyzing trace with hash 464171816, now seen corresponding path program 1 times [2019-10-02 14:58:49,854 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:49,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:49,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:49,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:49,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:49,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:58:49,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:49,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:58:49,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:58:49,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:58:49,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:58:49,999 INFO L87 Difference]: Start difference. First operand 399791 states and 583276 transitions. Second operand 5 states. [2019-10-02 15:00:18,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:18,437 INFO L93 Difference]: Finished difference Result 716756 states and 1056226 transitions. [2019-10-02 15:00:18,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 15:00:18,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2019-10-02 15:00:18,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:19,455 INFO L225 Difference]: With dead ends: 716756 [2019-10-02 15:00:19,456 INFO L226 Difference]: Without dead ends: 620054 [2019-10-02 15:00:19,624 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-02 15:00:20,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620054 states.