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/pals_lcr.8.1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 08:03:13,538 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 08:03:13,540 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 08:03:13,552 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 08:03:13,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 08:03:13,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 08:03:13,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 08:03:13,556 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 08:03:13,558 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 08:03:13,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 08:03:13,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 08:03:13,561 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 08:03:13,561 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 08:03:13,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 08:03:13,563 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 08:03:13,564 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 08:03:13,565 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 08:03:13,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 08:03:13,568 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 08:03:13,570 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 08:03:13,571 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 08:03:13,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 08:03:13,573 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 08:03:13,574 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 08:03:13,576 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 08:03:13,576 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 08:03:13,577 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 08:03:13,577 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 08:03:13,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 08:03:13,579 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 08:03:13,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 08:03:13,580 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 08:03:13,580 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 08:03:13,581 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 08:03:13,582 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 08:03:13,583 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 08:03:13,583 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 08:03:13,583 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 08:03:13,584 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 08:03:13,584 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 08:03:13,585 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 08:03:13,586 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 08:03:13,600 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 08:03:13,600 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 08:03:13,601 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 08:03:13,602 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 08:03:13,602 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 08:03:13,602 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 08:03:13,602 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 08:03:13,602 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 08:03:13,603 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 08:03:13,603 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 08:03:13,603 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 08:03:13,603 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 08:03:13,603 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 08:03:13,603 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 08:03:13,604 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 08:03:13,604 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 08:03:13,604 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 08:03:13,604 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 08:03:13,605 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 08:03:13,605 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 08:03:13,605 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 08:03:13,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 08:03:13,605 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 08:03:13,606 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 08:03:13,606 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 08:03:13,606 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 08:03:13,606 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 08:03:13,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 08:03:13,606 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 08:03:13,634 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 08:03:13,646 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 08:03:13,649 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 08:03:13,650 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 08:03:13,651 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 08:03:13,652 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr.8.1.ufo.UNBOUNDED.pals.c [2019-09-08 08:03:13,711 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b1d2f473/5e0a7e39df93437891b07fa52f10067e/FLAGef16991f8 [2019-09-08 08:03:14,205 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 08:03:14,206 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr.8.1.ufo.UNBOUNDED.pals.c [2019-09-08 08:03:14,224 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b1d2f473/5e0a7e39df93437891b07fa52f10067e/FLAGef16991f8 [2019-09-08 08:03:14,503 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b1d2f473/5e0a7e39df93437891b07fa52f10067e [2019-09-08 08:03:14,513 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 08:03:14,515 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 08:03:14,516 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 08:03:14,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 08:03:14,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 08:03:14,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:03:14" (1/1) ... [2019-09-08 08:03:14,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59ff9303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:03:14, skipping insertion in model container [2019-09-08 08:03:14,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:03:14" (1/1) ... [2019-09-08 08:03:14,530 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 08:03:14,594 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 08:03:15,031 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:03:15,043 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 08:03:15,113 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:03:15,135 INFO L192 MainTranslator]: Completed translation [2019-09-08 08:03:15,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:03:15 WrapperNode [2019-09-08 08:03:15,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 08:03:15,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 08:03:15,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 08:03:15,136 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 08:03:15,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:03:15" (1/1) ... [2019-09-08 08:03:15,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:03:15" (1/1) ... [2019-09-08 08:03:15,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:03:15" (1/1) ... [2019-09-08 08:03:15,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:03:15" (1/1) ... [2019-09-08 08:03:15,182 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:03:15" (1/1) ... [2019-09-08 08:03:15,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:03:15" (1/1) ... [2019-09-08 08:03:15,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:03:15" (1/1) ... [2019-09-08 08:03:15,213 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 08:03:15,214 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 08:03:15,214 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 08:03:15,214 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 08:03:15,220 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:03:15" (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 08:03:15,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 08:03:15,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 08:03:15,274 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-08 08:03:15,275 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-08 08:03:15,276 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-08 08:03:15,276 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-08 08:03:15,276 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-08 08:03:15,276 INFO L138 BoogieDeclarations]: Found implementation of procedure node6 [2019-09-08 08:03:15,277 INFO L138 BoogieDeclarations]: Found implementation of procedure node7 [2019-09-08 08:03:15,277 INFO L138 BoogieDeclarations]: Found implementation of procedure node8 [2019-09-08 08:03:15,278 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 08:03:15,278 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 08:03:15,279 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 08:03:15,279 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 08:03:15,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 08:03:15,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 08:03:15,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 08:03:15,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 08:03:15,283 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 08:03:15,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 08:03:15,283 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 08:03:15,283 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 08:03:15,283 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 08:03:15,284 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 08:03:15,284 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 08:03:15,284 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 08:03:15,284 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 08:03:15,284 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 08:03:15,284 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-08 08:03:15,285 INFO L130 BoogieDeclarations]: Found specification of procedure node8 [2019-09-08 08:03:15,285 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 08:03:15,285 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 08:03:15,285 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 08:03:15,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 08:03:15,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 08:03:16,170 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 08:03:16,170 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 08:03:16,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:03:16 BoogieIcfgContainer [2019-09-08 08:03:16,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 08:03:16,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 08:03:16,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 08:03:16,176 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 08:03:16,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 08:03:14" (1/3) ... [2019-09-08 08:03:16,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a9689f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:03:16, skipping insertion in model container [2019-09-08 08:03:16,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:03:15" (2/3) ... [2019-09-08 08:03:16,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a9689f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:03:16, skipping insertion in model container [2019-09-08 08:03:16,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:03:16" (3/3) ... [2019-09-08 08:03:16,180 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals.c [2019-09-08 08:03:16,193 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 08:03:16,201 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 08:03:16,217 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 08:03:16,254 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 08:03:16,255 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 08:03:16,255 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 08:03:16,255 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 08:03:16,255 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 08:03:16,256 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 08:03:16,256 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 08:03:16,256 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 08:03:16,256 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 08:03:16,280 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states. [2019-09-08 08:03:16,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 08:03:16,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:03:16,292 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] [2019-09-08 08:03:16,295 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:03:16,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:03:16,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1939199710, now seen corresponding path program 1 times [2019-09-08 08:03:16,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:03:16,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:03:16,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:16,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:03:16,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:03:16,795 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 08:03:16,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:03:16,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:03:16,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:03:16,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:03:16,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:03:16,821 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 5 states. [2019-09-08 08:03:16,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:03:16,996 INFO L93 Difference]: Finished difference Result 302 states and 461 transitions. [2019-09-08 08:03:16,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 08:03:16,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-08 08:03:16,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:03:17,010 INFO L225 Difference]: With dead ends: 302 [2019-09-08 08:03:17,011 INFO L226 Difference]: Without dead ends: 183 [2019-09-08 08:03:17,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:03:17,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-08 08:03:17,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2019-09-08 08:03:17,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-08 08:03:17,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 229 transitions. [2019-09-08 08:03:17,071 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 229 transitions. Word has length 82 [2019-09-08 08:03:17,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:03:17,072 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 229 transitions. [2019-09-08 08:03:17,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:03:17,072 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 229 transitions. [2019-09-08 08:03:17,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 08:03:17,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:03:17,078 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 08:03:17,079 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:03:17,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:03:17,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1592771534, now seen corresponding path program 1 times [2019-09-08 08:03:17,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:03:17,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:03:17,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:17,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:03:17,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:03:17,832 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 08:03:17,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:03:17,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 08:03:17,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 08:03:17,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 08:03:17,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2019-09-08 08:03:17,836 INFO L87 Difference]: Start difference. First operand 183 states and 229 transitions. Second operand 19 states. [2019-09-08 08:03:34,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:03:34,440 INFO L93 Difference]: Finished difference Result 2604 states and 4074 transitions. [2019-09-08 08:03:34,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-08 08:03:34,441 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 142 [2019-09-08 08:03:34,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:03:34,474 INFO L225 Difference]: With dead ends: 2604 [2019-09-08 08:03:34,474 INFO L226 Difference]: Without dead ends: 2494 [2019-09-08 08:03:34,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4738 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2532, Invalid=9240, Unknown=0, NotChecked=0, Total=11772 [2019-09-08 08:03:34,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2494 states. [2019-09-08 08:03:34,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2494 to 1301. [2019-09-08 08:03:34,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1301 states. [2019-09-08 08:03:34,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1301 states and 1866 transitions. [2019-09-08 08:03:34,745 INFO L78 Accepts]: Start accepts. Automaton has 1301 states and 1866 transitions. Word has length 142 [2019-09-08 08:03:34,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:03:34,749 INFO L475 AbstractCegarLoop]: Abstraction has 1301 states and 1866 transitions. [2019-09-08 08:03:34,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 08:03:34,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1866 transitions. [2019-09-08 08:03:34,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 08:03:34,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:03:34,765 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 08:03:34,765 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:03:34,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:03:34,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1197298206, now seen corresponding path program 1 times [2019-09-08 08:03:34,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:03:34,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:03:34,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:34,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:03:34,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:03:34,874 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 08:03:34,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:03:34,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 08:03:34,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 08:03:34,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 08:03:34,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 08:03:34,879 INFO L87 Difference]: Start difference. First operand 1301 states and 1866 transitions. Second operand 3 states. [2019-09-08 08:03:35,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:03:35,008 INFO L93 Difference]: Finished difference Result 3689 states and 5374 transitions. [2019-09-08 08:03:35,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 08:03:35,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-09-08 08:03:35,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:03:35,022 INFO L225 Difference]: With dead ends: 3689 [2019-09-08 08:03:35,023 INFO L226 Difference]: Without dead ends: 2461 [2019-09-08 08:03:35,029 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 08:03:35,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2461 states. [2019-09-08 08:03:35,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2461 to 2437. [2019-09-08 08:03:35,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2437 states. [2019-09-08 08:03:35,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2437 states to 2437 states and 3506 transitions. [2019-09-08 08:03:35,233 INFO L78 Accepts]: Start accepts. Automaton has 2437 states and 3506 transitions. Word has length 144 [2019-09-08 08:03:35,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:03:35,234 INFO L475 AbstractCegarLoop]: Abstraction has 2437 states and 3506 transitions. [2019-09-08 08:03:35,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 08:03:35,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 3506 transitions. [2019-09-08 08:03:35,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 08:03:35,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:03:35,239 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 08:03:35,239 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:03:35,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:03:35,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1809966634, now seen corresponding path program 1 times [2019-09-08 08:03:35,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:03:35,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:03:35,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:35,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:03:35,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:03:35,515 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 08:03:35,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:03:35,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:03:35,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:03:35,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:03:35,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:03:35,519 INFO L87 Difference]: Start difference. First operand 2437 states and 3506 transitions. Second operand 5 states. [2019-09-08 08:03:36,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:03:36,494 INFO L93 Difference]: Finished difference Result 7027 states and 10192 transitions. [2019-09-08 08:03:36,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:03:36,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-08 08:03:36,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:03:36,520 INFO L225 Difference]: With dead ends: 7027 [2019-09-08 08:03:36,520 INFO L226 Difference]: Without dead ends: 4663 [2019-09-08 08:03:36,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:03:36,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4663 states. [2019-09-08 08:03:36,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4663 to 4661. [2019-09-08 08:03:36,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4661 states. [2019-09-08 08:03:36,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4661 states to 4661 states and 6694 transitions. [2019-09-08 08:03:36,802 INFO L78 Accepts]: Start accepts. Automaton has 4661 states and 6694 transitions. Word has length 144 [2019-09-08 08:03:36,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:03:36,803 INFO L475 AbstractCegarLoop]: Abstraction has 4661 states and 6694 transitions. [2019-09-08 08:03:36,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:03:36,803 INFO L276 IsEmpty]: Start isEmpty. Operand 4661 states and 6694 transitions. [2019-09-08 08:03:36,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 08:03:36,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:03:36,807 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 08:03:36,807 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:03:36,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:03:36,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1114557792, now seen corresponding path program 1 times [2019-09-08 08:03:36,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:03:36,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:03:36,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:36,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:03:36,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:03:37,036 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 08:03:37,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:03:37,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:03:37,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:03:37,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:03:37,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:03:37,039 INFO L87 Difference]: Start difference. First operand 4661 states and 6694 transitions. Second operand 5 states. [2019-09-08 08:03:38,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:03:38,040 INFO L93 Difference]: Finished difference Result 13549 states and 19568 transitions. [2019-09-08 08:03:38,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:03:38,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-08 08:03:38,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:03:38,108 INFO L225 Difference]: With dead ends: 13549 [2019-09-08 08:03:38,109 INFO L226 Difference]: Without dead ends: 8961 [2019-09-08 08:03:38,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:03:38,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8961 states. [2019-09-08 08:03:38,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8961 to 8959. [2019-09-08 08:03:38,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8959 states. [2019-09-08 08:03:38,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8959 states to 8959 states and 12826 transitions. [2019-09-08 08:03:38,895 INFO L78 Accepts]: Start accepts. Automaton has 8959 states and 12826 transitions. Word has length 144 [2019-09-08 08:03:38,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:03:38,896 INFO L475 AbstractCegarLoop]: Abstraction has 8959 states and 12826 transitions. [2019-09-08 08:03:38,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:03:38,896 INFO L276 IsEmpty]: Start isEmpty. Operand 8959 states and 12826 transitions. [2019-09-08 08:03:38,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 08:03:38,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:03:38,901 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 08:03:38,901 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:03:38,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:03:38,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1829234070, now seen corresponding path program 1 times [2019-09-08 08:03:38,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:03:38,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:03:38,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:38,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:03:38,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:03:39,134 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 08:03:39,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:03:39,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:03:39,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:03:39,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:03:39,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:03:39,137 INFO L87 Difference]: Start difference. First operand 8959 states and 12826 transitions. Second operand 5 states. [2019-09-08 08:03:40,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:03:40,501 INFO L93 Difference]: Finished difference Result 26179 states and 37612 transitions. [2019-09-08 08:03:40,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:03:40,502 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-08 08:03:40,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:03:40,591 INFO L225 Difference]: With dead ends: 26179 [2019-09-08 08:03:40,591 INFO L226 Difference]: Without dead ends: 17293 [2019-09-08 08:03:40,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:03:40,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17293 states. [2019-09-08 08:03:42,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17293 to 17291. [2019-09-08 08:03:42,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17291 states. [2019-09-08 08:03:42,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17291 states to 17291 states and 24626 transitions. [2019-09-08 08:03:42,286 INFO L78 Accepts]: Start accepts. Automaton has 17291 states and 24626 transitions. Word has length 144 [2019-09-08 08:03:42,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:03:42,288 INFO L475 AbstractCegarLoop]: Abstraction has 17291 states and 24626 transitions. [2019-09-08 08:03:42,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:03:42,288 INFO L276 IsEmpty]: Start isEmpty. Operand 17291 states and 24626 transitions. [2019-09-08 08:03:42,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 08:03:42,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:03:42,292 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 08:03:42,292 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:03:42,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:03:42,293 INFO L82 PathProgramCache]: Analyzing trace with hash 642579296, now seen corresponding path program 1 times [2019-09-08 08:03:42,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:03:42,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:03:42,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:42,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:03:42,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:03:42,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:03:42,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:03:42,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:03:42,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:03:42,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:03:42,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:03:42,453 INFO L87 Difference]: Start difference. First operand 17291 states and 24626 transitions. Second operand 5 states. [2019-09-08 08:03:44,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:03:44,135 INFO L93 Difference]: Finished difference Result 50575 states and 72260 transitions. [2019-09-08 08:03:44,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:03:44,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-08 08:03:44,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:03:44,270 INFO L225 Difference]: With dead ends: 50575 [2019-09-08 08:03:44,270 INFO L226 Difference]: Without dead ends: 33357 [2019-09-08 08:03:44,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:03:44,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33357 states. [2019-09-08 08:03:46,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33357 to 33355. [2019-09-08 08:03:46,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33355 states. [2019-09-08 08:03:46,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33355 states to 33355 states and 47242 transitions. [2019-09-08 08:03:46,311 INFO L78 Accepts]: Start accepts. Automaton has 33355 states and 47242 transitions. Word has length 144 [2019-09-08 08:03:46,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:03:46,311 INFO L475 AbstractCegarLoop]: Abstraction has 33355 states and 47242 transitions. [2019-09-08 08:03:46,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:03:46,312 INFO L276 IsEmpty]: Start isEmpty. Operand 33355 states and 47242 transitions. [2019-09-08 08:03:46,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 08:03:46,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:03:46,314 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 08:03:46,315 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:03:46,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:03:46,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1890088150, now seen corresponding path program 1 times [2019-09-08 08:03:46,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:03:46,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:03:46,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:46,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:03:46,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:03:47,084 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 08:03:47,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:03:47,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 08:03:47,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 08:03:47,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 08:03:47,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2019-09-08 08:03:47,087 INFO L87 Difference]: Start difference. First operand 33355 states and 47242 transitions. Second operand 19 states. [2019-09-08 08:04:07,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:04:07,653 INFO L93 Difference]: Finished difference Result 108797 states and 167291 transitions. [2019-09-08 08:04:07,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-08 08:04:07,654 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 144 [2019-09-08 08:04:07,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:04:07,987 INFO L225 Difference]: With dead ends: 108797 [2019-09-08 08:04:07,988 INFO L226 Difference]: Without dead ends: 75515 [2019-09-08 08:04:08,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5071 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2626, Invalid=9364, Unknown=0, NotChecked=0, Total=11990 [2019-09-08 08:04:08,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75515 states. [2019-09-08 08:04:11,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75515 to 45051. [2019-09-08 08:04:11,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45051 states. [2019-09-08 08:04:11,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45051 states to 45051 states and 63994 transitions. [2019-09-08 08:04:11,398 INFO L78 Accepts]: Start accepts. Automaton has 45051 states and 63994 transitions. Word has length 144 [2019-09-08 08:04:11,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:04:11,399 INFO L475 AbstractCegarLoop]: Abstraction has 45051 states and 63994 transitions. [2019-09-08 08:04:11,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 08:04:11,399 INFO L276 IsEmpty]: Start isEmpty. Operand 45051 states and 63994 transitions. [2019-09-08 08:04:11,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 08:04:11,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:04:11,401 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:04:11,402 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:04:11,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:04:11,402 INFO L82 PathProgramCache]: Analyzing trace with hash -20413614, now seen corresponding path program 1 times [2019-09-08 08:04:11,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:04:11,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:04:11,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:04:11,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:04:11,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:04:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:04:11,534 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 08:04:11,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:04:11,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 08:04:11,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 08:04:11,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 08:04:11,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 08:04:11,536 INFO L87 Difference]: Start difference. First operand 45051 states and 63994 transitions. Second operand 9 states. [2019-09-08 08:04:13,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:04:13,924 INFO L93 Difference]: Finished difference Result 93092 states and 131038 transitions. [2019-09-08 08:04:13,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 08:04:13,924 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 144 [2019-09-08 08:04:13,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:04:14,104 INFO L225 Difference]: With dead ends: 93092 [2019-09-08 08:04:14,106 INFO L226 Difference]: Without dead ends: 48114 [2019-09-08 08:04:14,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-08 08:04:14,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48114 states. [2019-09-08 08:04:18,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48114 to 45248. [2019-09-08 08:04:18,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45248 states. [2019-09-08 08:04:18,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45248 states to 45248 states and 64245 transitions. [2019-09-08 08:04:18,534 INFO L78 Accepts]: Start accepts. Automaton has 45248 states and 64245 transitions. Word has length 144 [2019-09-08 08:04:18,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:04:18,535 INFO L475 AbstractCegarLoop]: Abstraction has 45248 states and 64245 transitions. [2019-09-08 08:04:18,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 08:04:18,535 INFO L276 IsEmpty]: Start isEmpty. Operand 45248 states and 64245 transitions. [2019-09-08 08:04:18,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 08:04:18,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:04:18,538 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 08:04:18,538 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:04:18,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:04:18,538 INFO L82 PathProgramCache]: Analyzing trace with hash -844227190, now seen corresponding path program 1 times [2019-09-08 08:04:18,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:04:18,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:04:18,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:04:18,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:04:18,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:04:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:04:18,670 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 08:04:18,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:04:18,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 08:04:18,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 08:04:18,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 08:04:18,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 08:04:18,672 INFO L87 Difference]: Start difference. First operand 45248 states and 64245 transitions. Second operand 9 states. [2019-09-08 08:04:21,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:04:21,735 INFO L93 Difference]: Finished difference Result 98834 states and 139407 transitions. [2019-09-08 08:04:21,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 08:04:21,735 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 144 [2019-09-08 08:04:21,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:04:21,911 INFO L225 Difference]: With dead ends: 98834 [2019-09-08 08:04:21,911 INFO L226 Difference]: Without dead ends: 53802 [2019-09-08 08:04:21,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-08 08:04:22,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53802 states. [2019-09-08 08:04:25,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53802 to 45303. [2019-09-08 08:04:25,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45303 states. [2019-09-08 08:04:25,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45303 states to 45303 states and 64318 transitions. [2019-09-08 08:04:25,468 INFO L78 Accepts]: Start accepts. Automaton has 45303 states and 64318 transitions. Word has length 144 [2019-09-08 08:04:25,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:04:25,468 INFO L475 AbstractCegarLoop]: Abstraction has 45303 states and 64318 transitions. [2019-09-08 08:04:25,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 08:04:25,468 INFO L276 IsEmpty]: Start isEmpty. Operand 45303 states and 64318 transitions. [2019-09-08 08:04:25,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 08:04:25,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:04:25,470 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 08:04:25,470 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:04:25,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:04:25,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1750236746, now seen corresponding path program 1 times [2019-09-08 08:04:25,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:04:25,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:04:25,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:04:25,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:04:25,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:04:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:04:25,611 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 08:04:25,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:04:25,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 08:04:25,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 08:04:25,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 08:04:25,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 08:04:25,613 INFO L87 Difference]: Start difference. First operand 45303 states and 64318 transitions. Second operand 9 states. [2019-09-08 08:04:29,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:04:29,114 INFO L93 Difference]: Finished difference Result 116591 states and 164621 transitions. [2019-09-08 08:04:29,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 08:04:29,114 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 144 [2019-09-08 08:04:29,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:04:29,255 INFO L225 Difference]: With dead ends: 116591 [2019-09-08 08:04:29,256 INFO L226 Difference]: Without dead ends: 71408 [2019-09-08 08:04:29,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-08 08:04:29,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71408 states. [2019-09-08 08:04:31,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71408 to 46972. [2019-09-08 08:04:31,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46972 states. [2019-09-08 08:04:33,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46972 states to 46972 states and 66592 transitions. [2019-09-08 08:04:33,473 INFO L78 Accepts]: Start accepts. Automaton has 46972 states and 66592 transitions. Word has length 144 [2019-09-08 08:04:33,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:04:33,473 INFO L475 AbstractCegarLoop]: Abstraction has 46972 states and 66592 transitions. [2019-09-08 08:04:33,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 08:04:33,473 INFO L276 IsEmpty]: Start isEmpty. Operand 46972 states and 66592 transitions. [2019-09-08 08:04:33,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 08:04:33,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:04:33,475 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 08:04:33,475 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:04:33,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:04:33,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1743971936, now seen corresponding path program 1 times [2019-09-08 08:04:33,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:04:33,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:04:33,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:04:33,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:04:33,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:04:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:04:33,629 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 08:04:33,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:04:33,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:04:33,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:04:33,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:04:33,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:04:33,630 INFO L87 Difference]: Start difference. First operand 46972 states and 66592 transitions. Second operand 5 states. [2019-09-08 08:04:36,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:04:36,692 INFO L93 Difference]: Finished difference Result 116255 states and 165257 transitions. [2019-09-08 08:04:36,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:04:36,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2019-09-08 08:04:36,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:04:36,838 INFO L225 Difference]: With dead ends: 116255 [2019-09-08 08:04:36,838 INFO L226 Difference]: Without dead ends: 69363 [2019-09-08 08:04:36,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:04:36,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69363 states. [2019-09-08 08:04:39,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69363 to 68463. [2019-09-08 08:04:39,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68463 states. [2019-09-08 08:04:40,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68463 states to 68463 states and 96441 transitions. [2019-09-08 08:04:40,049 INFO L78 Accepts]: Start accepts. Automaton has 68463 states and 96441 transitions. Word has length 145 [2019-09-08 08:04:40,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:04:40,049 INFO L475 AbstractCegarLoop]: Abstraction has 68463 states and 96441 transitions. [2019-09-08 08:04:40,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:04:40,050 INFO L276 IsEmpty]: Start isEmpty. Operand 68463 states and 96441 transitions. [2019-09-08 08:04:40,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 08:04:40,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:04:40,051 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 08:04:40,052 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:04:40,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:04:40,052 INFO L82 PathProgramCache]: Analyzing trace with hash -96546975, now seen corresponding path program 1 times [2019-09-08 08:04:40,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:04:40,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:04:40,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:04:40,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:04:40,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:04:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:04:40,177 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 08:04:40,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:04:40,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 08:04:40,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 08:04:40,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 08:04:40,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:04:40,179 INFO L87 Difference]: Start difference. First operand 68463 states and 96441 transitions. Second operand 8 states. [2019-09-08 08:04:44,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:04:44,533 INFO L93 Difference]: Finished difference Result 78522 states and 116340 transitions. [2019-09-08 08:04:44,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 08:04:44,533 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 145 [2019-09-08 08:04:44,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:04:44,746 INFO L225 Difference]: With dead ends: 78522 [2019-09-08 08:04:44,746 INFO L226 Difference]: Without dead ends: 78520 [2019-09-08 08:04:44,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:04:44,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78520 states. [2019-09-08 08:04:48,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78520 to 72063. [2019-09-08 08:04:48,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72063 states. [2019-09-08 08:04:48,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72063 states to 72063 states and 100137 transitions. [2019-09-08 08:04:48,220 INFO L78 Accepts]: Start accepts. Automaton has 72063 states and 100137 transitions. Word has length 145 [2019-09-08 08:04:48,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:04:48,220 INFO L475 AbstractCegarLoop]: Abstraction has 72063 states and 100137 transitions. [2019-09-08 08:04:48,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 08:04:48,221 INFO L276 IsEmpty]: Start isEmpty. Operand 72063 states and 100137 transitions. [2019-09-08 08:04:48,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 08:04:48,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:04:48,222 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 08:04:48,223 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:04:48,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:04:48,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1430078317, now seen corresponding path program 1 times [2019-09-08 08:04:48,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:04:48,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:04:48,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:04:48,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:04:48,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:04:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:04:48,353 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 08:04:48,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:04:48,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 08:04:48,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 08:04:48,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 08:04:48,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 08:04:48,355 INFO L87 Difference]: Start difference. First operand 72063 states and 100137 transitions. Second operand 9 states. [2019-09-08 08:04:54,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:04:54,507 INFO L93 Difference]: Finished difference Result 139915 states and 195540 transitions. [2019-09-08 08:04:54,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 08:04:54,508 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 146 [2019-09-08 08:04:54,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:04:54,675 INFO L225 Difference]: With dead ends: 139915 [2019-09-08 08:04:54,675 INFO L226 Difference]: Without dead ends: 89981 [2019-09-08 08:04:54,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-08 08:04:54,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89981 states. [2019-09-08 08:04:58,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89981 to 78988. [2019-09-08 08:04:58,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78988 states. [2019-09-08 08:04:58,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78988 states to 78988 states and 110353 transitions. [2019-09-08 08:04:58,259 INFO L78 Accepts]: Start accepts. Automaton has 78988 states and 110353 transitions. Word has length 146 [2019-09-08 08:04:58,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:04:58,259 INFO L475 AbstractCegarLoop]: Abstraction has 78988 states and 110353 transitions. [2019-09-08 08:04:58,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 08:04:58,259 INFO L276 IsEmpty]: Start isEmpty. Operand 78988 states and 110353 transitions. [2019-09-08 08:04:58,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 08:04:58,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:04:58,261 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 08:04:58,261 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:04:58,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:04:58,261 INFO L82 PathProgramCache]: Analyzing trace with hash 870723943, now seen corresponding path program 1 times [2019-09-08 08:04:58,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:04:58,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:04:58,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:04:58,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:04:58,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:04:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:04:58,404 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 08:04:58,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:04:58,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:04:58,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:04:58,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:04:58,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:04:58,406 INFO L87 Difference]: Start difference. First operand 78988 states and 110353 transitions. Second operand 5 states. [2019-09-08 08:05:02,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:05:02,888 INFO L93 Difference]: Finished difference Result 154163 states and 215127 transitions. [2019-09-08 08:05:02,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:05:02,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-09-08 08:05:02,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:05:03,203 INFO L225 Difference]: With dead ends: 154163 [2019-09-08 08:05:03,203 INFO L226 Difference]: Without dead ends: 95813 [2019-09-08 08:05:03,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:05:03,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95813 states. [2019-09-08 08:05:10,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95813 to 94176. [2019-09-08 08:05:10,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94176 states. [2019-09-08 08:05:10,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94176 states to 94176 states and 129677 transitions. [2019-09-08 08:05:10,220 INFO L78 Accepts]: Start accepts. Automaton has 94176 states and 129677 transitions. Word has length 147 [2019-09-08 08:05:10,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:05:10,220 INFO L475 AbstractCegarLoop]: Abstraction has 94176 states and 129677 transitions. [2019-09-08 08:05:10,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:05:10,221 INFO L276 IsEmpty]: Start isEmpty. Operand 94176 states and 129677 transitions. [2019-09-08 08:05:10,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-08 08:05:10,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:05:10,252 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:05:10,252 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:05:10,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:05:10,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1797515352, now seen corresponding path program 1 times [2019-09-08 08:05:10,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:05:10,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:05:10,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:05:10,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:05:10,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:05:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:05:10,367 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-08 08:05:10,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 08:05:10,367 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 08:05:10,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 08:05:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:05:10,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 1500 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-08 08:05:10,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 08:05:11,391 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-08 08:05:11,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 08:05:11,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [5] total 20 [2019-09-08 08:05:11,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 08:05:11,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 08:05:11,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2019-09-08 08:05:11,400 INFO L87 Difference]: Start difference. First operand 94176 states and 129677 transitions. Second operand 20 states. [2019-09-08 08:05:23,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:05:23,039 INFO L93 Difference]: Finished difference Result 162405 states and 223302 transitions. [2019-09-08 08:05:23,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-08 08:05:23,040 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 217 [2019-09-08 08:05:23,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:05:23,300 INFO L225 Difference]: With dead ends: 162405 [2019-09-08 08:05:23,300 INFO L226 Difference]: Without dead ends: 68371 [2019-09-08 08:05:23,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 227 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=730, Invalid=2240, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 08:05:23,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68371 states. [2019-09-08 08:05:29,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68371 to 65685. [2019-09-08 08:05:29,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65685 states. [2019-09-08 08:05:29,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65685 states to 65685 states and 89556 transitions. [2019-09-08 08:05:29,366 INFO L78 Accepts]: Start accepts. Automaton has 65685 states and 89556 transitions. Word has length 217 [2019-09-08 08:05:29,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:05:29,367 INFO L475 AbstractCegarLoop]: Abstraction has 65685 states and 89556 transitions. [2019-09-08 08:05:29,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 08:05:29,367 INFO L276 IsEmpty]: Start isEmpty. Operand 65685 states and 89556 transitions. [2019-09-08 08:05:29,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-08 08:05:29,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:05:29,389 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:05:29,389 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:05:29,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:05:29,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1142312121, now seen corresponding path program 1 times [2019-09-08 08:05:29,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:05:29,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:05:29,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:05:29,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:05:29,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:05:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:05:29,523 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 08:05:29,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 08:05:29,524 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 08:05:29,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 08:05:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:05:29,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 1503 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-08 08:05:29,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 08:05:30,661 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 08:05:30,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 08:05:30,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [5] total 21 [2019-09-08 08:05:30,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 08:05:30,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 08:05:30,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2019-09-08 08:05:30,668 INFO L87 Difference]: Start difference. First operand 65685 states and 89556 transitions. Second operand 21 states. [2019-09-08 08:05:45,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:05:45,265 INFO L93 Difference]: Finished difference Result 220247 states and 303041 transitions. [2019-09-08 08:05:45,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-08 08:05:45,267 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 219 [2019-09-08 08:05:45,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:05:45,708 INFO L225 Difference]: With dead ends: 220247 [2019-09-08 08:05:45,708 INFO L226 Difference]: Without dead ends: 154725 [2019-09-08 08:05:45,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=790, Invalid=2516, Unknown=0, NotChecked=0, Total=3306 [2019-09-08 08:05:45,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154725 states. [2019-09-08 08:05:57,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154725 to 151575. [2019-09-08 08:05:57,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151575 states. [2019-09-08 08:05:57,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151575 states to 151575 states and 206305 transitions. [2019-09-08 08:05:57,815 INFO L78 Accepts]: Start accepts. Automaton has 151575 states and 206305 transitions. Word has length 219 [2019-09-08 08:05:57,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:05:57,816 INFO L475 AbstractCegarLoop]: Abstraction has 151575 states and 206305 transitions. [2019-09-08 08:05:57,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 08:05:57,816 INFO L276 IsEmpty]: Start isEmpty. Operand 151575 states and 206305 transitions. [2019-09-08 08:05:57,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-08 08:05:57,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:05:57,847 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:05:57,847 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:05:57,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:05:57,847 INFO L82 PathProgramCache]: Analyzing trace with hash -998008839, now seen corresponding path program 1 times [2019-09-08 08:05:57,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:05:57,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:05:57,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:05:57,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:05:57,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:05:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:05:57,975 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 08:05:57,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 08:05:57,976 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 08:05:58,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:05:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:05:58,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 1503 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-08 08:05:58,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 08:05:58,943 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 08:05:58,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 08:05:58,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [5] total 25 [2019-09-08 08:05:58,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 08:05:58,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 08:05:58,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-09-08 08:05:58,950 INFO L87 Difference]: Start difference. First operand 151575 states and 206305 transitions. Second operand 25 states. [2019-09-08 08:06:31,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:06:31,360 INFO L93 Difference]: Finished difference Result 545535 states and 745793 transitions. [2019-09-08 08:06:31,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-08 08:06:31,360 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 219 [2019-09-08 08:06:31,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:06:32,405 INFO L225 Difference]: With dead ends: 545535 [2019-09-08 08:06:32,405 INFO L226 Difference]: Without dead ends: 394189 [2019-09-08 08:06:32,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1111 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1009, Invalid=3413, Unknown=0, NotChecked=0, Total=4422 [2019-09-08 08:06:32,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394189 states. [2019-09-08 08:07:07,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394189 to 385611. [2019-09-08 08:07:07,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385611 states. [2019-09-08 08:07:07,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385611 states to 385611 states and 520719 transitions. [2019-09-08 08:07:07,787 INFO L78 Accepts]: Start accepts. Automaton has 385611 states and 520719 transitions. Word has length 219 [2019-09-08 08:07:07,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:07:07,788 INFO L475 AbstractCegarLoop]: Abstraction has 385611 states and 520719 transitions. [2019-09-08 08:07:07,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 08:07:07,788 INFO L276 IsEmpty]: Start isEmpty. Operand 385611 states and 520719 transitions. [2019-09-08 08:07:07,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-08 08:07:07,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:07:07,849 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:07:07,850 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:07:07,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:07:07,850 INFO L82 PathProgramCache]: Analyzing trace with hash -259046237, now seen corresponding path program 1 times [2019-09-08 08:07:07,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:07:07,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:07:07,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:07:07,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:07:07,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:07:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:07:08,012 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 08:07:08,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 08:07:08,012 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 08:07:08,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:07:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:07:08,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 1501 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-08 08:07:08,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 08:07:09,835 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 08:07:09,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 08:07:09,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [5] total 22 [2019-09-08 08:07:09,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 08:07:09,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 08:07:09,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2019-09-08 08:07:09,842 INFO L87 Difference]: Start difference. First operand 385611 states and 520719 transitions. Second operand 22 states. [2019-09-08 08:08:17,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:08:17,821 INFO L93 Difference]: Finished difference Result 1257419 states and 1709285 transitions. [2019-09-08 08:08:17,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-08 08:08:17,822 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 219 [2019-09-08 08:08:17,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:08:20,105 INFO L225 Difference]: With dead ends: 1257419 [2019-09-08 08:08:20,106 INFO L226 Difference]: Without dead ends: 872105 [2019-09-08 08:08:21,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=976, Invalid=3056, Unknown=0, NotChecked=0, Total=4032 [2019-09-08 08:08:21,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872105 states. [2019-09-08 08:09:44,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872105 to 852231. [2019-09-08 08:09:44,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852231 states. [2019-09-08 08:09:47,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852231 states to 852231 states and 1144915 transitions. [2019-09-08 08:09:47,328 INFO L78 Accepts]: Start accepts. Automaton has 852231 states and 1144915 transitions. Word has length 219 [2019-09-08 08:09:47,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:09:47,329 INFO L475 AbstractCegarLoop]: Abstraction has 852231 states and 1144915 transitions. [2019-09-08 08:09:47,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 08:09:47,329 INFO L276 IsEmpty]: Start isEmpty. Operand 852231 states and 1144915 transitions. [2019-09-08 08:09:47,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-08 08:09:47,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:09:47,433 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:09:47,433 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:09:47,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:09:47,434 INFO L82 PathProgramCache]: Analyzing trace with hash -176127367, now seen corresponding path program 1 times [2019-09-08 08:09:47,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:09:47,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:09:47,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:09:47,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:09:47,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:09:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:09:47,961 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 08:09:47,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 08:09:47,961 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 08:09:47,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:09:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:09:48,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 1499 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-08 08:09:48,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 08:09:48,945 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 08:09:48,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 08:09:48,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [23] total 41 [2019-09-08 08:09:48,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-08 08:09:48,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-08 08:09:48,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1420, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 08:09:48,952 INFO L87 Difference]: Start difference. First operand 852231 states and 1144915 transitions. Second operand 41 states.