java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:50:53,358 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:50:53,361 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:50:53,374 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:50:53,374 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:50:53,375 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:50:53,376 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:50:53,378 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:50:53,380 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:50:53,380 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:50:53,381 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:50:53,383 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:50:53,383 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:50:53,384 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:50:53,385 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:50:53,386 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:50:53,387 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:50:53,387 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:50:53,389 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:50:53,391 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:50:53,393 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:50:53,394 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:50:53,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:50:53,396 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:50:53,398 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:50:53,398 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:50:53,399 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:50:53,399 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:50:53,400 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:50:53,401 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:50:53,401 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:50:53,402 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:50:53,402 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:50:53,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:50:53,404 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:50:53,404 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:50:53,405 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:50:53,405 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:50:53,406 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:50:53,406 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:50:53,407 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:50:53,408 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 12:50:53,428 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:50:53,428 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:50:53,430 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:50:53,430 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:50:53,430 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:50:53,430 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:50:53,431 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:50:53,431 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:50:53,431 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:50:53,431 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:50:53,432 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:50:53,432 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:50:53,432 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:50:53,433 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:50:53,433 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:50:53,433 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:50:53,433 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:50:53,434 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:50:53,434 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:50:53,434 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:50:53,434 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:50:53,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:50:53,435 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:50:53,435 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:50:53,435 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:50:53,436 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:50:53,436 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:50:53,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:50:53,436 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:50:53,486 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:50:53,503 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:50:53,507 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:50:53,508 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:50:53,509 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:50:53,510 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 12:50:53,570 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4008edc6/156d56d4aacb4940948dde12bf7a4958/FLAGef2588e73 [2019-09-08 12:50:54,086 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:50:54,087 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 12:50:54,111 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4008edc6/156d56d4aacb4940948dde12bf7a4958/FLAGef2588e73 [2019-09-08 12:50:54,366 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4008edc6/156d56d4aacb4940948dde12bf7a4958 [2019-09-08 12:50:54,379 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:50:54,380 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:50:54,381 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:50:54,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:50:54,385 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:50:54,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:50:54" (1/1) ... [2019-09-08 12:50:54,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@afc897f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:50:54, skipping insertion in model container [2019-09-08 12:50:54,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:50:54" (1/1) ... [2019-09-08 12:50:54,395 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:50:54,465 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:50:54,962 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:50:54,986 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:50:55,120 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:50:55,145 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:50:55,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:50:55 WrapperNode [2019-09-08 12:50:55,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:50:55,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:50:55,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:50:55,147 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:50:55,157 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:50:55" (1/1) ... [2019-09-08 12:50:55,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:50:55" (1/1) ... [2019-09-08 12:50:55,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:50:55" (1/1) ... [2019-09-08 12:50:55,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:50:55" (1/1) ... [2019-09-08 12:50:55,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:50:55" (1/1) ... [2019-09-08 12:50:55,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:50:55" (1/1) ... [2019-09-08 12:50:55,222 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:50:55" (1/1) ... [2019-09-08 12:50:55,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:50:55,229 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:50:55,229 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:50:55,230 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:50:55,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:50:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:50:55,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:50:55,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:50:55,316 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:50:55,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:50:55,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:50:55,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:50:55,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 12:50:55,318 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:50:55,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:50:55,318 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:50:55,318 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:50:55,319 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:50:55,319 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:50:55,320 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:50:55,321 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:50:55,321 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:50:55,323 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:50:55,324 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-08 12:50:55,324 INFO L130 BoogieDeclarations]: Found specification of procedure node8 [2019-09-08 12:50:55,324 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:50:55,324 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:50:55,325 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:50:55,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:50:55,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:50:56,572 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:50:56,572 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:50:56,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:50:56 BoogieIcfgContainer [2019-09-08 12:50:56,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:50:56,576 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:50:56,576 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:50:56,579 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:50:56,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:50:54" (1/3) ... [2019-09-08 12:50:56,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25cb36f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:50:56, skipping insertion in model container [2019-09-08 12:50:56,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:50:55" (2/3) ... [2019-09-08 12:50:56,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25cb36f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:50:56, skipping insertion in model container [2019-09-08 12:50:56,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:50:56" (3/3) ... [2019-09-08 12:50:56,586 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 12:50:56,597 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:50:56,620 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:50:56,637 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:50:56,671 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:50:56,671 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:50:56,671 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:50:56,671 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:50:56,672 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:50:56,672 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:50:56,672 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:50:56,672 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:50:56,672 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:50:56,698 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-09-08 12:50:56,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 12:50:56,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:56,712 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:50:56,714 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:56,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:56,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1507923580, now seen corresponding path program 1 times [2019-09-08 12:50:56,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:56,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:56,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:56,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:56,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:57,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:50:57,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:57,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:50:57,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:50:57,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:50:57,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:50:57,363 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-09-08 12:50:57,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:57,551 INFO L93 Difference]: Finished difference Result 453 states and 755 transitions. [2019-09-08 12:50:57,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:50:57,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-08 12:50:57,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:57,572 INFO L225 Difference]: With dead ends: 453 [2019-09-08 12:50:57,572 INFO L226 Difference]: Without dead ends: 350 [2019-09-08 12:50:57,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:50:57,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-09-08 12:50:57,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 348. [2019-09-08 12:50:57,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-09-08 12:50:57,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 499 transitions. [2019-09-08 12:50:57,697 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 499 transitions. Word has length 128 [2019-09-08 12:50:57,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:57,699 INFO L475 AbstractCegarLoop]: Abstraction has 348 states and 499 transitions. [2019-09-08 12:50:57,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:50:57,699 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 499 transitions. [2019-09-08 12:50:57,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 12:50:57,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:57,710 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:50:57,710 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:57,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:57,711 INFO L82 PathProgramCache]: Analyzing trace with hash -2036693343, now seen corresponding path program 1 times [2019-09-08 12:50:57,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:57,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:57,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:57,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:57,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:58,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:50:58,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:58,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:50:58,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:50:58,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:50:58,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:50:58,084 INFO L87 Difference]: Start difference. First operand 348 states and 499 transitions. Second operand 5 states. [2019-09-08 12:50:58,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:58,531 INFO L93 Difference]: Finished difference Result 858 states and 1296 transitions. [2019-09-08 12:50:58,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:50:58,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-09-08 12:50:58,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:58,536 INFO L225 Difference]: With dead ends: 858 [2019-09-08 12:50:58,536 INFO L226 Difference]: Without dead ends: 581 [2019-09-08 12:50:58,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:50:58,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2019-09-08 12:50:58,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 579. [2019-09-08 12:50:58,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-09-08 12:50:58,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 865 transitions. [2019-09-08 12:50:58,573 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 865 transitions. Word has length 130 [2019-09-08 12:50:58,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:58,574 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 865 transitions. [2019-09-08 12:50:58,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:50:58,574 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 865 transitions. [2019-09-08 12:50:58,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 12:50:58,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:58,576 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:50:58,577 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:58,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:58,580 INFO L82 PathProgramCache]: Analyzing trace with hash -603628053, now seen corresponding path program 1 times [2019-09-08 12:50:58,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:58,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:58,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:58,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:58,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:58,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:50:58,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:58,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:50:58,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:50:58,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:50:58,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:50:58,765 INFO L87 Difference]: Start difference. First operand 579 states and 865 transitions. Second operand 5 states. [2019-09-08 12:50:59,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:59,049 INFO L93 Difference]: Finished difference Result 1059 states and 1624 transitions. [2019-09-08 12:50:59,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:50:59,051 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 131 [2019-09-08 12:50:59,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:59,057 INFO L225 Difference]: With dead ends: 1059 [2019-09-08 12:50:59,057 INFO L226 Difference]: Without dead ends: 579 [2019-09-08 12:50:59,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:50:59,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-09-08 12:50:59,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-09-08 12:50:59,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-09-08 12:50:59,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 860 transitions. [2019-09-08 12:50:59,101 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 860 transitions. Word has length 131 [2019-09-08 12:50:59,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:59,102 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 860 transitions. [2019-09-08 12:50:59,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:50:59,103 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 860 transitions. [2019-09-08 12:50:59,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 12:50:59,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:59,105 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:50:59,105 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:59,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:59,106 INFO L82 PathProgramCache]: Analyzing trace with hash -894619088, now seen corresponding path program 1 times [2019-09-08 12:50:59,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:59,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:59,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:59,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:59,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:59,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:50:59,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:59,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:50:59,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:50:59,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:50:59,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:50:59,282 INFO L87 Difference]: Start difference. First operand 579 states and 860 transitions. Second operand 5 states. [2019-09-08 12:50:59,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:59,555 INFO L93 Difference]: Finished difference Result 1083 states and 1644 transitions. [2019-09-08 12:50:59,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:50:59,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2019-09-08 12:50:59,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:59,561 INFO L225 Difference]: With dead ends: 1083 [2019-09-08 12:50:59,562 INFO L226 Difference]: Without dead ends: 579 [2019-09-08 12:50:59,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:50:59,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-09-08 12:50:59,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-09-08 12:50:59,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-09-08 12:50:59,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 855 transitions. [2019-09-08 12:50:59,601 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 855 transitions. Word has length 132 [2019-09-08 12:50:59,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:59,601 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 855 transitions. [2019-09-08 12:50:59,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:50:59,601 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 855 transitions. [2019-09-08 12:50:59,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 12:50:59,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:59,604 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:50:59,604 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:59,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:59,604 INFO L82 PathProgramCache]: Analyzing trace with hash 95427819, now seen corresponding path program 1 times [2019-09-08 12:50:59,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:59,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:59,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:59,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:59,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:59,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:50:59,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:59,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:50:59,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:50:59,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:50:59,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:50:59,757 INFO L87 Difference]: Start difference. First operand 579 states and 855 transitions. Second operand 5 states. [2019-09-08 12:51:00,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:00,008 INFO L93 Difference]: Finished difference Result 1063 states and 1610 transitions. [2019-09-08 12:51:00,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:51:00,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-09-08 12:51:00,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:00,012 INFO L225 Difference]: With dead ends: 1063 [2019-09-08 12:51:00,012 INFO L226 Difference]: Without dead ends: 579 [2019-09-08 12:51:00,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:51:00,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-09-08 12:51:00,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-09-08 12:51:00,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-09-08 12:51:00,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 850 transitions. [2019-09-08 12:51:00,044 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 850 transitions. Word has length 133 [2019-09-08 12:51:00,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:00,045 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 850 transitions. [2019-09-08 12:51:00,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:51:00,045 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 850 transitions. [2019-09-08 12:51:00,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:51:00,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:00,047 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:00,047 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:00,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:00,048 INFO L82 PathProgramCache]: Analyzing trace with hash 952733183, now seen corresponding path program 1 times [2019-09-08 12:51:00,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:00,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:00,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:00,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:00,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:00,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:00,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:00,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:51:00,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:51:00,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:51:00,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:51:00,174 INFO L87 Difference]: Start difference. First operand 579 states and 850 transitions. Second operand 5 states. [2019-09-08 12:51:00,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:00,445 INFO L93 Difference]: Finished difference Result 1075 states and 1615 transitions. [2019-09-08 12:51:00,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:51:00,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2019-09-08 12:51:00,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:00,450 INFO L225 Difference]: With dead ends: 1075 [2019-09-08 12:51:00,450 INFO L226 Difference]: Without dead ends: 579 [2019-09-08 12:51:00,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:51:00,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-09-08 12:51:00,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-09-08 12:51:00,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-09-08 12:51:00,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 845 transitions. [2019-09-08 12:51:00,489 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 845 transitions. Word has length 134 [2019-09-08 12:51:00,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:00,490 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 845 transitions. [2019-09-08 12:51:00,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:51:00,490 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 845 transitions. [2019-09-08 12:51:00,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:51:00,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:00,492 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:00,492 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:00,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:00,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1075246054, now seen corresponding path program 1 times [2019-09-08 12:51:00,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:00,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:00,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:00,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:00,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:00,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:00,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:00,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:51:00,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:51:00,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:51:00,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:51:00,611 INFO L87 Difference]: Start difference. First operand 579 states and 845 transitions. Second operand 5 states. [2019-09-08 12:51:00,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:00,853 INFO L93 Difference]: Finished difference Result 1071 states and 1601 transitions. [2019-09-08 12:51:00,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:51:00,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-09-08 12:51:00,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:00,857 INFO L225 Difference]: With dead ends: 1071 [2019-09-08 12:51:00,857 INFO L226 Difference]: Without dead ends: 579 [2019-09-08 12:51:00,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:51:00,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-09-08 12:51:00,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-09-08 12:51:00,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-09-08 12:51:00,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 840 transitions. [2019-09-08 12:51:00,896 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 840 transitions. Word has length 135 [2019-09-08 12:51:00,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:00,896 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 840 transitions. [2019-09-08 12:51:00,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:51:00,896 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 840 transitions. [2019-09-08 12:51:00,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 12:51:00,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:00,898 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:00,899 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:00,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:00,899 INFO L82 PathProgramCache]: Analyzing trace with hash -402862384, now seen corresponding path program 1 times [2019-09-08 12:51:00,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:00,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:00,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:00,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:00,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:01,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:01,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:01,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:51:01,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:51:01,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:51:01,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:51:01,039 INFO L87 Difference]: Start difference. First operand 579 states and 840 transitions. Second operand 5 states. [2019-09-08 12:51:01,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:01,295 INFO L93 Difference]: Finished difference Result 1079 states and 1600 transitions. [2019-09-08 12:51:01,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:51:01,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2019-09-08 12:51:01,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:01,300 INFO L225 Difference]: With dead ends: 1079 [2019-09-08 12:51:01,301 INFO L226 Difference]: Without dead ends: 579 [2019-09-08 12:51:01,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:51:01,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-09-08 12:51:01,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-09-08 12:51:01,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-09-08 12:51:01,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 835 transitions. [2019-09-08 12:51:01,351 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 835 transitions. Word has length 136 [2019-09-08 12:51:01,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:01,352 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 835 transitions. [2019-09-08 12:51:01,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:51:01,352 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 835 transitions. [2019-09-08 12:51:01,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:51:01,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:01,354 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:01,354 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:01,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:01,355 INFO L82 PathProgramCache]: Analyzing trace with hash 133489020, now seen corresponding path program 1 times [2019-09-08 12:51:01,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:01,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:01,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:01,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:01,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:01,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:01,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:01,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:51:01,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:51:01,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:51:01,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:51:01,504 INFO L87 Difference]: Start difference. First operand 579 states and 835 transitions. Second operand 5 states. [2019-09-08 12:51:01,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:01,763 INFO L93 Difference]: Finished difference Result 1067 states and 1578 transitions. [2019-09-08 12:51:01,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:51:01,764 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2019-09-08 12:51:01,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:01,767 INFO L225 Difference]: With dead ends: 1067 [2019-09-08 12:51:01,767 INFO L226 Difference]: Without dead ends: 579 [2019-09-08 12:51:01,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:51:01,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-09-08 12:51:01,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-09-08 12:51:01,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-09-08 12:51:01,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 830 transitions. [2019-09-08 12:51:01,812 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 830 transitions. Word has length 137 [2019-09-08 12:51:01,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:01,812 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 830 transitions. [2019-09-08 12:51:01,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:51:01,813 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 830 transitions. [2019-09-08 12:51:01,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 12:51:01,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:01,815 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:01,815 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:01,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:01,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1696593501, now seen corresponding path program 1 times [2019-09-08 12:51:01,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:01,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:01,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:01,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:01,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:02,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:02,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:02,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:51:02,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:51:02,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:51:02,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:51:02,153 INFO L87 Difference]: Start difference. First operand 579 states and 830 transitions. Second operand 10 states. [2019-09-08 12:51:02,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:02,851 INFO L93 Difference]: Finished difference Result 3671 states and 5506 transitions. [2019-09-08 12:51:02,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 12:51:02,852 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 138 [2019-09-08 12:51:02,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:02,868 INFO L225 Difference]: With dead ends: 3671 [2019-09-08 12:51:02,868 INFO L226 Difference]: Without dead ends: 3321 [2019-09-08 12:51:02,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:51:02,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3321 states. [2019-09-08 12:51:02,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3321 to 752. [2019-09-08 12:51:02,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2019-09-08 12:51:02,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1093 transitions. [2019-09-08 12:51:02,998 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1093 transitions. Word has length 138 [2019-09-08 12:51:02,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:02,998 INFO L475 AbstractCegarLoop]: Abstraction has 752 states and 1093 transitions. [2019-09-08 12:51:02,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:51:02,998 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1093 transitions. [2019-09-08 12:51:03,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 12:51:03,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:03,000 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:03,001 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:03,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:03,001 INFO L82 PathProgramCache]: Analyzing trace with hash 770003406, now seen corresponding path program 1 times [2019-09-08 12:51:03,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:03,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:03,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:03,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:03,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:03,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:03,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:03,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:51:03,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:51:03,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:51:03,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:51:03,141 INFO L87 Difference]: Start difference. First operand 752 states and 1093 transitions. Second operand 5 states. [2019-09-08 12:51:03,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:03,570 INFO L93 Difference]: Finished difference Result 2414 states and 3614 transitions. [2019-09-08 12:51:03,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:51:03,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-09-08 12:51:03,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:03,585 INFO L225 Difference]: With dead ends: 2414 [2019-09-08 12:51:03,585 INFO L226 Difference]: Without dead ends: 1886 [2019-09-08 12:51:03,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:51:03,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2019-09-08 12:51:03,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1754. [2019-09-08 12:51:03,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1754 states. [2019-09-08 12:51:03,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 2619 transitions. [2019-09-08 12:51:03,926 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 2619 transitions. Word has length 138 [2019-09-08 12:51:03,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:03,926 INFO L475 AbstractCegarLoop]: Abstraction has 1754 states and 2619 transitions. [2019-09-08 12:51:03,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:51:03,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 2619 transitions. [2019-09-08 12:51:03,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 12:51:03,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:03,929 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:03,930 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:03,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:03,930 INFO L82 PathProgramCache]: Analyzing trace with hash -285171100, now seen corresponding path program 1 times [2019-09-08 12:51:03,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:03,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:03,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:03,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:03,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:04,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:04,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:04,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:51:04,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:51:04,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:51:04,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:51:04,082 INFO L87 Difference]: Start difference. First operand 1754 states and 2619 transitions. Second operand 5 states. [2019-09-08 12:51:04,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:04,504 INFO L93 Difference]: Finished difference Result 3906 states and 5877 transitions. [2019-09-08 12:51:04,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:51:04,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-09-08 12:51:04,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:04,517 INFO L225 Difference]: With dead ends: 3906 [2019-09-08 12:51:04,518 INFO L226 Difference]: Without dead ends: 2852 [2019-09-08 12:51:04,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:51:04,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2019-09-08 12:51:04,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2320. [2019-09-08 12:51:04,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2320 states. [2019-09-08 12:51:04,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 3482 transitions. [2019-09-08 12:51:04,828 INFO L78 Accepts]: Start accepts. Automaton has 2320 states and 3482 transitions. Word has length 138 [2019-09-08 12:51:04,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:04,828 INFO L475 AbstractCegarLoop]: Abstraction has 2320 states and 3482 transitions. [2019-09-08 12:51:04,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:51:04,829 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 3482 transitions. [2019-09-08 12:51:04,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 12:51:04,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:04,831 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:04,831 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:04,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:04,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1169624369, now seen corresponding path program 1 times [2019-09-08 12:51:04,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:04,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:04,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:04,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:04,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:04,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:04,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:04,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:51:04,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:51:04,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:51:04,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:51:04,982 INFO L87 Difference]: Start difference. First operand 2320 states and 3482 transitions. Second operand 5 states. [2019-09-08 12:51:05,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:05,479 INFO L93 Difference]: Finished difference Result 4956 states and 7477 transitions. [2019-09-08 12:51:05,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:51:05,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-09-08 12:51:05,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:05,497 INFO L225 Difference]: With dead ends: 4956 [2019-09-08 12:51:05,497 INFO L226 Difference]: Without dead ends: 3368 [2019-09-08 12:51:05,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:51:05,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3368 states. [2019-09-08 12:51:05,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3368 to 2876. [2019-09-08 12:51:05,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2876 states. [2019-09-08 12:51:05,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 4329 transitions. [2019-09-08 12:51:05,944 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 4329 transitions. Word has length 138 [2019-09-08 12:51:05,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:05,945 INFO L475 AbstractCegarLoop]: Abstraction has 2876 states and 4329 transitions. [2019-09-08 12:51:05,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:51:05,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 4329 transitions. [2019-09-08 12:51:05,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 12:51:05,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:05,948 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:05,948 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:05,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:05,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1895946469, now seen corresponding path program 1 times [2019-09-08 12:51:05,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:05,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:05,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:05,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:05,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:06,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:06,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:06,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:51:06,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:51:06,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:51:06,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:51:06,093 INFO L87 Difference]: Start difference. First operand 2876 states and 4329 transitions. Second operand 5 states. [2019-09-08 12:51:06,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:06,699 INFO L93 Difference]: Finished difference Result 5768 states and 8714 transitions. [2019-09-08 12:51:06,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:51:06,699 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-09-08 12:51:06,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:06,718 INFO L225 Difference]: With dead ends: 5768 [2019-09-08 12:51:06,718 INFO L226 Difference]: Without dead ends: 3646 [2019-09-08 12:51:06,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:51:06,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3646 states. [2019-09-08 12:51:07,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3646 to 3234. [2019-09-08 12:51:07,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3234 states. [2019-09-08 12:51:07,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 4873 transitions. [2019-09-08 12:51:07,117 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 4873 transitions. Word has length 138 [2019-09-08 12:51:07,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:07,117 INFO L475 AbstractCegarLoop]: Abstraction has 3234 states and 4873 transitions. [2019-09-08 12:51:07,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:51:07,117 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 4873 transitions. [2019-09-08 12:51:07,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 12:51:07,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:07,120 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:07,120 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:07,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:07,121 INFO L82 PathProgramCache]: Analyzing trace with hash -81695263, now seen corresponding path program 1 times [2019-09-08 12:51:07,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:07,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:07,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:07,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:07,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:07,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:07,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:07,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:07,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:51:07,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:51:07,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:51:07,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:51:07,247 INFO L87 Difference]: Start difference. First operand 3234 states and 4873 transitions. Second operand 5 states. [2019-09-08 12:51:07,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:07,900 INFO L93 Difference]: Finished difference Result 6440 states and 9738 transitions. [2019-09-08 12:51:07,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:51:07,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-09-08 12:51:07,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:07,920 INFO L225 Difference]: With dead ends: 6440 [2019-09-08 12:51:07,920 INFO L226 Difference]: Without dead ends: 3962 [2019-09-08 12:51:07,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:51:07,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3962 states. [2019-09-08 12:51:08,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3962 to 3590. [2019-09-08 12:51:08,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3590 states. [2019-09-08 12:51:08,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3590 states to 3590 states and 5415 transitions. [2019-09-08 12:51:08,387 INFO L78 Accepts]: Start accepts. Automaton has 3590 states and 5415 transitions. Word has length 138 [2019-09-08 12:51:08,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:08,387 INFO L475 AbstractCegarLoop]: Abstraction has 3590 states and 5415 transitions. [2019-09-08 12:51:08,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:51:08,387 INFO L276 IsEmpty]: Start isEmpty. Operand 3590 states and 5415 transitions. [2019-09-08 12:51:08,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 12:51:08,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:08,391 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:08,391 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:08,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:08,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1932326251, now seen corresponding path program 1 times [2019-09-08 12:51:08,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:08,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:08,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:08,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:08,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:08,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:08,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:08,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:51:08,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:51:08,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:51:08,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:51:08,481 INFO L87 Difference]: Start difference. First operand 3590 states and 5415 transitions. Second operand 3 states. [2019-09-08 12:51:09,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:09,431 INFO L93 Difference]: Finished difference Result 9738 states and 14685 transitions. [2019-09-08 12:51:09,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:51:09,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-08 12:51:09,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:09,457 INFO L225 Difference]: With dead ends: 9738 [2019-09-08 12:51:09,457 INFO L226 Difference]: Without dead ends: 6548 [2019-09-08 12:51:09,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:51:09,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6548 states. [2019-09-08 12:51:10,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6548 to 6474. [2019-09-08 12:51:10,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6474 states. [2019-09-08 12:51:10,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6474 states to 6474 states and 9665 transitions. [2019-09-08 12:51:10,160 INFO L78 Accepts]: Start accepts. Automaton has 6474 states and 9665 transitions. Word has length 138 [2019-09-08 12:51:10,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:10,161 INFO L475 AbstractCegarLoop]: Abstraction has 6474 states and 9665 transitions. [2019-09-08 12:51:10,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:51:10,161 INFO L276 IsEmpty]: Start isEmpty. Operand 6474 states and 9665 transitions. [2019-09-08 12:51:10,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 12:51:10,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:10,164 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:10,164 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:10,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:10,165 INFO L82 PathProgramCache]: Analyzing trace with hash -2083290838, now seen corresponding path program 1 times [2019-09-08 12:51:10,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:10,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:10,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:10,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:10,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:10,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:10,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:10,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:51:10,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:51:10,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:51:10,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:51:10,252 INFO L87 Difference]: Start difference. First operand 6474 states and 9665 transitions. Second operand 3 states. [2019-09-08 12:51:10,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:10,891 INFO L93 Difference]: Finished difference Result 12550 states and 18763 transitions. [2019-09-08 12:51:10,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:51:10,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-08 12:51:10,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:10,906 INFO L225 Difference]: With dead ends: 12550 [2019-09-08 12:51:10,906 INFO L226 Difference]: Without dead ends: 6476 [2019-09-08 12:51:10,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:51:10,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6476 states. [2019-09-08 12:51:11,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6476 to 6474. [2019-09-08 12:51:11,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6474 states. [2019-09-08 12:51:11,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6474 states to 6474 states and 9653 transitions. [2019-09-08 12:51:11,570 INFO L78 Accepts]: Start accepts. Automaton has 6474 states and 9653 transitions. Word has length 138 [2019-09-08 12:51:11,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:11,570 INFO L475 AbstractCegarLoop]: Abstraction has 6474 states and 9653 transitions. [2019-09-08 12:51:11,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:51:11,570 INFO L276 IsEmpty]: Start isEmpty. Operand 6474 states and 9653 transitions. [2019-09-08 12:51:11,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 12:51:11,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:11,572 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:11,572 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:11,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:11,573 INFO L82 PathProgramCache]: Analyzing trace with hash -128883718, now seen corresponding path program 1 times [2019-09-08 12:51:11,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:11,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:11,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:11,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:11,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:11,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:11,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:11,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:51:11,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:51:11,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:51:11,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:51:11,700 INFO L87 Difference]: Start difference. First operand 6474 states and 9653 transitions. Second operand 5 states. [2019-09-08 12:51:12,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:12,536 INFO L93 Difference]: Finished difference Result 13426 states and 20042 transitions. [2019-09-08 12:51:12,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:51:12,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-09-08 12:51:12,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:12,553 INFO L225 Difference]: With dead ends: 13426 [2019-09-08 12:51:12,554 INFO L226 Difference]: Without dead ends: 8030 [2019-09-08 12:51:12,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:51:12,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8030 states. [2019-09-08 12:51:13,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8030 to 7162. [2019-09-08 12:51:13,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7162 states. [2019-09-08 12:51:13,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7162 states to 7162 states and 10683 transitions. [2019-09-08 12:51:13,301 INFO L78 Accepts]: Start accepts. Automaton has 7162 states and 10683 transitions. Word has length 138 [2019-09-08 12:51:13,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:13,302 INFO L475 AbstractCegarLoop]: Abstraction has 7162 states and 10683 transitions. [2019-09-08 12:51:13,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:51:13,302 INFO L276 IsEmpty]: Start isEmpty. Operand 7162 states and 10683 transitions. [2019-09-08 12:51:13,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 12:51:13,304 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:13,304 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:13,304 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:13,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:13,305 INFO L82 PathProgramCache]: Analyzing trace with hash -90574265, now seen corresponding path program 1 times [2019-09-08 12:51:13,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:13,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:13,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:13,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:13,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:13,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:13,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:13,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:51:13,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:51:13,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:51:13,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:51:13,580 INFO L87 Difference]: Start difference. First operand 7162 states and 10683 transitions. Second operand 10 states. [2019-09-08 12:51:15,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:15,955 INFO L93 Difference]: Finished difference Result 27365 states and 40903 transitions. [2019-09-08 12:51:15,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 12:51:15,956 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 138 [2019-09-08 12:51:15,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:15,994 INFO L225 Difference]: With dead ends: 27365 [2019-09-08 12:51:15,994 INFO L226 Difference]: Without dead ends: 21293 [2019-09-08 12:51:16,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:51:16,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21293 states. [2019-09-08 12:51:17,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21293 to 8217. [2019-09-08 12:51:17,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8217 states. [2019-09-08 12:51:17,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8217 states to 8217 states and 12259 transitions. [2019-09-08 12:51:17,181 INFO L78 Accepts]: Start accepts. Automaton has 8217 states and 12259 transitions. Word has length 138 [2019-09-08 12:51:17,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:17,181 INFO L475 AbstractCegarLoop]: Abstraction has 8217 states and 12259 transitions. [2019-09-08 12:51:17,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:51:17,182 INFO L276 IsEmpty]: Start isEmpty. Operand 8217 states and 12259 transitions. [2019-09-08 12:51:17,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 12:51:17,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:17,184 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:17,184 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:17,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:17,185 INFO L82 PathProgramCache]: Analyzing trace with hash 41492491, now seen corresponding path program 1 times [2019-09-08 12:51:17,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:17,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:17,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:17,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:17,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:17,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:17,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:17,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:51:17,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:51:17,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:51:17,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:51:17,539 INFO L87 Difference]: Start difference. First operand 8217 states and 12259 transitions. Second operand 9 states. [2019-09-08 12:51:19,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:19,962 INFO L93 Difference]: Finished difference Result 23902 states and 35722 transitions. [2019-09-08 12:51:19,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 12:51:19,962 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 139 [2019-09-08 12:51:19,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:19,987 INFO L225 Difference]: With dead ends: 23902 [2019-09-08 12:51:19,988 INFO L226 Difference]: Without dead ends: 15985 [2019-09-08 12:51:20,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:51:20,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15985 states. [2019-09-08 12:51:21,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15985 to 8217. [2019-09-08 12:51:21,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8217 states. [2019-09-08 12:51:21,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8217 states to 8217 states and 12258 transitions. [2019-09-08 12:51:21,766 INFO L78 Accepts]: Start accepts. Automaton has 8217 states and 12258 transitions. Word has length 139 [2019-09-08 12:51:21,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:21,766 INFO L475 AbstractCegarLoop]: Abstraction has 8217 states and 12258 transitions. [2019-09-08 12:51:21,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:51:21,766 INFO L276 IsEmpty]: Start isEmpty. Operand 8217 states and 12258 transitions. [2019-09-08 12:51:21,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 12:51:21,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:21,768 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:21,768 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:21,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:21,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1381047467, now seen corresponding path program 1 times [2019-09-08 12:51:21,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:21,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:21,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:21,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:21,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:22,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:22,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:22,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:51:22,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:51:22,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:51:22,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:51:22,052 INFO L87 Difference]: Start difference. First operand 8217 states and 12258 transitions. Second operand 10 states. [2019-09-08 12:51:24,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:24,874 INFO L93 Difference]: Finished difference Result 24399 states and 36392 transitions. [2019-09-08 12:51:24,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:51:24,875 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-09-08 12:51:24,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:24,904 INFO L225 Difference]: With dead ends: 24399 [2019-09-08 12:51:24,905 INFO L226 Difference]: Without dead ends: 16394 [2019-09-08 12:51:24,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:51:24,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16394 states. [2019-09-08 12:51:26,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16394 to 8217. [2019-09-08 12:51:26,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8217 states. [2019-09-08 12:51:26,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8217 states to 8217 states and 12252 transitions. [2019-09-08 12:51:26,118 INFO L78 Accepts]: Start accepts. Automaton has 8217 states and 12252 transitions. Word has length 140 [2019-09-08 12:51:26,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:26,119 INFO L475 AbstractCegarLoop]: Abstraction has 8217 states and 12252 transitions. [2019-09-08 12:51:26,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:51:26,119 INFO L276 IsEmpty]: Start isEmpty. Operand 8217 states and 12252 transitions. [2019-09-08 12:51:26,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 12:51:26,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:26,121 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:26,121 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:26,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:26,121 INFO L82 PathProgramCache]: Analyzing trace with hash 520469796, now seen corresponding path program 1 times [2019-09-08 12:51:26,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:26,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:26,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:26,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:26,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:26,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:26,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:26,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:51:26,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:51:26,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:51:26,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:51:26,405 INFO L87 Difference]: Start difference. First operand 8217 states and 12252 transitions. Second operand 10 states. [2019-09-08 12:51:29,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:29,774 INFO L93 Difference]: Finished difference Result 23732 states and 35357 transitions. [2019-09-08 12:51:29,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:51:29,776 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-09-08 12:51:29,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:29,800 INFO L225 Difference]: With dead ends: 23732 [2019-09-08 12:51:29,800 INFO L226 Difference]: Without dead ends: 15739 [2019-09-08 12:51:29,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2019-09-08 12:51:29,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15739 states. [2019-09-08 12:51:31,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15739 to 8217. [2019-09-08 12:51:31,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8217 states. [2019-09-08 12:51:31,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8217 states to 8217 states and 12249 transitions. [2019-09-08 12:51:31,098 INFO L78 Accepts]: Start accepts. Automaton has 8217 states and 12249 transitions. Word has length 140 [2019-09-08 12:51:31,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:31,099 INFO L475 AbstractCegarLoop]: Abstraction has 8217 states and 12249 transitions. [2019-09-08 12:51:31,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:51:31,099 INFO L276 IsEmpty]: Start isEmpty. Operand 8217 states and 12249 transitions. [2019-09-08 12:51:31,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 12:51:31,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:31,102 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:31,103 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:31,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:31,103 INFO L82 PathProgramCache]: Analyzing trace with hash -137813890, now seen corresponding path program 1 times [2019-09-08 12:51:31,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:31,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:31,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:31,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:31,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:31,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:31,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:31,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:51:31,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:51:31,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:51:31,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:51:31,394 INFO L87 Difference]: Start difference. First operand 8217 states and 12249 transitions. Second operand 10 states. [2019-09-08 12:51:34,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:34,534 INFO L93 Difference]: Finished difference Result 24381 states and 36353 transitions. [2019-09-08 12:51:34,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:51:34,534 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 141 [2019-09-08 12:51:34,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:34,550 INFO L225 Difference]: With dead ends: 24381 [2019-09-08 12:51:34,551 INFO L226 Difference]: Without dead ends: 16406 [2019-09-08 12:51:34,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:51:34,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16406 states. [2019-09-08 12:51:35,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16406 to 8217. [2019-09-08 12:51:35,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8217 states. [2019-09-08 12:51:35,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8217 states to 8217 states and 12239 transitions. [2019-09-08 12:51:35,715 INFO L78 Accepts]: Start accepts. Automaton has 8217 states and 12239 transitions. Word has length 141 [2019-09-08 12:51:35,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:35,716 INFO L475 AbstractCegarLoop]: Abstraction has 8217 states and 12239 transitions. [2019-09-08 12:51:35,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:51:35,716 INFO L276 IsEmpty]: Start isEmpty. Operand 8217 states and 12239 transitions. [2019-09-08 12:51:35,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 12:51:35,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:35,718 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:35,719 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:35,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:35,719 INFO L82 PathProgramCache]: Analyzing trace with hash 280658806, now seen corresponding path program 1 times [2019-09-08 12:51:35,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:35,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:35,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:35,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:35,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:36,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:36,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:36,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:51:36,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:51:36,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:51:36,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:51:36,007 INFO L87 Difference]: Start difference. First operand 8217 states and 12239 transitions. Second operand 10 states. [2019-09-08 12:51:39,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:39,568 INFO L93 Difference]: Finished difference Result 24301 states and 36215 transitions. [2019-09-08 12:51:39,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:51:39,568 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 142 [2019-09-08 12:51:39,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:39,585 INFO L225 Difference]: With dead ends: 24301 [2019-09-08 12:51:39,586 INFO L226 Difference]: Without dead ends: 16376 [2019-09-08 12:51:39,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:51:39,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16376 states. [2019-09-08 12:51:40,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16376 to 8217. [2019-09-08 12:51:40,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8217 states. [2019-09-08 12:51:40,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8217 states to 8217 states and 12226 transitions. [2019-09-08 12:51:40,916 INFO L78 Accepts]: Start accepts. Automaton has 8217 states and 12226 transitions. Word has length 142 [2019-09-08 12:51:40,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:40,916 INFO L475 AbstractCegarLoop]: Abstraction has 8217 states and 12226 transitions. [2019-09-08 12:51:40,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:51:40,916 INFO L276 IsEmpty]: Start isEmpty. Operand 8217 states and 12226 transitions. [2019-09-08 12:51:40,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 12:51:40,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:40,919 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:40,919 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:40,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:40,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1276470156, now seen corresponding path program 1 times [2019-09-08 12:51:40,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:40,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:40,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:40,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:40,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:41,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:41,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:41,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:51:41,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:51:41,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:51:41,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:51:41,178 INFO L87 Difference]: Start difference. First operand 8217 states and 12226 transitions. Second operand 10 states. [2019-09-08 12:51:45,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:45,271 INFO L93 Difference]: Finished difference Result 24186 states and 36018 transitions. [2019-09-08 12:51:45,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:51:45,271 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 143 [2019-09-08 12:51:45,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:45,289 INFO L225 Difference]: With dead ends: 24186 [2019-09-08 12:51:45,290 INFO L226 Difference]: Without dead ends: 16326 [2019-09-08 12:51:45,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:51:45,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16326 states. [2019-09-08 12:51:46,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16326 to 8217. [2019-09-08 12:51:46,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8217 states. [2019-09-08 12:51:46,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8217 states to 8217 states and 12211 transitions. [2019-09-08 12:51:46,617 INFO L78 Accepts]: Start accepts. Automaton has 8217 states and 12211 transitions. Word has length 143 [2019-09-08 12:51:46,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:46,617 INFO L475 AbstractCegarLoop]: Abstraction has 8217 states and 12211 transitions. [2019-09-08 12:51:46,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:51:46,617 INFO L276 IsEmpty]: Start isEmpty. Operand 8217 states and 12211 transitions. [2019-09-08 12:51:46,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 12:51:46,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:46,620 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:46,620 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:46,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:46,620 INFO L82 PathProgramCache]: Analyzing trace with hash -168650880, now seen corresponding path program 1 times [2019-09-08 12:51:46,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:46,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:46,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:46,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:46,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:46,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:46,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:46,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:51:46,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:51:46,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:51:46,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:51:46,870 INFO L87 Difference]: Start difference. First operand 8217 states and 12211 transitions. Second operand 10 states. [2019-09-08 12:51:51,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:51,656 INFO L93 Difference]: Finished difference Result 24046 states and 35779 transitions. [2019-09-08 12:51:51,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:51:51,656 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 144 [2019-09-08 12:51:51,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:51,674 INFO L225 Difference]: With dead ends: 24046 [2019-09-08 12:51:51,674 INFO L226 Difference]: Without dead ends: 16261 [2019-09-08 12:51:51,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:51:51,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16261 states. [2019-09-08 12:51:53,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16261 to 8217. [2019-09-08 12:51:53,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8217 states. [2019-09-08 12:51:53,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8217 states to 8217 states and 12194 transitions. [2019-09-08 12:51:53,193 INFO L78 Accepts]: Start accepts. Automaton has 8217 states and 12194 transitions. Word has length 144 [2019-09-08 12:51:53,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:53,193 INFO L475 AbstractCegarLoop]: Abstraction has 8217 states and 12194 transitions. [2019-09-08 12:51:53,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:51:53,193 INFO L276 IsEmpty]: Start isEmpty. Operand 8217 states and 12194 transitions. [2019-09-08 12:51:53,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 12:51:53,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:53,196 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:53,196 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:53,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:53,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1276940182, now seen corresponding path program 1 times [2019-09-08 12:51:53,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:53,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:53,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:53,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:53,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:53,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:53,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:53,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:51:53,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:51:53,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:51:53,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:51:53,458 INFO L87 Difference]: Start difference. First operand 8217 states and 12194 transitions. Second operand 10 states. [2019-09-08 12:52:00,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:52:00,866 INFO L93 Difference]: Finished difference Result 38490 states and 57043 transitions. [2019-09-08 12:52:00,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:52:00,867 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 145 [2019-09-08 12:52:00,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:52:00,898 INFO L225 Difference]: With dead ends: 38490 [2019-09-08 12:52:00,898 INFO L226 Difference]: Without dead ends: 30722 [2019-09-08 12:52:00,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2019-09-08 12:52:00,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30722 states. [2019-09-08 12:52:02,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30722 to 8274. [2019-09-08 12:52:02,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8274 states. [2019-09-08 12:52:02,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8274 states to 8274 states and 12270 transitions. [2019-09-08 12:52:02,525 INFO L78 Accepts]: Start accepts. Automaton has 8274 states and 12270 transitions. Word has length 145 [2019-09-08 12:52:02,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:52:02,526 INFO L475 AbstractCegarLoop]: Abstraction has 8274 states and 12270 transitions. [2019-09-08 12:52:02,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:52:02,526 INFO L276 IsEmpty]: Start isEmpty. Operand 8274 states and 12270 transitions. [2019-09-08 12:52:02,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:52:02,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:52:02,529 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:52:02,529 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:52:02,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:52:02,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1580759111, now seen corresponding path program 1 times [2019-09-08 12:52:02,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:52:02,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:52:02,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:02,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:52:02,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:52:03,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:52:03,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:52:03,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:52:03,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:52:03,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:52:03,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:52:03,553 INFO L87 Difference]: Start difference. First operand 8274 states and 12270 transitions. Second operand 17 states. [2019-09-08 12:52:04,187 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-08 12:52:04,359 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-08 12:52:04,607 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2019-09-08 12:52:04,786 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-08 12:52:04,968 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-08 12:52:05,119 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-08 12:52:05,331 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-08 12:52:05,552 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-08 12:52:12,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:52:12,785 INFO L93 Difference]: Finished difference Result 39764 states and 59337 transitions. [2019-09-08 12:52:12,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:52:12,785 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 146 [2019-09-08 12:52:12,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:52:12,821 INFO L225 Difference]: With dead ends: 39764 [2019-09-08 12:52:12,821 INFO L226 Difference]: Without dead ends: 32932 [2019-09-08 12:52:12,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=248, Invalid=808, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 12:52:12,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32932 states. [2019-09-08 12:52:14,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32932 to 8269. [2019-09-08 12:52:14,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8269 states. [2019-09-08 12:52:14,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8269 states to 8269 states and 12261 transitions. [2019-09-08 12:52:14,866 INFO L78 Accepts]: Start accepts. Automaton has 8269 states and 12261 transitions. Word has length 146 [2019-09-08 12:52:14,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:52:14,866 INFO L475 AbstractCegarLoop]: Abstraction has 8269 states and 12261 transitions. [2019-09-08 12:52:14,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:52:14,866 INFO L276 IsEmpty]: Start isEmpty. Operand 8269 states and 12261 transitions. [2019-09-08 12:52:14,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:52:14,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:52:14,868 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:52:14,869 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:52:14,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:52:14,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1709272328, now seen corresponding path program 1 times [2019-09-08 12:52:14,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:52:14,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:52:14,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:14,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:52:14,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:52:16,167 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-08 12:52:16,316 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-08 12:52:16,473 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-08 12:52:16,639 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-08 12:52:16,818 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-08 12:52:17,020 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-09-08 12:52:17,335 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-09-08 12:52:17,586 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 81 [2019-09-08 12:52:18,030 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-09-08 12:52:18,316 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2019-09-08 12:52:22,580 WARN L188 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-09-08 12:52:22,870 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 86 [2019-09-08 12:52:27,877 WARN L188 SmtUtils]: Spent 4.89 s on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-09-08 12:52:30,389 WARN L188 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-08 12:52:30,699 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2019-09-08 12:52:35,473 WARN L188 SmtUtils]: Spent 4.66 s on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2019-09-08 12:52:35,706 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-09-08 12:52:38,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:52:38,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:52:38,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2019-09-08 12:52:38,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-08 12:52:38,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-08 12:52:38,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=2117, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 12:52:38,439 INFO L87 Difference]: Start difference. First operand 8269 states and 12261 transitions. Second operand 48 states. [2019-09-08 12:52:38,820 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 75 [2019-09-08 12:52:40,267 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-08 12:52:40,494 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-08 12:52:40,737 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-09-08 12:52:41,018 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-08 12:52:41,304 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-09-08 12:52:41,623 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-09-08 12:52:41,963 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-09-08 12:52:42,974 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-09-08 12:52:44,107 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-09-08 12:52:44,772 WARN L188 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2019-09-08 12:52:45,590 WARN L188 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 134 [2019-09-08 12:52:46,673 WARN L188 SmtUtils]: Spent 875.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 153 [2019-09-08 12:52:47,932 WARN L188 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 204 DAG size of output: 169 [2019-09-08 12:52:49,278 WARN L188 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 215 DAG size of output: 177 [2019-09-08 12:52:50,760 WARN L188 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 232 DAG size of output: 188 [2019-09-08 12:52:52,357 WARN L188 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 249 DAG size of output: 200 [2019-09-08 12:52:54,218 WARN L188 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 273 DAG size of output: 226 [2019-09-08 12:52:59,404 WARN L188 SmtUtils]: Spent 2.87 s on a formula simplification. DAG size of input: 289 DAG size of output: 240 [2019-09-08 12:53:14,776 WARN L188 SmtUtils]: Spent 15.09 s on a formula simplification. DAG size of input: 319 DAG size of output: 269 [2019-09-08 12:53:35,815 WARN L188 SmtUtils]: Spent 20.78 s on a formula simplification. DAG size of input: 346 DAG size of output: 294 [2019-09-08 12:54:07,898 WARN L188 SmtUtils]: Spent 31.79 s on a formula simplification. DAG size of input: 360 DAG size of output: 308 [2019-09-08 12:54:08,474 WARN L188 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 118 [2019-09-08 12:54:09,024 WARN L188 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 118 [2019-09-08 12:54:09,545 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 94 [2019-09-08 12:54:09,966 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-09-08 12:54:10,337 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2019-09-08 12:54:10,658 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-09-08 12:54:11,161 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2019-09-08 12:54:11,676 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-09-08 12:54:12,429 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-09-08 12:54:12,989 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-09-08 12:54:13,477 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2019-09-08 12:54:14,310 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 112 [2019-09-08 12:54:14,615 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2019-09-08 12:54:15,771 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-09-08 12:54:16,569 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-09-08 12:54:17,695 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-09-08 12:54:18,749 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-09-08 12:54:20,186 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-09-08 12:54:21,458 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-09-08 12:54:52,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:52,542 INFO L93 Difference]: Finished difference Result 44127 states and 65662 transitions. [2019-09-08 12:54:52,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-08 12:54:52,542 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 146 [2019-09-08 12:54:52,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:52,583 INFO L225 Difference]: With dead ends: 44127 [2019-09-08 12:54:52,583 INFO L226 Difference]: Without dead ends: 38055 [2019-09-08 12:54:52,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1657 ImplicationChecksByTransitivity, 115.1s TimeCoverageRelationStatistics Valid=1404, Invalid=8297, Unknown=1, NotChecked=0, Total=9702 [2019-09-08 12:54:52,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38055 states. [2019-09-08 12:54:55,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38055 to 8326. [2019-09-08 12:54:55,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8326 states. [2019-09-08 12:54:55,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8326 states to 8326 states and 12338 transitions. [2019-09-08 12:54:55,222 INFO L78 Accepts]: Start accepts. Automaton has 8326 states and 12338 transitions. Word has length 146 [2019-09-08 12:54:55,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:55,222 INFO L475 AbstractCegarLoop]: Abstraction has 8326 states and 12338 transitions. [2019-09-08 12:54:55,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-08 12:54:55,222 INFO L276 IsEmpty]: Start isEmpty. Operand 8326 states and 12338 transitions. [2019-09-08 12:54:55,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:54:55,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:55,225 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:54:55,225 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:55,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:55,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1849626936, now seen corresponding path program 1 times [2019-09-08 12:54:55,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:55,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:55,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:55,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:55,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:55,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:55,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:55,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:54:55,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:54:55,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:54:55,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:55,317 INFO L87 Difference]: Start difference. First operand 8326 states and 12338 transitions. Second operand 3 states. [2019-09-08 12:54:59,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:59,922 INFO L93 Difference]: Finished difference Result 23494 states and 35108 transitions. [2019-09-08 12:54:59,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:54:59,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-09-08 12:54:59,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:59,943 INFO L225 Difference]: With dead ends: 23494 [2019-09-08 12:54:59,944 INFO L226 Difference]: Without dead ends: 15726 [2019-09-08 12:54:59,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:59,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15726 states. [2019-09-08 12:55:04,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15726 to 15356. [2019-09-08 12:55:04,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15356 states. [2019-09-08 12:55:04,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15356 states to 15356 states and 22735 transitions. [2019-09-08 12:55:04,330 INFO L78 Accepts]: Start accepts. Automaton has 15356 states and 22735 transitions. Word has length 146 [2019-09-08 12:55:04,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:04,331 INFO L475 AbstractCegarLoop]: Abstraction has 15356 states and 22735 transitions. [2019-09-08 12:55:04,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:55:04,331 INFO L276 IsEmpty]: Start isEmpty. Operand 15356 states and 22735 transitions. [2019-09-08 12:55:04,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:55:04,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:04,333 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:55:04,333 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:04,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:04,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1322981754, now seen corresponding path program 1 times [2019-09-08 12:55:04,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:04,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:04,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:04,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:04,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:05,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:55:05,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:55:05,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 12:55:05,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 12:55:05,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 12:55:05,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:55:05,417 INFO L87 Difference]: Start difference. First operand 15356 states and 22735 transitions. Second operand 19 states. [2019-09-08 12:55:06,250 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-09-08 12:55:06,470 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2019-09-08 12:55:06,781 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-08 12:55:07,114 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 88 [2019-09-08 12:55:07,296 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-08 12:55:07,742 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-08 12:55:08,064 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 12:55:08,254 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-08 12:55:08,541 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-08 12:55:34,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:55:34,536 INFO L93 Difference]: Finished difference Result 91684 states and 136309 transitions. [2019-09-08 12:55:34,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:55:34,536 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 146 [2019-09-08 12:55:34,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:55:34,620 INFO L225 Difference]: With dead ends: 91684 [2019-09-08 12:55:34,621 INFO L226 Difference]: Without dead ends: 80088 [2019-09-08 12:55:34,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=312, Invalid=1170, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 12:55:34,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80088 states. [2019-09-08 12:55:39,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80088 to 15374. [2019-09-08 12:55:39,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15374 states. [2019-09-08 12:55:39,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15374 states to 15374 states and 22747 transitions. [2019-09-08 12:55:39,997 INFO L78 Accepts]: Start accepts. Automaton has 15374 states and 22747 transitions. Word has length 146 [2019-09-08 12:55:39,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:39,997 INFO L475 AbstractCegarLoop]: Abstraction has 15374 states and 22747 transitions. [2019-09-08 12:55:39,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 12:55:39,998 INFO L276 IsEmpty]: Start isEmpty. Operand 15374 states and 22747 transitions. [2019-09-08 12:55:39,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:55:39,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:39,999 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:55:39,999 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:40,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:40,000 INFO L82 PathProgramCache]: Analyzing trace with hash -763063941, now seen corresponding path program 1 times [2019-09-08 12:55:40,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:40,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:40,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:40,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:40,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:41,307 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-08 12:55:41,614 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-09-08 12:55:42,000 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-09-08 12:55:42,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:55:42,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:55:42,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-08 12:55:42,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 12:55:42,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 12:55:42,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:55:42,996 INFO L87 Difference]: Start difference. First operand 15374 states and 22747 transitions. Second operand 31 states. [2019-09-08 12:55:43,155 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 39 [2019-09-08 12:55:43,994 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-09-08 12:55:44,331 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 41 [2019-09-08 12:55:44,992 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-08 12:55:45,312 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-09-08 12:55:45,730 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-08 12:55:46,250 WARN L188 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 102 [2019-09-08 12:55:46,893 WARN L188 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 122 [2019-09-08 12:55:47,613 WARN L188 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 133 [2019-09-08 12:55:48,475 WARN L188 SmtUtils]: Spent 768.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 159 [2019-09-08 12:55:49,414 WARN L188 SmtUtils]: Spent 857.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 172 [2019-09-08 12:55:49,730 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-09-08 12:55:49,948 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-09-08 12:55:50,410 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-09-08 12:55:50,933 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2019-09-08 12:55:51,234 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-09-08 12:55:51,696 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-09-08 12:55:52,320 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-09-08 12:55:52,975 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-09-08 12:55:53,685 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-09-08 12:55:54,214 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-09-08 12:56:26,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:26,595 INFO L93 Difference]: Finished difference Result 94720 states and 140721 transitions. [2019-09-08 12:56:26,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 12:56:26,596 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 146 [2019-09-08 12:56:26,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:26,679 INFO L225 Difference]: With dead ends: 94720 [2019-09-08 12:56:26,679 INFO L226 Difference]: Without dead ends: 81777 [2019-09-08 12:56:26,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=770, Invalid=3390, Unknown=0, NotChecked=0, Total=4160 [2019-09-08 12:56:26,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81777 states. [2019-09-08 12:56:33,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81777 to 15419. [2019-09-08 12:56:33,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15419 states. [2019-09-08 12:56:33,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15419 states to 15419 states and 22798 transitions. [2019-09-08 12:56:33,861 INFO L78 Accepts]: Start accepts. Automaton has 15419 states and 22798 transitions. Word has length 146 [2019-09-08 12:56:33,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:33,861 INFO L475 AbstractCegarLoop]: Abstraction has 15419 states and 22798 transitions. [2019-09-08 12:56:33,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 12:56:33,861 INFO L276 IsEmpty]: Start isEmpty. Operand 15419 states and 22798 transitions. [2019-09-08 12:56:33,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:56:33,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:33,863 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:56:33,863 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:33,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:33,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1501026150, now seen corresponding path program 1 times [2019-09-08 12:56:33,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:33,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:33,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:33,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:33,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:34,464 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-09-08 12:56:35,053 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-08 12:56:35,215 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-08 12:56:35,395 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-08 12:56:35,587 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 12:56:35,807 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-08 12:56:36,006 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-08 12:56:36,275 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2019-09-08 12:56:36,482 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-08 12:56:36,724 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-08 12:56:36,959 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-09-08 12:56:37,222 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-09-08 12:56:37,466 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-09-08 12:56:37,753 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-09-08 12:56:37,983 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-09-08 12:56:38,226 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2019-09-08 12:56:38,467 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-09-08 12:56:38,694 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-09-08 12:56:41,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:56:41,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:41,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2019-09-08 12:56:41,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-08 12:56:41,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-08 12:56:41,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2115, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 12:56:41,404 INFO L87 Difference]: Start difference. First operand 15419 states and 22798 transitions. Second operand 48 states. [2019-09-08 12:56:41,713 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-09-08 12:56:43,192 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-08 12:56:43,390 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-08 12:56:43,616 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-08 12:56:43,858 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-08 12:56:44,144 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-08 12:56:44,434 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-08 12:56:44,738 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-08 12:56:46,107 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-09-08 12:56:46,592 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-09-08 12:56:47,073 WARN L188 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-08 12:56:47,726 WARN L188 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 110 [2019-09-08 12:56:48,424 WARN L188 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 118 [2019-09-08 12:56:49,291 WARN L188 SmtUtils]: Spent 717.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 134 [2019-09-08 12:56:50,241 WARN L188 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 143 [2019-09-08 12:56:51,413 WARN L188 SmtUtils]: Spent 997.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 160 [2019-09-08 12:56:52,594 WARN L188 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 204 DAG size of output: 170 [2019-09-08 12:56:53,975 WARN L188 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 225 DAG size of output: 189 [2019-09-08 12:56:55,444 WARN L188 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 237 DAG size of output: 198 [2019-09-08 12:56:57,188 WARN L188 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 262 DAG size of output: 216 [2019-09-08 12:56:59,064 WARN L188 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 283 DAG size of output: 236 [2019-09-08 12:57:01,159 WARN L188 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 306 DAG size of output: 258 [2019-09-08 12:57:01,684 WARN L188 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 109 [2019-09-08 12:57:02,199 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 109 [2019-09-08 12:57:02,495 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-09-08 12:57:03,003 WARN L188 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 106 [2019-09-08 12:57:03,238 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-08 12:57:03,468 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-09-08 12:57:03,962 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 106 [2019-09-08 12:57:04,434 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-09-08 12:57:04,862 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-09-08 12:57:11,652 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-09-08 12:57:45,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:45,965 INFO L93 Difference]: Finished difference Result 69087 states and 102370 transitions. [2019-09-08 12:57:45,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-08 12:57:45,966 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 146 [2019-09-08 12:57:45,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:46,030 INFO L225 Difference]: With dead ends: 69087 [2019-09-08 12:57:46,030 INFO L226 Difference]: Without dead ends: 57521 [2019-09-08 12:57:46,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1303 ImplicationChecksByTransitivity, 28.3s TimeCoverageRelationStatistics Valid=1371, Invalid=7371, Unknown=0, NotChecked=0, Total=8742 [2019-09-08 12:57:46,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57521 states. [2019-09-08 12:57:52,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57521 to 15570. [2019-09-08 12:57:52,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15570 states. [2019-09-08 12:57:52,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15570 states to 15570 states and 22993 transitions. [2019-09-08 12:57:52,801 INFO L78 Accepts]: Start accepts. Automaton has 15570 states and 22993 transitions. Word has length 146 [2019-09-08 12:57:52,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:52,801 INFO L475 AbstractCegarLoop]: Abstraction has 15570 states and 22993 transitions. [2019-09-08 12:57:52,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-08 12:57:52,802 INFO L276 IsEmpty]: Start isEmpty. Operand 15570 states and 22993 transitions. [2019-09-08 12:57:52,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:57:52,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:52,804 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:57:52,804 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:52,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:52,804 INFO L82 PathProgramCache]: Analyzing trace with hash -632394695, now seen corresponding path program 1 times [2019-09-08 12:57:52,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:52,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:52,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:52,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:52,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:53,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:57:53,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:53,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 12:57:53,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 12:57:53,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 12:57:53,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:57:53,948 INFO L87 Difference]: Start difference. First operand 15570 states and 22993 transitions. Second operand 19 states. [2019-09-08 12:57:54,607 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-09-08 12:57:54,822 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-08 12:57:55,138 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 85 [2019-09-08 12:57:55,602 WARN L188 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 90 [2019-09-08 12:57:55,787 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-08 12:57:55,950 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-09-08 12:57:56,229 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-08 12:57:56,506 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-08 12:57:56,747 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:57:57,044 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:58:33,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:33,157 INFO L93 Difference]: Finished difference Result 92174 states and 136899 transitions. [2019-09-08 12:58:33,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:58:33,158 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 146 [2019-09-08 12:58:33,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:33,246 INFO L225 Difference]: With dead ends: 92174 [2019-09-08 12:58:33,247 INFO L226 Difference]: Without dead ends: 80481 [2019-09-08 12:58:33,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:58:33,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80481 states. [2019-09-08 12:58:40,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80481 to 15525. [2019-09-08 12:58:40,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15525 states. [2019-09-08 12:58:40,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15525 states to 15525 states and 22922 transitions. [2019-09-08 12:58:40,839 INFO L78 Accepts]: Start accepts. Automaton has 15525 states and 22922 transitions. Word has length 146 [2019-09-08 12:58:40,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:40,839 INFO L475 AbstractCegarLoop]: Abstraction has 15525 states and 22922 transitions. [2019-09-08 12:58:40,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 12:58:40,839 INFO L276 IsEmpty]: Start isEmpty. Operand 15525 states and 22922 transitions. [2019-09-08 12:58:40,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:58:40,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:40,841 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:40,841 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:40,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:40,842 INFO L82 PathProgramCache]: Analyzing trace with hash -496113447, now seen corresponding path program 1 times [2019-09-08 12:58:40,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:40,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:40,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:40,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:40,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:41,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:58:41,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:41,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 12:58:41,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 12:58:41,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 12:58:41,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:58:41,892 INFO L87 Difference]: Start difference. First operand 15525 states and 22922 transitions. Second operand 19 states. [2019-09-08 12:58:42,585 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-09-08 12:58:42,784 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-08 12:58:43,089 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-09-08 12:58:43,414 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2019-09-08 12:58:43,606 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-08 12:58:44,001 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-08 12:58:44,266 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-08 12:59:08,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:59:08,671 INFO L93 Difference]: Finished difference Result 56433 states and 83706 transitions. [2019-09-08 12:59:08,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 12:59:08,671 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 146 [2019-09-08 12:59:08,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:59:08,725 INFO L225 Difference]: With dead ends: 56433 [2019-09-08 12:59:08,725 INFO L226 Difference]: Without dead ends: 49834 [2019-09-08 12:59:08,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=236, Invalid=954, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 12:59:08,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49834 states. [2019-09-08 12:59:17,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49834 to 15457. [2019-09-08 12:59:17,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15457 states. [2019-09-08 12:59:17,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15457 states to 15457 states and 22830 transitions. [2019-09-08 12:59:17,515 INFO L78 Accepts]: Start accepts. Automaton has 15457 states and 22830 transitions. Word has length 146 [2019-09-08 12:59:17,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:59:17,515 INFO L475 AbstractCegarLoop]: Abstraction has 15457 states and 22830 transitions. [2019-09-08 12:59:17,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 12:59:17,516 INFO L276 IsEmpty]: Start isEmpty. Operand 15457 states and 22830 transitions. [2019-09-08 12:59:17,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 12:59:17,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:59:17,517 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:59:17,517 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:59:17,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:59:17,518 INFO L82 PathProgramCache]: Analyzing trace with hash -841502904, now seen corresponding path program 1 times [2019-09-08 12:59:17,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:59:17,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:59:17,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:17,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:59:17,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:18,689 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-08 12:59:18,835 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-08 12:59:19,018 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 12:59:19,212 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-08 12:59:19,384 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-08 12:59:19,596 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2019-09-08 12:59:19,777 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-08 12:59:19,984 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-09-08 12:59:20,151 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-09-08 12:59:20,341 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-08 12:59:21,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:59:21,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:59:21,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2019-09-08 12:59:21,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-08 12:59:21,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-08 12:59:21,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1225, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:59:21,788 INFO L87 Difference]: Start difference. First operand 15457 states and 22830 transitions. Second operand 37 states. [2019-09-08 12:59:21,996 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-09-08 12:59:22,971 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2019-09-08 12:59:23,159 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-09-08 12:59:23,376 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-09-08 12:59:23,993 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2019-09-08 12:59:24,716 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2019-09-08 12:59:25,095 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 82 [2019-09-08 12:59:25,637 WARN L188 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 100 [2019-09-08 12:59:26,233 WARN L188 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 111 [2019-09-08 12:59:26,986 WARN L188 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 125 [2019-09-08 12:59:27,772 WARN L188 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 136 [2019-09-08 12:59:28,776 WARN L188 SmtUtils]: Spent 858.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 156 [2019-09-08 12:59:29,859 WARN L188 SmtUtils]: Spent 970.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 167 [2019-09-08 12:59:31,198 WARN L188 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 228 DAG size of output: 193 [2019-09-08 12:59:32,686 WARN L188 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 242 DAG size of output: 206 [2019-09-08 12:59:33,126 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 85 [2019-09-08 12:59:33,452 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 72 [2019-09-08 12:59:34,010 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 78 [2019-09-08 12:59:34,592 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 76 [2019-09-08 12:59:35,148 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2019-09-08 12:59:35,726 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2019-09-08 12:59:36,652 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 70 [2019-09-08 12:59:37,379 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 70 [2019-09-08 13:00:16,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:00:16,409 INFO L93 Difference]: Finished difference Result 74807 states and 110975 transitions. [2019-09-08 13:00:16,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-08 13:00:16,410 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 147 [2019-09-08 13:00:16,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:00:16,479 INFO L225 Difference]: With dead ends: 74807 [2019-09-08 13:00:16,479 INFO L226 Difference]: Without dead ends: 63241 [2019-09-08 13:00:16,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=889, Invalid=4081, Unknown=0, NotChecked=0, Total=4970 [2019-09-08 13:00:16,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63241 states. [2019-09-08 13:00:25,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63241 to 15511. [2019-09-08 13:00:25,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15511 states. [2019-09-08 13:00:25,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15511 states to 15511 states and 22893 transitions. [2019-09-08 13:00:25,115 INFO L78 Accepts]: Start accepts. Automaton has 15511 states and 22893 transitions. Word has length 147 [2019-09-08 13:00:25,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:00:25,115 INFO L475 AbstractCegarLoop]: Abstraction has 15511 states and 22893 transitions. [2019-09-08 13:00:25,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-08 13:00:25,115 INFO L276 IsEmpty]: Start isEmpty. Operand 15511 states and 22893 transitions. [2019-09-08 13:00:25,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 13:00:25,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:00:25,117 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:00:25,117 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:00:25,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:00:25,117 INFO L82 PathProgramCache]: Analyzing trace with hash 104705483, now seen corresponding path program 1 times [2019-09-08 13:00:25,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:00:25,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:00:25,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:25,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:00:25,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:00:26,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:00:26,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:00:26,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 13:00:26,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 13:00:26,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 13:00:26,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-09-08 13:00:26,185 INFO L87 Difference]: Start difference. First operand 15511 states and 22893 transitions. Second operand 19 states. [2019-09-08 13:00:27,003 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-09-08 13:00:27,235 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-08 13:00:27,569 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2019-09-08 13:00:27,916 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 90 [2019-09-08 13:00:28,109 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-08 13:00:28,323 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-08 13:00:28,676 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 13:00:28,872 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-08 13:00:29,065 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 13:00:29,379 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-08 13:00:29,899 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-08 13:00:58,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:00:58,392 INFO L93 Difference]: Finished difference Result 62452 states and 92652 transitions. [2019-09-08 13:00:58,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 13:00:58,392 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 147 [2019-09-08 13:00:58,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:00:58,449 INFO L225 Difference]: With dead ends: 62452 [2019-09-08 13:00:58,449 INFO L226 Difference]: Without dead ends: 50886 [2019-09-08 13:00:58,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=324, Invalid=1158, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 13:00:58,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50886 states. [2019-09-08 13:01:08,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50886 to 15504. [2019-09-08 13:01:08,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15504 states. [2019-09-08 13:01:08,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15504 states to 15504 states and 22880 transitions. [2019-09-08 13:01:08,627 INFO L78 Accepts]: Start accepts. Automaton has 15504 states and 22880 transitions. Word has length 147 [2019-09-08 13:01:08,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:01:08,628 INFO L475 AbstractCegarLoop]: Abstraction has 15504 states and 22880 transitions. [2019-09-08 13:01:08,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 13:01:08,628 INFO L276 IsEmpty]: Start isEmpty. Operand 15504 states and 22880 transitions. [2019-09-08 13:01:08,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 13:01:08,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:01:08,631 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:01:08,631 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:01:08,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:01:08,631 INFO L82 PathProgramCache]: Analyzing trace with hash 257503598, now seen corresponding path program 1 times [2019-09-08 13:01:08,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:01:08,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:01:08,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:01:08,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:01:08,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:01:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:01:09,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:01:09,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:01:09,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 13:01:09,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 13:01:09,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 13:01:09,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 13:01:09,184 INFO L87 Difference]: Start difference. First operand 15504 states and 22880 transitions. Second operand 11 states. [2019-09-08 13:01:09,626 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-09-08 13:01:09,799 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-08 13:01:09,981 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-08 13:01:10,126 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-08 13:01:10,421 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2019-09-08 13:01:10,549 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 34 [2019-09-08 13:01:45,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:01:45,184 INFO L93 Difference]: Finished difference Result 72791 states and 108173 transitions. [2019-09-08 13:01:45,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 13:01:45,185 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 147 [2019-09-08 13:01:45,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:01:45,249 INFO L225 Difference]: With dead ends: 72791 [2019-09-08 13:01:45,250 INFO L226 Difference]: Without dead ends: 59843 [2019-09-08 13:01:45,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2019-09-08 13:01:45,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59843 states. [2019-09-08 13:01:54,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59843 to 15449. [2019-09-08 13:01:54,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15449 states. [2019-09-08 13:01:54,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15449 states to 15449 states and 22808 transitions. [2019-09-08 13:01:54,629 INFO L78 Accepts]: Start accepts. Automaton has 15449 states and 22808 transitions. Word has length 147 [2019-09-08 13:01:54,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:01:54,629 INFO L475 AbstractCegarLoop]: Abstraction has 15449 states and 22808 transitions. [2019-09-08 13:01:54,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 13:01:54,629 INFO L276 IsEmpty]: Start isEmpty. Operand 15449 states and 22808 transitions. [2019-09-08 13:01:54,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 13:01:54,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:01:54,632 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:01:54,632 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:01:54,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:01:54,632 INFO L82 PathProgramCache]: Analyzing trace with hash 339968070, now seen corresponding path program 1 times [2019-09-08 13:01:54,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:01:54,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:01:54,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:01:54,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:01:54,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:01:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:01:55,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:01:55,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:01:55,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 13:01:55,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 13:01:55,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 13:01:55,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-08 13:01:55,715 INFO L87 Difference]: Start difference. First operand 15449 states and 22808 transitions. Second operand 19 states. [2019-09-08 13:01:56,388 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-08 13:01:56,608 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-08 13:01:56,927 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-08 13:01:57,247 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 89 [2019-09-08 13:01:57,435 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-08 13:01:57,782 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-08 13:01:58,035 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-08 13:01:58,281 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-08 13:01:58,544 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-08 13:02:48,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:02:48,706 INFO L93 Difference]: Finished difference Result 91961 states and 136560 transitions. [2019-09-08 13:02:48,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 13:02:48,706 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 147 [2019-09-08 13:02:48,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:02:48,791 INFO L225 Difference]: With dead ends: 91961 [2019-09-08 13:02:48,791 INFO L226 Difference]: Without dead ends: 80204 [2019-09-08 13:02:48,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 13:02:48,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80204 states. [2019-09-08 13:02:58,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80204 to 15375. [2019-09-08 13:02:58,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15375 states. [2019-09-08 13:02:58,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15375 states to 15375 states and 22706 transitions. [2019-09-08 13:02:58,645 INFO L78 Accepts]: Start accepts. Automaton has 15375 states and 22706 transitions. Word has length 147 [2019-09-08 13:02:58,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:02:58,645 INFO L475 AbstractCegarLoop]: Abstraction has 15375 states and 22706 transitions. [2019-09-08 13:02:58,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 13:02:58,645 INFO L276 IsEmpty]: Start isEmpty. Operand 15375 states and 22706 transitions. [2019-09-08 13:02:58,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 13:02:58,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:02:58,647 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:02:58,647 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:02:58,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:02:58,647 INFO L82 PathProgramCache]: Analyzing trace with hash -401329723, now seen corresponding path program 1 times [2019-09-08 13:02:58,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:02:58,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:02:58,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:58,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:02:58,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:02:59,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:02:59,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:02:59,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 13:02:59,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 13:02:59,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 13:02:59,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-09-08 13:02:59,634 INFO L87 Difference]: Start difference. First operand 15375 states and 22706 transitions. Second operand 16 states. [2019-09-08 13:02:59,837 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-09-08 13:03:00,205 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-08 13:03:00,452 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-08 13:03:00,784 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-08 13:03:00,980 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 31 [2019-09-08 13:03:01,344 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 49 [2019-09-08 13:03:01,685 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 64 [2019-09-08 13:03:02,048 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 64 [2019-09-08 13:03:02,221 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-08 13:03:02,397 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-08 13:03:02,742 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 59 [2019-09-08 13:03:02,884 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-08 13:03:03,285 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 56 [2019-09-08 13:03:03,486 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-09-08 13:03:07,174 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-09-08 13:04:02,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:02,366 INFO L93 Difference]: Finished difference Result 102777 states and 152664 transitions. [2019-09-08 13:04:02,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 13:04:02,367 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 147 [2019-09-08 13:04:02,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:02,461 INFO L225 Difference]: With dead ends: 102777 [2019-09-08 13:04:02,462 INFO L226 Difference]: Without dead ends: 89783 [2019-09-08 13:04:02,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=273, Invalid=917, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 13:04:02,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89783 states. [2019-09-08 13:04:14,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89783 to 15269. [2019-09-08 13:04:14,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15269 states. [2019-09-08 13:04:14,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15269 states to 15269 states and 22572 transitions. [2019-09-08 13:04:14,848 INFO L78 Accepts]: Start accepts. Automaton has 15269 states and 22572 transitions. Word has length 147 [2019-09-08 13:04:14,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:14,848 INFO L475 AbstractCegarLoop]: Abstraction has 15269 states and 22572 transitions. [2019-09-08 13:04:14,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 13:04:14,849 INFO L276 IsEmpty]: Start isEmpty. Operand 15269 states and 22572 transitions. [2019-09-08 13:04:14,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 13:04:14,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:14,851 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:04:14,851 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:14,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:14,851 INFO L82 PathProgramCache]: Analyzing trace with hash -477350258, now seen corresponding path program 1 times [2019-09-08 13:04:14,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:14,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:14,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:14,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:14,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:15,806 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-08 13:04:16,091 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-08 13:04:16,373 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-08 13:04:17,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:04:17,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:17,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2019-09-08 13:04:17,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 13:04:17,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 13:04:17,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2019-09-08 13:04:17,630 INFO L87 Difference]: Start difference. First operand 15269 states and 22572 transitions. Second operand 30 states. [2019-09-08 13:04:19,353 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-08 13:04:19,625 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-08 13:04:19,895 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2019-09-08 13:04:20,289 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2019-09-08 13:04:20,711 WARN L188 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 93 [2019-09-08 13:04:21,272 WARN L188 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 109 [2019-09-08 13:04:21,972 WARN L188 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 128 [2019-09-08 13:04:22,815 WARN L188 SmtUtils]: Spent 739.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 146 [2019-09-08 13:04:23,102 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-09-08 13:04:23,421 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76