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.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 08:06:59,622 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 08:06:59,624 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 08:06:59,635 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 08:06:59,636 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 08:06:59,637 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 08:06:59,638 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 08:06:59,640 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 08:06:59,649 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 08:06:59,650 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 08:06:59,653 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 08:06:59,654 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 08:06:59,654 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 08:06:59,655 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 08:06:59,658 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 08:06:59,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 08:06:59,660 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 08:06:59,663 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 08:06:59,668 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 08:06:59,670 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 08:06:59,673 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 08:06:59,676 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 08:06:59,678 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 08:06:59,678 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 08:06:59,683 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 08:06:59,683 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 08:06:59,683 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 08:06:59,684 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 08:06:59,684 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 08:06:59,687 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 08:06:59,687 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 08:06:59,688 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 08:06:59,689 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 08:06:59,689 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 08:06:59,690 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 08:06:59,690 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 08:06:59,691 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 08:06:59,691 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 08:06:59,692 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 08:06:59,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 08:06:59,693 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 08:06:59,694 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:06:59,708 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 08:06:59,708 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 08:06:59,710 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 08:06:59,710 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 08:06:59,711 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 08:06:59,711 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 08:06:59,711 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 08:06:59,711 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 08:06:59,711 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 08:06:59,712 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 08:06:59,712 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 08:06:59,712 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 08:06:59,712 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 08:06:59,712 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 08:06:59,713 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 08:06:59,713 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 08:06:59,713 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 08:06:59,714 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 08:06:59,714 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 08:06:59,714 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 08:06:59,714 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 08:06:59,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 08:06:59,715 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 08:06:59,715 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 08:06:59,715 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 08:06:59,715 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 08:06:59,716 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 08:06:59,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 08:06:59,717 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 08:06:59,769 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 08:06:59,784 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 08:06:59,788 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 08:06:59,791 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 08:06:59,792 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 08:06:59,792 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr.8.ufo.UNBOUNDED.pals.c [2019-09-08 08:06:59,872 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d11ab4fc/02be5991936f4d5c920a42a1e63a741e/FLAG6d1965fc5 [2019-09-08 08:07:00,361 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 08:07:00,362 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr.8.ufo.UNBOUNDED.pals.c [2019-09-08 08:07:00,378 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d11ab4fc/02be5991936f4d5c920a42a1e63a741e/FLAG6d1965fc5 [2019-09-08 08:07:00,680 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d11ab4fc/02be5991936f4d5c920a42a1e63a741e [2019-09-08 08:07:00,694 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 08:07:00,696 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 08:07:00,697 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 08:07:00,697 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 08:07:00,701 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 08:07:00,702 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:07:00" (1/1) ... [2019-09-08 08:07:00,705 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ab5b6af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:07:00, skipping insertion in model container [2019-09-08 08:07:00,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:07:00" (1/1) ... [2019-09-08 08:07:00,714 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 08:07:00,783 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 08:07:01,190 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:07:01,201 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 08:07:01,272 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:07:01,296 INFO L192 MainTranslator]: Completed translation [2019-09-08 08:07:01,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:07:01 WrapperNode [2019-09-08 08:07:01,297 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 08:07:01,297 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 08:07:01,298 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 08:07:01,298 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 08:07:01,310 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:07:01" (1/1) ... [2019-09-08 08:07:01,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:07:01" (1/1) ... [2019-09-08 08:07:01,323 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:07:01" (1/1) ... [2019-09-08 08:07:01,323 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:07:01" (1/1) ... [2019-09-08 08:07:01,341 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:07:01" (1/1) ... [2019-09-08 08:07:01,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:07:01" (1/1) ... [2019-09-08 08:07:01,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:07:01" (1/1) ... [2019-09-08 08:07:01,368 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 08:07:01,368 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 08:07:01,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 08:07:01,369 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 08:07:01,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:07:01" (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:07:01,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 08:07:01,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 08:07:01,424 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-08 08:07:01,424 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-08 08:07:01,424 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-08 08:07:01,424 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-08 08:07:01,425 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-08 08:07:01,425 INFO L138 BoogieDeclarations]: Found implementation of procedure node6 [2019-09-08 08:07:01,427 INFO L138 BoogieDeclarations]: Found implementation of procedure node7 [2019-09-08 08:07:01,428 INFO L138 BoogieDeclarations]: Found implementation of procedure node8 [2019-09-08 08:07:01,428 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 08:07:01,428 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 08:07:01,428 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 08:07:01,428 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 08:07:01,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 08:07:01,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 08:07:01,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 08:07:01,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 08:07:01,429 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 08:07:01,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 08:07:01,430 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 08:07:01,430 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 08:07:01,430 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 08:07:01,430 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 08:07:01,431 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 08:07:01,431 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 08:07:01,431 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 08:07:01,431 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 08:07:01,431 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-08 08:07:01,431 INFO L130 BoogieDeclarations]: Found specification of procedure node8 [2019-09-08 08:07:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 08:07:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 08:07:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 08:07:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 08:07:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 08:07:02,283 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 08:07:02,284 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 08:07:02,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:07:02 BoogieIcfgContainer [2019-09-08 08:07:02,286 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 08:07:02,287 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 08:07:02,287 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 08:07:02,291 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 08:07:02,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 08:07:00" (1/3) ... [2019-09-08 08:07:02,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3c28e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:07:02, skipping insertion in model container [2019-09-08 08:07:02,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:07:01" (2/3) ... [2019-09-08 08:07:02,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3c28e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:07:02, skipping insertion in model container [2019-09-08 08:07:02,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:07:02" (3/3) ... [2019-09-08 08:07:02,296 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.UNBOUNDED.pals.c [2019-09-08 08:07:02,308 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 08:07:02,318 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 08:07:02,336 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 08:07:02,369 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 08:07:02,370 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 08:07:02,370 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 08:07:02,370 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 08:07:02,370 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 08:07:02,371 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 08:07:02,371 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 08:07:02,371 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 08:07:02,371 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 08:07:02,398 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states. [2019-09-08 08:07:02,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 08:07:02,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:07:02,413 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:07:02,416 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:07:02,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:07:02,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1939199710, now seen corresponding path program 1 times [2019-09-08 08:07:02,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:07:02,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:07:02,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:07:02,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:07:02,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:07:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:07:02,833 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:07:02,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:07:02,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:07:02,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:07:02,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:07:02,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:07:02,858 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 5 states. [2019-09-08 08:07:03,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:07:03,047 INFO L93 Difference]: Finished difference Result 302 states and 461 transitions. [2019-09-08 08:07:03,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 08:07:03,049 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-08 08:07:03,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:07:03,063 INFO L225 Difference]: With dead ends: 302 [2019-09-08 08:07:03,063 INFO L226 Difference]: Without dead ends: 183 [2019-09-08 08:07:03,067 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:07:03,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-08 08:07:03,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2019-09-08 08:07:03,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-08 08:07:03,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 229 transitions. [2019-09-08 08:07:03,121 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 229 transitions. Word has length 82 [2019-09-08 08:07:03,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:07:03,122 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 229 transitions. [2019-09-08 08:07:03,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:07:03,122 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 229 transitions. [2019-09-08 08:07:03,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 08:07:03,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:07:03,130 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:07:03,130 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:07:03,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:07:03,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1592771534, now seen corresponding path program 1 times [2019-09-08 08:07:03,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:07:03,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:07:03,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:07:03,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:07:03,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:07:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:07:03,820 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:07:03,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:07:03,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 08:07:03,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 08:07:03,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 08:07:03,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2019-09-08 08:07:03,824 INFO L87 Difference]: Start difference. First operand 183 states and 229 transitions. Second operand 19 states. [2019-09-08 08:07:21,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:07:21,378 INFO L93 Difference]: Finished difference Result 2604 states and 4074 transitions. [2019-09-08 08:07:21,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-08 08:07:21,378 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 142 [2019-09-08 08:07:21,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:07:21,413 INFO L225 Difference]: With dead ends: 2604 [2019-09-08 08:07:21,413 INFO L226 Difference]: Without dead ends: 2494 [2019-09-08 08:07:21,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4738 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2532, Invalid=9240, Unknown=0, NotChecked=0, Total=11772 [2019-09-08 08:07:21,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2494 states. [2019-09-08 08:07:21,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2494 to 1301. [2019-09-08 08:07:21,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1301 states. [2019-09-08 08:07:21,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1301 states and 1866 transitions. [2019-09-08 08:07:21,610 INFO L78 Accepts]: Start accepts. Automaton has 1301 states and 1866 transitions. Word has length 142 [2019-09-08 08:07:21,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:07:21,614 INFO L475 AbstractCegarLoop]: Abstraction has 1301 states and 1866 transitions. [2019-09-08 08:07:21,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 08:07:21,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1866 transitions. [2019-09-08 08:07:21,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 08:07:21,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:07:21,631 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:07:21,631 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:07:21,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:07:21,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1197298206, now seen corresponding path program 1 times [2019-09-08 08:07:21,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:07:21,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:07:21,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:07:21,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:07:21,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:07:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:07:21,808 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:07:21,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:07:21,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 08:07:21,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 08:07:21,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 08:07:21,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 08:07:21,810 INFO L87 Difference]: Start difference. First operand 1301 states and 1866 transitions. Second operand 3 states. [2019-09-08 08:07:21,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:07:21,940 INFO L93 Difference]: Finished difference Result 3689 states and 5374 transitions. [2019-09-08 08:07:21,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 08:07:21,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-09-08 08:07:21,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:07:21,958 INFO L225 Difference]: With dead ends: 3689 [2019-09-08 08:07:21,958 INFO L226 Difference]: Without dead ends: 2461 [2019-09-08 08:07:21,964 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:07:21,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2461 states. [2019-09-08 08:07:22,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2461 to 2437. [2019-09-08 08:07:22,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2437 states. [2019-09-08 08:07:22,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2437 states to 2437 states and 3506 transitions. [2019-09-08 08:07:22,171 INFO L78 Accepts]: Start accepts. Automaton has 2437 states and 3506 transitions. Word has length 144 [2019-09-08 08:07:22,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:07:22,172 INFO L475 AbstractCegarLoop]: Abstraction has 2437 states and 3506 transitions. [2019-09-08 08:07:22,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 08:07:22,172 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 3506 transitions. [2019-09-08 08:07:22,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 08:07:22,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:07:22,177 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:07:22,177 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:07:22,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:07:22,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1809966634, now seen corresponding path program 1 times [2019-09-08 08:07:22,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:07:22,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:07:22,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:07:22,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:07:22,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:07:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:07:22,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:07:22,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:07:22,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:07:22,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:07:22,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:07:22,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:07:22,412 INFO L87 Difference]: Start difference. First operand 2437 states and 3506 transitions. Second operand 5 states. [2019-09-08 08:07:23,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:07:23,430 INFO L93 Difference]: Finished difference Result 7027 states and 10192 transitions. [2019-09-08 08:07:23,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:07:23,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-08 08:07:23,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:07:23,461 INFO L225 Difference]: With dead ends: 7027 [2019-09-08 08:07:23,461 INFO L226 Difference]: Without dead ends: 4663 [2019-09-08 08:07:23,469 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:07:23,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4663 states. [2019-09-08 08:07:23,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4663 to 4661. [2019-09-08 08:07:23,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4661 states. [2019-09-08 08:07:23,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4661 states to 4661 states and 6694 transitions. [2019-09-08 08:07:23,881 INFO L78 Accepts]: Start accepts. Automaton has 4661 states and 6694 transitions. Word has length 144 [2019-09-08 08:07:23,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:07:23,883 INFO L475 AbstractCegarLoop]: Abstraction has 4661 states and 6694 transitions. [2019-09-08 08:07:23,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:07:23,883 INFO L276 IsEmpty]: Start isEmpty. Operand 4661 states and 6694 transitions. [2019-09-08 08:07:23,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 08:07:23,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:07:23,890 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:07:23,892 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:07:23,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:07:23,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1114557792, now seen corresponding path program 1 times [2019-09-08 08:07:23,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:07:23,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:07:23,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:07:23,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:07:23,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:07:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:07:24,231 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:07:24,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:07:24,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:07:24,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:07:24,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:07:24,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:07:24,233 INFO L87 Difference]: Start difference. First operand 4661 states and 6694 transitions. Second operand 5 states. [2019-09-08 08:07:25,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:07:25,319 INFO L93 Difference]: Finished difference Result 13549 states and 19568 transitions. [2019-09-08 08:07:25,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:07:25,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-08 08:07:25,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:07:25,379 INFO L225 Difference]: With dead ends: 13549 [2019-09-08 08:07:25,379 INFO L226 Difference]: Without dead ends: 8961 [2019-09-08 08:07:25,396 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:07:25,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8961 states. [2019-09-08 08:07:25,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8961 to 8959. [2019-09-08 08:07:25,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8959 states. [2019-09-08 08:07:26,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8959 states to 8959 states and 12826 transitions. [2019-09-08 08:07:26,009 INFO L78 Accepts]: Start accepts. Automaton has 8959 states and 12826 transitions. Word has length 144 [2019-09-08 08:07:26,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:07:26,009 INFO L475 AbstractCegarLoop]: Abstraction has 8959 states and 12826 transitions. [2019-09-08 08:07:26,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:07:26,010 INFO L276 IsEmpty]: Start isEmpty. Operand 8959 states and 12826 transitions. [2019-09-08 08:07:26,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 08:07:26,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:07:26,014 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:07:26,014 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:07:26,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:07:26,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1829234070, now seen corresponding path program 1 times [2019-09-08 08:07:26,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:07:26,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:07:26,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:07:26,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:07:26,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:07:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:07:26,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:07:26,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:07:26,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:07:26,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:07:26,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:07:26,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:07:26,208 INFO L87 Difference]: Start difference. First operand 8959 states and 12826 transitions. Second operand 5 states. [2019-09-08 08:07:28,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:07:28,165 INFO L93 Difference]: Finished difference Result 26179 states and 37612 transitions. [2019-09-08 08:07:28,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:07:28,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-08 08:07:28,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:07:28,250 INFO L225 Difference]: With dead ends: 26179 [2019-09-08 08:07:28,252 INFO L226 Difference]: Without dead ends: 17293 [2019-09-08 08:07:28,279 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:07:28,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17293 states. [2019-09-08 08:07:29,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17293 to 17291. [2019-09-08 08:07:29,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17291 states. [2019-09-08 08:07:29,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17291 states to 17291 states and 24626 transitions. [2019-09-08 08:07:29,272 INFO L78 Accepts]: Start accepts. Automaton has 17291 states and 24626 transitions. Word has length 144 [2019-09-08 08:07:29,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:07:29,273 INFO L475 AbstractCegarLoop]: Abstraction has 17291 states and 24626 transitions. [2019-09-08 08:07:29,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:07:29,274 INFO L276 IsEmpty]: Start isEmpty. Operand 17291 states and 24626 transitions. [2019-09-08 08:07:29,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 08:07:29,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:07:29,278 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:07:29,278 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:07:29,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:07:29,279 INFO L82 PathProgramCache]: Analyzing trace with hash 642579296, now seen corresponding path program 1 times [2019-09-08 08:07:29,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:07:29,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:07:29,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:07:29,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:07:29,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:07:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:07:29,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:07:29,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:07:29,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:07:29,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:07:29,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:07:29,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:07:29,471 INFO L87 Difference]: Start difference. First operand 17291 states and 24626 transitions. Second operand 5 states. [2019-09-08 08:07:31,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:07:31,752 INFO L93 Difference]: Finished difference Result 50575 states and 72260 transitions. [2019-09-08 08:07:31,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:07:31,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-08 08:07:31,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:07:31,918 INFO L225 Difference]: With dead ends: 50575 [2019-09-08 08:07:31,918 INFO L226 Difference]: Without dead ends: 33357 [2019-09-08 08:07:31,972 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:07:32,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33357 states. [2019-09-08 08:07:33,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33357 to 33355. [2019-09-08 08:07:33,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33355 states. [2019-09-08 08:07:33,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33355 states to 33355 states and 47242 transitions. [2019-09-08 08:07:33,917 INFO L78 Accepts]: Start accepts. Automaton has 33355 states and 47242 transitions. Word has length 144 [2019-09-08 08:07:33,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:07:33,917 INFO L475 AbstractCegarLoop]: Abstraction has 33355 states and 47242 transitions. [2019-09-08 08:07:33,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:07:33,918 INFO L276 IsEmpty]: Start isEmpty. Operand 33355 states and 47242 transitions. [2019-09-08 08:07:33,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 08:07:33,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:07:33,922 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:07:33,922 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:07:33,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:07:33,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1890088150, now seen corresponding path program 1 times [2019-09-08 08:07:33,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:07:33,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:07:33,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:07:33,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:07:33,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:07:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:07:34,558 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:07:34,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:07:34,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 08:07:34,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 08:07:34,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 08:07:34,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2019-09-08 08:07:34,560 INFO L87 Difference]: Start difference. First operand 33355 states and 47242 transitions. Second operand 19 states. [2019-09-08 08:07:55,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:07:55,401 INFO L93 Difference]: Finished difference Result 108797 states and 167291 transitions. [2019-09-08 08:07:55,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-08 08:07:55,402 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 144 [2019-09-08 08:07:55,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:07:55,841 INFO L225 Difference]: With dead ends: 108797 [2019-09-08 08:07:55,841 INFO L226 Difference]: Without dead ends: 75515 [2019-09-08 08:07:55,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5071 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2626, Invalid=9364, Unknown=0, NotChecked=0, Total=11990 [2019-09-08 08:07:56,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75515 states. [2019-09-08 08:07:59,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75515 to 45051. [2019-09-08 08:07:59,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45051 states. [2019-09-08 08:07:59,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45051 states to 45051 states and 63994 transitions. [2019-09-08 08:07:59,541 INFO L78 Accepts]: Start accepts. Automaton has 45051 states and 63994 transitions. Word has length 144 [2019-09-08 08:07:59,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:07:59,542 INFO L475 AbstractCegarLoop]: Abstraction has 45051 states and 63994 transitions. [2019-09-08 08:07:59,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 08:07:59,542 INFO L276 IsEmpty]: Start isEmpty. Operand 45051 states and 63994 transitions. [2019-09-08 08:07:59,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 08:07:59,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:07:59,544 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:07:59,545 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:07:59,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:07:59,545 INFO L82 PathProgramCache]: Analyzing trace with hash -20413614, now seen corresponding path program 1 times [2019-09-08 08:07:59,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:07:59,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:07:59,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:07:59,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:07:59,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:07:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:07:59,663 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:07:59,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:07:59,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 08:07:59,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 08:07:59,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 08:07:59,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 08:07:59,664 INFO L87 Difference]: Start difference. First operand 45051 states and 63994 transitions. Second operand 9 states. [2019-09-08 08:08:04,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:08:04,090 INFO L93 Difference]: Finished difference Result 93092 states and 131038 transitions. [2019-09-08 08:08:04,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 08:08:04,091 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 144 [2019-09-08 08:08:04,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:08:04,251 INFO L225 Difference]: With dead ends: 93092 [2019-09-08 08:08:04,251 INFO L226 Difference]: Without dead ends: 48114 [2019-09-08 08:08:04,327 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:08:04,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48114 states. [2019-09-08 08:08:06,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48114 to 45248. [2019-09-08 08:08:06,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45248 states. [2019-09-08 08:08:06,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45248 states to 45248 states and 64245 transitions. [2019-09-08 08:08:06,783 INFO L78 Accepts]: Start accepts. Automaton has 45248 states and 64245 transitions. Word has length 144 [2019-09-08 08:08:06,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:08:06,784 INFO L475 AbstractCegarLoop]: Abstraction has 45248 states and 64245 transitions. [2019-09-08 08:08:06,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 08:08:06,784 INFO L276 IsEmpty]: Start isEmpty. Operand 45248 states and 64245 transitions. [2019-09-08 08:08:06,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 08:08:06,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:08:06,787 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:08:06,787 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:08:06,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:08:06,788 INFO L82 PathProgramCache]: Analyzing trace with hash -844227190, now seen corresponding path program 1 times [2019-09-08 08:08:06,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:08:06,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:08:06,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:08:06,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:08:06,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:08:06,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:08:06,917 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:08:06,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:08:06,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 08:08:06,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 08:08:06,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 08:08:06,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 08:08:06,919 INFO L87 Difference]: Start difference. First operand 45248 states and 64245 transitions. Second operand 9 states. [2019-09-08 08:08:09,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:08:09,675 INFO L93 Difference]: Finished difference Result 98834 states and 139407 transitions. [2019-09-08 08:08:09,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 08:08:09,676 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 144 [2019-09-08 08:08:09,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:08:09,861 INFO L225 Difference]: With dead ends: 98834 [2019-09-08 08:08:09,861 INFO L226 Difference]: Without dead ends: 53802 [2019-09-08 08:08:09,952 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:08:10,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53802 states. [2019-09-08 08:08:14,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53802 to 45303. [2019-09-08 08:08:14,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45303 states. [2019-09-08 08:08:14,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45303 states to 45303 states and 64318 transitions. [2019-09-08 08:08:14,347 INFO L78 Accepts]: Start accepts. Automaton has 45303 states and 64318 transitions. Word has length 144 [2019-09-08 08:08:14,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:08:14,347 INFO L475 AbstractCegarLoop]: Abstraction has 45303 states and 64318 transitions. [2019-09-08 08:08:14,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 08:08:14,348 INFO L276 IsEmpty]: Start isEmpty. Operand 45303 states and 64318 transitions. [2019-09-08 08:08:14,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 08:08:14,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:08:14,349 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:08:14,350 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:08:14,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:08:14,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1750236746, now seen corresponding path program 1 times [2019-09-08 08:08:14,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:08:14,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:08:14,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:08:14,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:08:14,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:08:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:08:14,480 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:08:14,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:08:14,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 08:08:14,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 08:08:14,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 08:08:14,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 08:08:14,481 INFO L87 Difference]: Start difference. First operand 45303 states and 64318 transitions. Second operand 9 states. [2019-09-08 08:08:17,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:08:17,536 INFO L93 Difference]: Finished difference Result 116591 states and 164621 transitions. [2019-09-08 08:08:17,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 08:08:17,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 144 [2019-09-08 08:08:17,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:08:17,694 INFO L225 Difference]: With dead ends: 116591 [2019-09-08 08:08:17,694 INFO L226 Difference]: Without dead ends: 71408 [2019-09-08 08:08:17,770 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:08:17,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71408 states. [2019-09-08 08:08:21,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71408 to 46972. [2019-09-08 08:08:21,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46972 states. [2019-09-08 08:08:21,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46972 states to 46972 states and 66592 transitions. [2019-09-08 08:08:21,794 INFO L78 Accepts]: Start accepts. Automaton has 46972 states and 66592 transitions. Word has length 144 [2019-09-08 08:08:21,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:08:21,794 INFO L475 AbstractCegarLoop]: Abstraction has 46972 states and 66592 transitions. [2019-09-08 08:08:21,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 08:08:21,794 INFO L276 IsEmpty]: Start isEmpty. Operand 46972 states and 66592 transitions. [2019-09-08 08:08:21,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 08:08:21,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:08:21,796 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:08:21,796 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:08:21,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:08:21,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1743971936, now seen corresponding path program 1 times [2019-09-08 08:08:21,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:08:21,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:08:21,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:08:21,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:08:21,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:08:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:08:21,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:08:21,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:08:21,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:08:21,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:08:21,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:08:21,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:08:21,960 INFO L87 Difference]: Start difference. First operand 46972 states and 66592 transitions. Second operand 5 states. [2019-09-08 08:08:25,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:08:25,234 INFO L93 Difference]: Finished difference Result 116255 states and 165257 transitions. [2019-09-08 08:08:25,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:08:25,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2019-09-08 08:08:25,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:08:25,393 INFO L225 Difference]: With dead ends: 116255 [2019-09-08 08:08:25,393 INFO L226 Difference]: Without dead ends: 69363 [2019-09-08 08:08:25,460 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:08:25,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69363 states. [2019-09-08 08:08:28,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69363 to 68463. [2019-09-08 08:08:28,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68463 states. [2019-09-08 08:08:28,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68463 states to 68463 states and 96441 transitions. [2019-09-08 08:08:28,666 INFO L78 Accepts]: Start accepts. Automaton has 68463 states and 96441 transitions. Word has length 145 [2019-09-08 08:08:28,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:08:28,667 INFO L475 AbstractCegarLoop]: Abstraction has 68463 states and 96441 transitions. [2019-09-08 08:08:28,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:08:28,667 INFO L276 IsEmpty]: Start isEmpty. Operand 68463 states and 96441 transitions. [2019-09-08 08:08:28,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 08:08:28,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:08:28,669 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:08:28,669 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:08:28,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:08:28,669 INFO L82 PathProgramCache]: Analyzing trace with hash -96546975, now seen corresponding path program 1 times [2019-09-08 08:08:28,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:08:28,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:08:28,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:08:28,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:08:28,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:08:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:08:28,790 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:08:28,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:08:28,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 08:08:28,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 08:08:28,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 08:08:28,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:08:28,791 INFO L87 Difference]: Start difference. First operand 68463 states and 96441 transitions. Second operand 8 states. [2019-09-08 08:08:33,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:08:33,048 INFO L93 Difference]: Finished difference Result 78522 states and 116340 transitions. [2019-09-08 08:08:33,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 08:08:33,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 145 [2019-09-08 08:08:33,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:08:33,261 INFO L225 Difference]: With dead ends: 78522 [2019-09-08 08:08:33,261 INFO L226 Difference]: Without dead ends: 78520 [2019-09-08 08:08:33,291 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:08:33,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78520 states. [2019-09-08 08:08:36,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78520 to 72063. [2019-09-08 08:08:36,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72063 states. [2019-09-08 08:08:36,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72063 states to 72063 states and 100137 transitions. [2019-09-08 08:08:36,922 INFO L78 Accepts]: Start accepts. Automaton has 72063 states and 100137 transitions. Word has length 145 [2019-09-08 08:08:36,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:08:36,923 INFO L475 AbstractCegarLoop]: Abstraction has 72063 states and 100137 transitions. [2019-09-08 08:08:36,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 08:08:36,923 INFO L276 IsEmpty]: Start isEmpty. Operand 72063 states and 100137 transitions. [2019-09-08 08:08:36,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 08:08:36,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:08:36,925 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:08:36,925 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:08:36,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:08:36,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1430078317, now seen corresponding path program 1 times [2019-09-08 08:08:36,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:08:36,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:08:36,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:08:36,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:08:36,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:08:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:08:37,069 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:08:37,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:08:37,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 08:08:37,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 08:08:37,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 08:08:37,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 08:08:37,071 INFO L87 Difference]: Start difference. First operand 72063 states and 100137 transitions. Second operand 9 states. [2019-09-08 08:08:42,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:08:42,734 INFO L93 Difference]: Finished difference Result 139915 states and 195540 transitions. [2019-09-08 08:08:42,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 08:08:42,735 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 146 [2019-09-08 08:08:42,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:08:42,934 INFO L225 Difference]: With dead ends: 139915 [2019-09-08 08:08:42,934 INFO L226 Difference]: Without dead ends: 89981 [2019-09-08 08:08:42,991 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:08:43,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89981 states. [2019-09-08 08:08:46,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89981 to 78988. [2019-09-08 08:08:46,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78988 states. [2019-09-08 08:08:46,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78988 states to 78988 states and 110353 transitions. [2019-09-08 08:08:46,667 INFO L78 Accepts]: Start accepts. Automaton has 78988 states and 110353 transitions. Word has length 146 [2019-09-08 08:08:46,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:08:46,668 INFO L475 AbstractCegarLoop]: Abstraction has 78988 states and 110353 transitions. [2019-09-08 08:08:46,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 08:08:46,668 INFO L276 IsEmpty]: Start isEmpty. Operand 78988 states and 110353 transitions. [2019-09-08 08:08:46,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 08:08:46,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:08:46,669 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:08:46,669 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:08:46,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:08:46,670 INFO L82 PathProgramCache]: Analyzing trace with hash 870723943, now seen corresponding path program 1 times [2019-09-08 08:08:46,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:08:46,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:08:46,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:08:46,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:08:46,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:08:46,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:08:46,840 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:08:46,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:08:46,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:08:46,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:08:46,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:08:46,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:08:46,842 INFO L87 Difference]: Start difference. First operand 78988 states and 110353 transitions. Second operand 5 states. [2019-09-08 08:08:53,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:08:53,598 INFO L93 Difference]: Finished difference Result 154163 states and 215127 transitions. [2019-09-08 08:08:53,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:08:53,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-09-08 08:08:53,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:08:53,816 INFO L225 Difference]: With dead ends: 154163 [2019-09-08 08:08:53,816 INFO L226 Difference]: Without dead ends: 95813 [2019-09-08 08:08:53,883 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:08:53,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95813 states. [2019-09-08 08:08:58,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95813 to 94176. [2019-09-08 08:08:58,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94176 states. [2019-09-08 08:08:58,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94176 states to 94176 states and 129677 transitions. [2019-09-08 08:08:58,608 INFO L78 Accepts]: Start accepts. Automaton has 94176 states and 129677 transitions. Word has length 147 [2019-09-08 08:08:58,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:08:58,608 INFO L475 AbstractCegarLoop]: Abstraction has 94176 states and 129677 transitions. [2019-09-08 08:08:58,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:08:58,608 INFO L276 IsEmpty]: Start isEmpty. Operand 94176 states and 129677 transitions. [2019-09-08 08:08:58,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-08 08:08:58,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:08:58,642 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:08:58,642 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:08:58,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:08:58,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1797515352, now seen corresponding path program 1 times [2019-09-08 08:08:58,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:08:58,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:08:58,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:08:58,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:08:58,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:08:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:08:58,765 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:08:58,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 08:08:58,765 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:08:58,786 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:08:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:08:59,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 1500 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-08 08:08:59,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 08:08:59,697 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:08:59,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 08:08:59,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [5] total 20 [2019-09-08 08:08:59,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 08:08:59,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 08:08:59,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2019-09-08 08:08:59,707 INFO L87 Difference]: Start difference. First operand 94176 states and 129677 transitions. Second operand 20 states. [2019-09-08 08:09:11,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:09:11,559 INFO L93 Difference]: Finished difference Result 162405 states and 223302 transitions. [2019-09-08 08:09:11,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-08 08:09:11,559 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 217 [2019-09-08 08:09:11,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:09:11,828 INFO L225 Difference]: With dead ends: 162405 [2019-09-08 08:09:11,829 INFO L226 Difference]: Without dead ends: 68371 [2019-09-08 08:09:11,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 227 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=730, Invalid=2240, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 08:09:12,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68371 states. [2019-09-08 08:09:17,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68371 to 65685. [2019-09-08 08:09:17,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65685 states. [2019-09-08 08:09:17,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65685 states to 65685 states and 89556 transitions. [2019-09-08 08:09:17,604 INFO L78 Accepts]: Start accepts. Automaton has 65685 states and 89556 transitions. Word has length 217 [2019-09-08 08:09:17,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:09:17,605 INFO L475 AbstractCegarLoop]: Abstraction has 65685 states and 89556 transitions. [2019-09-08 08:09:17,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 08:09:17,605 INFO L276 IsEmpty]: Start isEmpty. Operand 65685 states and 89556 transitions. [2019-09-08 08:09:17,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-08 08:09:17,635 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:09:17,636 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:09:17,636 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:09:17,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:09:17,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1142312121, now seen corresponding path program 1 times [2019-09-08 08:09:17,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:09:17,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:09:17,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:09:17,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:09:17,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:09:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:09:17,762 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:09:17,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 08:09:17,763 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 08:09:17,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:09:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:09:17,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 1503 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-08 08:09:17,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 08:09:18,540 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:09:18,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 08:09:18,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [5] total 21 [2019-09-08 08:09:18,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 08:09:18,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 08:09:18,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2019-09-08 08:09:18,547 INFO L87 Difference]: Start difference. First operand 65685 states and 89556 transitions. Second operand 21 states. [2019-09-08 08:09:34,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:09:34,162 INFO L93 Difference]: Finished difference Result 220247 states and 303041 transitions. [2019-09-08 08:09:34,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-08 08:09:34,162 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 219 [2019-09-08 08:09:34,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:09:34,638 INFO L225 Difference]: With dead ends: 220247 [2019-09-08 08:09:34,639 INFO L226 Difference]: Without dead ends: 154725 [2019-09-08 08:09:34,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=790, Invalid=2516, Unknown=0, NotChecked=0, Total=3306 [2019-09-08 08:09:34,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154725 states. [2019-09-08 08:09:46,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154725 to 151575. [2019-09-08 08:09:46,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151575 states. [2019-09-08 08:09:46,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151575 states to 151575 states and 206305 transitions. [2019-09-08 08:09:46,522 INFO L78 Accepts]: Start accepts. Automaton has 151575 states and 206305 transitions. Word has length 219 [2019-09-08 08:09:46,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:09:46,522 INFO L475 AbstractCegarLoop]: Abstraction has 151575 states and 206305 transitions. [2019-09-08 08:09:46,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 08:09:46,523 INFO L276 IsEmpty]: Start isEmpty. Operand 151575 states and 206305 transitions. [2019-09-08 08:09:46,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-08 08:09:46,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:09:46,555 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:09:46,555 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:09:46,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:09:46,556 INFO L82 PathProgramCache]: Analyzing trace with hash -998008839, now seen corresponding path program 1 times [2019-09-08 08:09:46,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:09:46,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:09:46,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:09:46,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:09:46,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:09:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:09:47,241 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:09:47,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 08:09:47,241 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) [2019-09-08 08:09:47,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 08:09:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:09:47,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 1503 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-08 08:09:47,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 08:09:48,156 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:09:48,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 08:09:48,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [5] total 25 [2019-09-08 08:09:48,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 08:09:48,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 08:09:48,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-09-08 08:09:48,164 INFO L87 Difference]: Start difference. First operand 151575 states and 206305 transitions. Second operand 25 states. [2019-09-08 08:10:19,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:10:19,814 INFO L93 Difference]: Finished difference Result 545535 states and 745793 transitions. [2019-09-08 08:10:19,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-08 08:10:19,814 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 219 [2019-09-08 08:10:19,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:10:20,929 INFO L225 Difference]: With dead ends: 545535 [2019-09-08 08:10:20,930 INFO L226 Difference]: Without dead ends: 394189 [2019-09-08 08:10:21,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1111 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1009, Invalid=3413, Unknown=0, NotChecked=0, Total=4422 [2019-09-08 08:10:27,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394189 states. [2019-09-08 08:10:54,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394189 to 385611. [2019-09-08 08:10:54,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385611 states. [2019-09-08 08:10:55,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385611 states to 385611 states and 520719 transitions. [2019-09-08 08:10:55,227 INFO L78 Accepts]: Start accepts. Automaton has 385611 states and 520719 transitions. Word has length 219 [2019-09-08 08:10:55,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:10:55,228 INFO L475 AbstractCegarLoop]: Abstraction has 385611 states and 520719 transitions. [2019-09-08 08:10:55,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 08:10:55,228 INFO L276 IsEmpty]: Start isEmpty. Operand 385611 states and 520719 transitions. [2019-09-08 08:10:55,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-08 08:10:55,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:10:55,294 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:10:55,295 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:10:55,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:10:55,295 INFO L82 PathProgramCache]: Analyzing trace with hash -259046237, now seen corresponding path program 1 times [2019-09-08 08:10:55,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:10:55,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:10:55,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:55,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:10:55,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:10:55,503 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:10:55,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 08:10:55,504 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:10:55,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:10:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:10:55,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 1501 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-08 08:10:55,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 08:10:56,399 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:10:56,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 08:10:56,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [5] total 22 [2019-09-08 08:10:56,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 08:10:56,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 08:10:56,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2019-09-08 08:10:56,407 INFO L87 Difference]: Start difference. First operand 385611 states and 520719 transitions. Second operand 22 states. [2019-09-08 08:12:05,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:12:05,490 INFO L93 Difference]: Finished difference Result 1257419 states and 1709285 transitions. [2019-09-08 08:12:05,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-08 08:12:05,491 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 219 [2019-09-08 08:12:05,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:12:08,409 INFO L225 Difference]: With dead ends: 1257419 [2019-09-08 08:12:08,409 INFO L226 Difference]: Without dead ends: 872105 [2019-09-08 08:12:08,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=976, Invalid=3056, Unknown=0, NotChecked=0, Total=4032 [2019-09-08 08:12:09,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872105 states. [2019-09-08 08:13:41,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872105 to 852231. [2019-09-08 08:13:41,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852231 states. [2019-09-08 08:13:44,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852231 states to 852231 states and 1144915 transitions. [2019-09-08 08:13:44,881 INFO L78 Accepts]: Start accepts. Automaton has 852231 states and 1144915 transitions. Word has length 219 [2019-09-08 08:13:44,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:44,882 INFO L475 AbstractCegarLoop]: Abstraction has 852231 states and 1144915 transitions. [2019-09-08 08:13:44,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 08:13:44,883 INFO L276 IsEmpty]: Start isEmpty. Operand 852231 states and 1144915 transitions. [2019-09-08 08:13:44,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-08 08:13:44,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:44,985 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:13:44,986 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:44,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:44,986 INFO L82 PathProgramCache]: Analyzing trace with hash -176127367, now seen corresponding path program 1 times [2019-09-08 08:13:44,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:44,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:44,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:44,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:44,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:45,605 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:13:45,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 08:13:45,606 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:13:45,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:45,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 1499 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-08 08:13:45,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 08:13:46,654 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:13:46,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 08:13:46,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [23] total 41 [2019-09-08 08:13:46,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-08 08:13:46,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-08 08:13:46,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1420, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 08:13:46,661 INFO L87 Difference]: Start difference. First operand 852231 states and 1144915 transitions. Second operand 41 states. [2019-09-08 08:13:46,922 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35