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_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 07:05:32,947 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 07:05:32,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 07:05:32,961 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 07:05:32,962 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 07:05:32,963 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 07:05:32,964 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 07:05:32,966 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 07:05:32,968 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 07:05:32,969 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 07:05:32,970 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 07:05:32,971 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 07:05:32,971 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 07:05:32,972 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 07:05:32,973 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 07:05:32,974 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 07:05:32,975 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 07:05:32,976 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 07:05:32,978 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 07:05:32,980 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 07:05:32,981 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 07:05:32,982 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 07:05:32,984 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 07:05:32,984 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 07:05:32,987 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 07:05:32,987 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 07:05:32,987 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 07:05:32,988 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 07:05:32,989 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 07:05:32,990 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 07:05:32,990 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 07:05:32,991 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 07:05:32,991 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 07:05:32,992 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 07:05:32,993 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 07:05:32,993 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 07:05:32,994 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 07:05:32,994 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 07:05:32,994 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 07:05:32,995 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 07:05:32,996 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 07:05:32,997 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 07:05:33,011 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 07:05:33,011 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 07:05:33,012 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 07:05:33,013 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 07:05:33,013 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 07:05:33,013 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 07:05:33,013 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 07:05:33,013 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 07:05:33,014 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 07:05:33,014 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 07:05:33,014 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 07:05:33,014 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 07:05:33,014 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 07:05:33,015 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 07:05:33,015 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 07:05:33,015 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 07:05:33,015 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 07:05:33,015 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 07:05:33,016 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 07:05:33,016 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 07:05:33,016 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 07:05:33,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 07:05:33,016 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 07:05:33,017 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 07:05:33,017 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 07:05:33,017 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 07:05:33,017 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 07:05:33,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 07:05:33,018 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 07:05:33,045 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 07:05:33,058 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 07:05:33,061 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 07:05:33,062 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 07:05:33,063 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 07:05:33,063 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c [2019-09-08 07:05:33,123 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c01ab4144/369076fa40c64e4e8fc414231a4b7476/FLAG075db7e08 [2019-09-08 07:05:33,627 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 07:05:33,629 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c [2019-09-08 07:05:33,644 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c01ab4144/369076fa40c64e4e8fc414231a4b7476/FLAG075db7e08 [2019-09-08 07:05:33,935 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c01ab4144/369076fa40c64e4e8fc414231a4b7476 [2019-09-08 07:05:33,947 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 07:05:33,949 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 07:05:33,951 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 07:05:33,951 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 07:05:33,955 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 07:05:33,956 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:05:33" (1/1) ... [2019-09-08 07:05:33,959 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a5d63e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:05:33, skipping insertion in model container [2019-09-08 07:05:33,960 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:05:33" (1/1) ... [2019-09-08 07:05:33,968 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 07:05:34,010 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 07:05:34,420 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:05:34,429 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 07:05:34,494 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:05:34,517 INFO L192 MainTranslator]: Completed translation [2019-09-08 07:05:34,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:05:34 WrapperNode [2019-09-08 07:05:34,518 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 07:05:34,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 07:05:34,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 07:05:34,519 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 07:05:34,531 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:05:34" (1/1) ... [2019-09-08 07:05:34,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:05:34" (1/1) ... [2019-09-08 07:05:34,542 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:05:34" (1/1) ... [2019-09-08 07:05:34,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:05:34" (1/1) ... [2019-09-08 07:05:34,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:05:34" (1/1) ... [2019-09-08 07:05:34,585 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:05:34" (1/1) ... [2019-09-08 07:05:34,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:05:34" (1/1) ... [2019-09-08 07:05:34,596 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 07:05:34,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 07:05:34,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 07:05:34,597 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 07:05:34,598 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:05:34" (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 07:05:34,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 07:05:34,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 07:05:34,656 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2019-09-08 07:05:34,656 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2019-09-08 07:05:34,656 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2019-09-08 07:05:34,657 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_int8 [2019-09-08 07:05:34,657 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2019-09-08 07:05:34,657 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 07:05:34,657 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 07:05:34,657 INFO L138 BoogieDeclarations]: Found implementation of procedure gate1_each_pals_period [2019-09-08 07:05:34,658 INFO L138 BoogieDeclarations]: Found implementation of procedure gate2_each_pals_period [2019-09-08 07:05:34,658 INFO L138 BoogieDeclarations]: Found implementation of procedure gate3_each_pals_period [2019-09-08 07:05:34,658 INFO L138 BoogieDeclarations]: Found implementation of procedure voter [2019-09-08 07:05:34,658 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 07:05:34,658 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 07:05:34,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 07:05:34,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 07:05:34,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 07:05:34,659 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 07:05:34,659 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 07:05:34,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 07:05:34,660 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 07:05:34,660 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2019-09-08 07:05:34,660 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2019-09-08 07:05:34,660 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2019-09-08 07:05:34,660 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_int8 [2019-09-08 07:05:34,660 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2019-09-08 07:05:34,661 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 07:05:34,661 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 07:05:34,661 INFO L130 BoogieDeclarations]: Found specification of procedure gate1_each_pals_period [2019-09-08 07:05:34,661 INFO L130 BoogieDeclarations]: Found specification of procedure gate2_each_pals_period [2019-09-08 07:05:34,661 INFO L130 BoogieDeclarations]: Found specification of procedure gate3_each_pals_period [2019-09-08 07:05:34,661 INFO L130 BoogieDeclarations]: Found specification of procedure voter [2019-09-08 07:05:34,662 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 07:05:34,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 07:05:34,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 07:05:35,437 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 07:05:35,438 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-08 07:05:35,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:05:35 BoogieIcfgContainer [2019-09-08 07:05:35,440 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 07:05:35,441 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 07:05:35,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 07:05:35,445 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 07:05:35,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 07:05:33" (1/3) ... [2019-09-08 07:05:35,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c30be09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:05:35, skipping insertion in model container [2019-09-08 07:05:35,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:05:34" (2/3) ... [2019-09-08 07:05:35,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c30be09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:05:35, skipping insertion in model container [2019-09-08 07:05:35,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:05:35" (3/3) ... [2019-09-08 07:05:35,449 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c [2019-09-08 07:05:35,459 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 07:05:35,466 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 07:05:35,484 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 07:05:35,515 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 07:05:35,516 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 07:05:35,516 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 07:05:35,516 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 07:05:35,517 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 07:05:35,517 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 07:05:35,517 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 07:05:35,517 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 07:05:35,517 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 07:05:35,541 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2019-09-08 07:05:35,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-08 07:05:35,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:35,550 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] [2019-09-08 07:05:35,552 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:35,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:35,558 INFO L82 PathProgramCache]: Analyzing trace with hash 439318879, now seen corresponding path program 1 times [2019-09-08 07:05:35,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:35,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:35,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:35,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:35,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:35,801 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 07:05:35,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:35,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:05:35,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:05:35,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:05:35,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:35,823 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 4 states. [2019-09-08 07:05:36,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:36,004 INFO L93 Difference]: Finished difference Result 410 states and 669 transitions. [2019-09-08 07:05:36,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:05:36,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-09-08 07:05:36,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:36,021 INFO L225 Difference]: With dead ends: 410 [2019-09-08 07:05:36,022 INFO L226 Difference]: Without dead ends: 211 [2019-09-08 07:05:36,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:05:36,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-08 07:05:36,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2019-09-08 07:05:36,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-09-08 07:05:36,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 311 transitions. [2019-09-08 07:05:36,134 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 311 transitions. Word has length 21 [2019-09-08 07:05:36,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:36,135 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 311 transitions. [2019-09-08 07:05:36,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:05:36,135 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 311 transitions. [2019-09-08 07:05:36,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-08 07:05:36,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:36,138 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] [2019-09-08 07:05:36,139 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:36,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:36,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1455554404, now seen corresponding path program 1 times [2019-09-08 07:05:36,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:36,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:36,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:36,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:36,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:36,266 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 07:05:36,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:36,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:05:36,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:05:36,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:05:36,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:36,269 INFO L87 Difference]: Start difference. First operand 209 states and 311 transitions. Second operand 4 states. [2019-09-08 07:05:36,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:36,346 INFO L93 Difference]: Finished difference Result 425 states and 639 transitions. [2019-09-08 07:05:36,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:05:36,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-09-08 07:05:36,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:36,350 INFO L225 Difference]: With dead ends: 425 [2019-09-08 07:05:36,351 INFO L226 Difference]: Without dead ends: 225 [2019-09-08 07:05:36,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:05:36,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-09-08 07:05:36,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2019-09-08 07:05:36,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-09-08 07:05:36,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 327 transitions. [2019-09-08 07:05:36,383 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 327 transitions. Word has length 22 [2019-09-08 07:05:36,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:36,383 INFO L475 AbstractCegarLoop]: Abstraction has 222 states and 327 transitions. [2019-09-08 07:05:36,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:05:36,384 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 327 transitions. [2019-09-08 07:05:36,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-08 07:05:36,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:36,386 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 07:05:36,386 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:36,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:36,387 INFO L82 PathProgramCache]: Analyzing trace with hash 971437215, now seen corresponding path program 1 times [2019-09-08 07:05:36,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:36,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:36,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:36,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:36,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:36,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:05:36,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:36,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 07:05:36,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 07:05:36,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 07:05:36,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 07:05:36,448 INFO L87 Difference]: Start difference. First operand 222 states and 327 transitions. Second operand 3 states. [2019-09-08 07:05:36,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:36,474 INFO L93 Difference]: Finished difference Result 457 states and 685 transitions. [2019-09-08 07:05:36,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 07:05:36,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-08 07:05:36,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:36,478 INFO L225 Difference]: With dead ends: 457 [2019-09-08 07:05:36,478 INFO L226 Difference]: Without dead ends: 251 [2019-09-08 07:05:36,479 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 07:05:36,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-09-08 07:05:36,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 224. [2019-09-08 07:05:36,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-08 07:05:36,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 329 transitions. [2019-09-08 07:05:36,500 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 329 transitions. Word has length 30 [2019-09-08 07:05:36,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:36,501 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 329 transitions. [2019-09-08 07:05:36,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 07:05:36,501 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 329 transitions. [2019-09-08 07:05:36,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-08 07:05:36,503 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:36,503 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 07:05:36,503 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:36,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:36,504 INFO L82 PathProgramCache]: Analyzing trace with hash -58774386, now seen corresponding path program 1 times [2019-09-08 07:05:36,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:36,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:36,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:36,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:36,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:36,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:05:36,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:36,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:05:36,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:05:36,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:05:36,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:05:36,610 INFO L87 Difference]: Start difference. First operand 224 states and 329 transitions. Second operand 5 states. [2019-09-08 07:05:36,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:36,648 INFO L93 Difference]: Finished difference Result 434 states and 643 transitions. [2019-09-08 07:05:36,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:05:36,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-09-08 07:05:36,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:36,651 INFO L225 Difference]: With dead ends: 434 [2019-09-08 07:05:36,652 INFO L226 Difference]: Without dead ends: 232 [2019-09-08 07:05:36,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:05:36,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-09-08 07:05:36,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 228. [2019-09-08 07:05:36,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-09-08 07:05:36,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 333 transitions. [2019-09-08 07:05:36,670 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 333 transitions. Word has length 38 [2019-09-08 07:05:36,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:36,671 INFO L475 AbstractCegarLoop]: Abstraction has 228 states and 333 transitions. [2019-09-08 07:05:36,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:05:36,671 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 333 transitions. [2019-09-08 07:05:36,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-08 07:05:36,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:36,673 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] [2019-09-08 07:05:36,673 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:36,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:36,673 INFO L82 PathProgramCache]: Analyzing trace with hash 573440011, now seen corresponding path program 1 times [2019-09-08 07:05:36,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:36,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:36,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:36,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:36,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:36,756 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 07:05:36,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:36,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:05:36,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:05:36,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:05:36,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:36,760 INFO L87 Difference]: Start difference. First operand 228 states and 333 transitions. Second operand 4 states. [2019-09-08 07:05:36,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:36,794 INFO L93 Difference]: Finished difference Result 395 states and 582 transitions. [2019-09-08 07:05:36,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:05:36,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-09-08 07:05:36,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:36,799 INFO L225 Difference]: With dead ends: 395 [2019-09-08 07:05:36,799 INFO L226 Difference]: Without dead ends: 224 [2019-09-08 07:05:36,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:36,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-09-08 07:05:36,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2019-09-08 07:05:36,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-08 07:05:36,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 324 transitions. [2019-09-08 07:05:36,821 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 324 transitions. Word has length 39 [2019-09-08 07:05:36,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:36,821 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 324 transitions. [2019-09-08 07:05:36,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:05:36,822 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 324 transitions. [2019-09-08 07:05:36,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-08 07:05:36,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:36,825 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 07:05:36,825 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:36,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:36,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1074419851, now seen corresponding path program 1 times [2019-09-08 07:05:36,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:36,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:36,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:36,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:36,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:36,901 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 07:05:36,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:36,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:05:36,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:05:36,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:05:36,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:36,903 INFO L87 Difference]: Start difference. First operand 224 states and 324 transitions. Second operand 4 states. [2019-09-08 07:05:36,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:36,967 INFO L93 Difference]: Finished difference Result 444 states and 652 transitions. [2019-09-08 07:05:36,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:05:36,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-09-08 07:05:36,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:36,969 INFO L225 Difference]: With dead ends: 444 [2019-09-08 07:05:36,970 INFO L226 Difference]: Without dead ends: 243 [2019-09-08 07:05:36,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:05:36,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-09-08 07:05:36,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 240. [2019-09-08 07:05:36,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-09-08 07:05:36,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 343 transitions. [2019-09-08 07:05:36,993 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 343 transitions. Word has length 41 [2019-09-08 07:05:36,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:36,994 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 343 transitions. [2019-09-08 07:05:36,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:05:36,994 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 343 transitions. [2019-09-08 07:05:36,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-08 07:05:36,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:36,997 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 07:05:36,998 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:36,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:36,998 INFO L82 PathProgramCache]: Analyzing trace with hash 724098630, now seen corresponding path program 1 times [2019-09-08 07:05:36,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:36,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:37,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:37,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:37,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:37,053 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 07:05:37,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:37,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:05:37,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:05:37,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:05:37,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:37,056 INFO L87 Difference]: Start difference. First operand 240 states and 343 transitions. Second operand 4 states. [2019-09-08 07:05:37,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:37,132 INFO L93 Difference]: Finished difference Result 464 states and 680 transitions. [2019-09-08 07:05:37,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:05:37,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-09-08 07:05:37,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:37,137 INFO L225 Difference]: With dead ends: 464 [2019-09-08 07:05:37,137 INFO L226 Difference]: Without dead ends: 249 [2019-09-08 07:05:37,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:05:37,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-09-08 07:05:37,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 247. [2019-09-08 07:05:37,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-09-08 07:05:37,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 351 transitions. [2019-09-08 07:05:37,167 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 351 transitions. Word has length 41 [2019-09-08 07:05:37,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:37,167 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 351 transitions. [2019-09-08 07:05:37,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:05:37,168 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 351 transitions. [2019-09-08 07:05:37,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 07:05:37,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:37,171 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 07:05:37,172 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:37,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:37,173 INFO L82 PathProgramCache]: Analyzing trace with hash 876297553, now seen corresponding path program 1 times [2019-09-08 07:05:37,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:37,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:37,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:37,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:37,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:37,296 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 07:05:37,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:37,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:05:37,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:05:37,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:05:37,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:05:37,299 INFO L87 Difference]: Start difference. First operand 247 states and 351 transitions. Second operand 5 states. [2019-09-08 07:05:37,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:37,323 INFO L93 Difference]: Finished difference Result 463 states and 667 transitions. [2019-09-08 07:05:37,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:05:37,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-09-08 07:05:37,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:37,327 INFO L225 Difference]: With dead ends: 463 [2019-09-08 07:05:37,327 INFO L226 Difference]: Without dead ends: 249 [2019-09-08 07:05:37,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:05:37,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-09-08 07:05:37,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 247. [2019-09-08 07:05:37,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-09-08 07:05:37,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 350 transitions. [2019-09-08 07:05:37,341 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 350 transitions. Word has length 59 [2019-09-08 07:05:37,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:37,341 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 350 transitions. [2019-09-08 07:05:37,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:05:37,341 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 350 transitions. [2019-09-08 07:05:37,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 07:05:37,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:37,342 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 07:05:37,343 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:37,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:37,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1846133806, now seen corresponding path program 1 times [2019-09-08 07:05:37,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:37,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:37,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:37,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:37,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:37,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:37,388 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 07:05:37,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:37,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:05:37,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:05:37,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:05:37,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:37,390 INFO L87 Difference]: Start difference. First operand 247 states and 350 transitions. Second operand 4 states. [2019-09-08 07:05:37,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:37,442 INFO L93 Difference]: Finished difference Result 477 states and 689 transitions. [2019-09-08 07:05:37,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:05:37,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-08 07:05:37,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:37,446 INFO L225 Difference]: With dead ends: 477 [2019-09-08 07:05:37,446 INFO L226 Difference]: Without dead ends: 268 [2019-09-08 07:05:37,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:05:37,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-09-08 07:05:37,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 265. [2019-09-08 07:05:37,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-08 07:05:37,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 371 transitions. [2019-09-08 07:05:37,460 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 371 transitions. Word has length 62 [2019-09-08 07:05:37,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:37,460 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 371 transitions. [2019-09-08 07:05:37,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:05:37,460 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 371 transitions. [2019-09-08 07:05:37,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 07:05:37,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:37,461 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-09-08 07:05:37,462 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:37,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:37,462 INFO L82 PathProgramCache]: Analyzing trace with hash -44548726, now seen corresponding path program 1 times [2019-09-08 07:05:37,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:37,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:37,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:37,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:37,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:37,511 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 07:05:37,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:37,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:05:37,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:05:37,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:05:37,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:37,514 INFO L87 Difference]: Start difference. First operand 265 states and 371 transitions. Second operand 4 states. [2019-09-08 07:05:37,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:37,572 INFO L93 Difference]: Finished difference Result 484 states and 693 transitions. [2019-09-08 07:05:37,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:05:37,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-08 07:05:37,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:37,578 INFO L225 Difference]: With dead ends: 484 [2019-09-08 07:05:37,578 INFO L226 Difference]: Without dead ends: 259 [2019-09-08 07:05:37,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:05:37,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-09-08 07:05:37,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2019-09-08 07:05:37,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-09-08 07:05:37,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 357 transitions. [2019-09-08 07:05:37,595 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 357 transitions. Word has length 63 [2019-09-08 07:05:37,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:37,596 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 357 transitions. [2019-09-08 07:05:37,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:05:37,596 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 357 transitions. [2019-09-08 07:05:37,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 07:05:37,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:37,597 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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] [2019-09-08 07:05:37,598 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:37,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:37,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1125308013, now seen corresponding path program 1 times [2019-09-08 07:05:37,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:37,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:37,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:37,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:37,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:37,677 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 07:05:37,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:37,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:05:37,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:05:37,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:05:37,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:05:37,679 INFO L87 Difference]: Start difference. First operand 259 states and 357 transitions. Second operand 5 states. [2019-09-08 07:05:37,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:37,707 INFO L93 Difference]: Finished difference Result 471 states and 660 transitions. [2019-09-08 07:05:37,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:05:37,708 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-08 07:05:37,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:37,711 INFO L225 Difference]: With dead ends: 471 [2019-09-08 07:05:37,711 INFO L226 Difference]: Without dead ends: 261 [2019-09-08 07:05:37,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:05:37,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-09-08 07:05:37,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 259. [2019-09-08 07:05:37,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-09-08 07:05:37,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 356 transitions. [2019-09-08 07:05:37,726 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 356 transitions. Word has length 82 [2019-09-08 07:05:37,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:37,727 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 356 transitions. [2019-09-08 07:05:37,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:05:37,727 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 356 transitions. [2019-09-08 07:05:37,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 07:05:37,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:37,733 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 07:05:37,734 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:37,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:37,734 INFO L82 PathProgramCache]: Analyzing trace with hash -693579696, now seen corresponding path program 1 times [2019-09-08 07:05:37,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:37,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:37,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:37,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:37,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:37,819 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-09-08 07:05:37,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:37,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:05:37,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:05:37,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:05:37,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:37,821 INFO L87 Difference]: Start difference. First operand 259 states and 356 transitions. Second operand 4 states. [2019-09-08 07:05:37,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:37,879 INFO L93 Difference]: Finished difference Result 460 states and 658 transitions. [2019-09-08 07:05:37,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:05:37,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-09-08 07:05:37,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:37,881 INFO L225 Difference]: With dead ends: 460 [2019-09-08 07:05:37,882 INFO L226 Difference]: Without dead ends: 257 [2019-09-08 07:05:37,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:05:37,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-09-08 07:05:37,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2019-09-08 07:05:37,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-08 07:05:37,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 352 transitions. [2019-09-08 07:05:37,894 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 352 transitions. Word has length 85 [2019-09-08 07:05:37,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:37,894 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 352 transitions. [2019-09-08 07:05:37,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:05:37,894 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 352 transitions. [2019-09-08 07:05:37,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 07:05:37,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:37,898 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-09-08 07:05:37,898 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:37,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:37,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1340875375, now seen corresponding path program 1 times [2019-09-08 07:05:37,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:37,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:37,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:37,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:37,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:37,984 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 07:05:37,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:05:37,985 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 07:05:38,001 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 07:05:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:38,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 07:05:38,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:05:38,246 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-08 07:05:38,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:05:38,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-09-08 07:05:38,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:05:38,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:05:38,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:05:38,255 INFO L87 Difference]: Start difference. First operand 257 states and 352 transitions. Second operand 6 states. [2019-09-08 07:05:38,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:38,557 INFO L93 Difference]: Finished difference Result 610 states and 848 transitions. [2019-09-08 07:05:38,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 07:05:38,558 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-09-08 07:05:38,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:38,562 INFO L225 Difference]: With dead ends: 610 [2019-09-08 07:05:38,562 INFO L226 Difference]: Without dead ends: 296 [2019-09-08 07:05:38,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:05:38,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-08 07:05:38,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 266. [2019-09-08 07:05:38,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-08 07:05:38,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 353 transitions. [2019-09-08 07:05:38,592 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 353 transitions. Word has length 100 [2019-09-08 07:05:38,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:38,592 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 353 transitions. [2019-09-08 07:05:38,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:05:38,593 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 353 transitions. [2019-09-08 07:05:38,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 07:05:38,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:38,595 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 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] [2019-09-08 07:05:38,596 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:38,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:38,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1874453946, now seen corresponding path program 1 times [2019-09-08 07:05:38,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:38,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:38,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:38,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:38,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:38,718 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-09-08 07:05:38,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:38,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:05:38,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:05:38,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:05:38,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:05:38,721 INFO L87 Difference]: Start difference. First operand 266 states and 353 transitions. Second operand 5 states. [2019-09-08 07:05:38,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:38,746 INFO L93 Difference]: Finished difference Result 436 states and 596 transitions. [2019-09-08 07:05:38,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:05:38,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-08 07:05:38,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:38,750 INFO L225 Difference]: With dead ends: 436 [2019-09-08 07:05:38,750 INFO L226 Difference]: Without dead ends: 266 [2019-09-08 07:05:38,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:05:38,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-09-08 07:05:38,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-09-08 07:05:38,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-08 07:05:38,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 351 transitions. [2019-09-08 07:05:38,765 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 351 transitions. Word has length 144 [2019-09-08 07:05:38,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:38,765 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 351 transitions. [2019-09-08 07:05:38,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:05:38,766 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 351 transitions. [2019-09-08 07:05:38,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 07:05:38,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:38,769 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 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] [2019-09-08 07:05:38,770 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:38,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:38,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1418683508, now seen corresponding path program 1 times [2019-09-08 07:05:38,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:38,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:38,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:38,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:38,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:38,882 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-09-08 07:05:38,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:38,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:05:38,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:05:38,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:05:38,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:38,884 INFO L87 Difference]: Start difference. First operand 266 states and 351 transitions. Second operand 4 states. [2019-09-08 07:05:38,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:38,935 INFO L93 Difference]: Finished difference Result 435 states and 596 transitions. [2019-09-08 07:05:38,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:05:38,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-08 07:05:38,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:38,938 INFO L225 Difference]: With dead ends: 435 [2019-09-08 07:05:38,938 INFO L226 Difference]: Without dead ends: 272 [2019-09-08 07:05:38,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:05:38,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-08 07:05:38,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2019-09-08 07:05:38,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-09-08 07:05:38,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 354 transitions. [2019-09-08 07:05:38,958 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 354 transitions. Word has length 161 [2019-09-08 07:05:38,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:38,959 INFO L475 AbstractCegarLoop]: Abstraction has 270 states and 354 transitions. [2019-09-08 07:05:38,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:05:38,959 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 354 transitions. [2019-09-08 07:05:38,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 07:05:38,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:38,963 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 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] [2019-09-08 07:05:38,964 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:38,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:38,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1558201541, now seen corresponding path program 1 times [2019-09-08 07:05:38,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:38,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:38,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:38,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:38,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:39,068 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-09-08 07:05:39,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:39,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:05:39,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:05:39,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:05:39,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:39,073 INFO L87 Difference]: Start difference. First operand 270 states and 354 transitions. Second operand 4 states. [2019-09-08 07:05:39,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:39,117 INFO L93 Difference]: Finished difference Result 444 states and 603 transitions. [2019-09-08 07:05:39,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:05:39,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-09-08 07:05:39,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:39,122 INFO L225 Difference]: With dead ends: 444 [2019-09-08 07:05:39,123 INFO L226 Difference]: Without dead ends: 277 [2019-09-08 07:05:39,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:05:39,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-09-08 07:05:39,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 275. [2019-09-08 07:05:39,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-09-08 07:05:39,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 358 transitions. [2019-09-08 07:05:39,140 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 358 transitions. Word has length 173 [2019-09-08 07:05:39,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:39,142 INFO L475 AbstractCegarLoop]: Abstraction has 275 states and 358 transitions. [2019-09-08 07:05:39,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:05:39,143 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 358 transitions. [2019-09-08 07:05:39,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-08 07:05:39,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:39,147 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 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] [2019-09-08 07:05:39,147 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:39,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:39,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1857010675, now seen corresponding path program 1 times [2019-09-08 07:05:39,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:39,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:39,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:39,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:39,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:39,269 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2019-09-08 07:05:39,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:39,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:05:39,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:05:39,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:05:39,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:39,271 INFO L87 Difference]: Start difference. First operand 275 states and 358 transitions. Second operand 4 states. [2019-09-08 07:05:39,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:39,310 INFO L93 Difference]: Finished difference Result 446 states and 601 transitions. [2019-09-08 07:05:39,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:05:39,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-09-08 07:05:39,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:39,313 INFO L225 Difference]: With dead ends: 446 [2019-09-08 07:05:39,314 INFO L226 Difference]: Without dead ends: 274 [2019-09-08 07:05:39,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:05:39,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-09-08 07:05:39,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2019-09-08 07:05:39,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-09-08 07:05:39,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 353 transitions. [2019-09-08 07:05:39,327 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 353 transitions. Word has length 186 [2019-09-08 07:05:39,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:39,329 INFO L475 AbstractCegarLoop]: Abstraction has 274 states and 353 transitions. [2019-09-08 07:05:39,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:05:39,330 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 353 transitions. [2019-09-08 07:05:39,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-08 07:05:39,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:39,333 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-09-08 07:05:39,333 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:39,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:39,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1363724559, now seen corresponding path program 1 times [2019-09-08 07:05:39,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:39,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:39,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:39,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:39,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:39,462 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-09-08 07:05:39,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:39,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:05:39,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:05:39,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:05:39,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:39,465 INFO L87 Difference]: Start difference. First operand 274 states and 353 transitions. Second operand 4 states. [2019-09-08 07:05:39,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:39,497 INFO L93 Difference]: Finished difference Result 444 states and 591 transitions. [2019-09-08 07:05:39,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:05:39,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2019-09-08 07:05:39,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:39,501 INFO L225 Difference]: With dead ends: 444 [2019-09-08 07:05:39,501 INFO L226 Difference]: Without dead ends: 273 [2019-09-08 07:05:39,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:05:39,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-09-08 07:05:39,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2019-09-08 07:05:39,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-09-08 07:05:39,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 350 transitions. [2019-09-08 07:05:39,535 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 350 transitions. Word has length 200 [2019-09-08 07:05:39,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:39,536 INFO L475 AbstractCegarLoop]: Abstraction has 273 states and 350 transitions. [2019-09-08 07:05:39,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:05:39,536 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 350 transitions. [2019-09-08 07:05:39,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-08 07:05:39,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:39,539 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-09-08 07:05:39,539 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:39,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:39,540 INFO L82 PathProgramCache]: Analyzing trace with hash -609253146, now seen corresponding path program 1 times [2019-09-08 07:05:39,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:39,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:39,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:39,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:39,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:39,641 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-09-08 07:05:39,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:39,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:05:39,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:05:39,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:05:39,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:39,643 INFO L87 Difference]: Start difference. First operand 273 states and 350 transitions. Second operand 4 states. [2019-09-08 07:05:40,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:40,119 INFO L93 Difference]: Finished difference Result 762 states and 1025 transitions. [2019-09-08 07:05:40,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:05:40,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2019-09-08 07:05:40,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:40,127 INFO L225 Difference]: With dead ends: 762 [2019-09-08 07:05:40,127 INFO L226 Difference]: Without dead ends: 592 [2019-09-08 07:05:40,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:05:40,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-09-08 07:05:40,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 456. [2019-09-08 07:05:40,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-09-08 07:05:40,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 610 transitions. [2019-09-08 07:05:40,162 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 610 transitions. Word has length 200 [2019-09-08 07:05:40,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:40,165 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 610 transitions. [2019-09-08 07:05:40,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:05:40,165 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 610 transitions. [2019-09-08 07:05:40,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 07:05:40,174 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:40,174 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-09-08 07:05:40,175 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:40,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:40,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1427424983, now seen corresponding path program 1 times [2019-09-08 07:05:40,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:40,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:40,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:40,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:40,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:40,372 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-09-08 07:05:40,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:40,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:05:40,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:05:40,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:05:40,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:40,374 INFO L87 Difference]: Start difference. First operand 456 states and 610 transitions. Second operand 4 states. [2019-09-08 07:05:40,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:40,668 INFO L93 Difference]: Finished difference Result 1172 states and 1615 transitions. [2019-09-08 07:05:40,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:05:40,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 237 [2019-09-08 07:05:40,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:40,681 INFO L225 Difference]: With dead ends: 1172 [2019-09-08 07:05:40,682 INFO L226 Difference]: Without dead ends: 819 [2019-09-08 07:05:40,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:40,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2019-09-08 07:05:40,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 805. [2019-09-08 07:05:40,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2019-09-08 07:05:40,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1088 transitions. [2019-09-08 07:05:40,750 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1088 transitions. Word has length 237 [2019-09-08 07:05:40,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:40,751 INFO L475 AbstractCegarLoop]: Abstraction has 805 states and 1088 transitions. [2019-09-08 07:05:40,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:05:40,752 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1088 transitions. [2019-09-08 07:05:40,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-08 07:05:40,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:40,758 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-09-08 07:05:40,758 INFO L418 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:40,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:40,758 INFO L82 PathProgramCache]: Analyzing trace with hash -115278822, now seen corresponding path program 1 times [2019-09-08 07:05:40,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:40,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:40,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:40,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:40,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:40,919 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-09-08 07:05:40,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:40,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:05:40,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:05:40,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:05:40,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:40,920 INFO L87 Difference]: Start difference. First operand 805 states and 1088 transitions. Second operand 4 states. [2019-09-08 07:05:41,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:41,231 INFO L93 Difference]: Finished difference Result 2147 states and 2972 transitions. [2019-09-08 07:05:41,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:05:41,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2019-09-08 07:05:41,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:41,243 INFO L225 Difference]: With dead ends: 2147 [2019-09-08 07:05:41,244 INFO L226 Difference]: Without dead ends: 1472 [2019-09-08 07:05:41,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:41,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2019-09-08 07:05:41,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1111. [2019-09-08 07:05:41,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2019-09-08 07:05:41,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1514 transitions. [2019-09-08 07:05:41,323 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1514 transitions. Word has length 238 [2019-09-08 07:05:41,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:41,324 INFO L475 AbstractCegarLoop]: Abstraction has 1111 states and 1514 transitions. [2019-09-08 07:05:41,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:05:41,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1514 transitions. [2019-09-08 07:05:41,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 07:05:41,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:41,331 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-09-08 07:05:41,331 INFO L418 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:41,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:41,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1013689329, now seen corresponding path program 1 times [2019-09-08 07:05:41,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:41,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:41,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:41,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:41,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:41,509 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2019-09-08 07:05:41,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:05:41,510 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 07:05:41,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:41,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 1232 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 07:05:41,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:05:41,806 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 96 proven. 8 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream Closed [2019-09-08 07:05:41,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:05:41,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-08 07:05:41,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 07:05:41,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 07:05:41,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:05:41,825 INFO L87 Difference]: Start difference. First operand 1111 states and 1514 transitions. Second operand 10 states. [2019-09-08 07:05:42,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:42,121 INFO L93 Difference]: Finished difference Result 2290 states and 3151 transitions. [2019-09-08 07:05:42,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 07:05:42,123 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 239 [2019-09-08 07:05:42,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:42,131 INFO L225 Difference]: With dead ends: 2290 [2019-09-08 07:05:42,131 INFO L226 Difference]: Without dead ends: 1138 [2019-09-08 07:05:42,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:05:42,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2019-09-08 07:05:42,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2019-09-08 07:05:42,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2019-09-08 07:05:42,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1512 transitions. [2019-09-08 07:05:42,222 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1512 transitions. Word has length 239 [2019-09-08 07:05:42,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:42,223 INFO L475 AbstractCegarLoop]: Abstraction has 1138 states and 1512 transitions. [2019-09-08 07:05:42,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 07:05:42,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1512 transitions. [2019-09-08 07:05:42,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-09-08 07:05:42,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:42,231 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 07:05:42,231 INFO L418 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:42,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:42,232 INFO L82 PathProgramCache]: Analyzing trace with hash -671312158, now seen corresponding path program 1 times [2019-09-08 07:05:42,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:42,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:42,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:42,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:42,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:42,454 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2019-09-08 07:05:42,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:05:42,456 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 07:05:42,480 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 07:05:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:42,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 1356 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 07:05:42,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:05:42,773 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2019-09-08 07:05:42,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:05:42,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-09-08 07:05:42,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 07:05:42,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 07:05:42,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:05:42,787 INFO L87 Difference]: Start difference. First operand 1138 states and 1512 transitions. Second operand 9 states. [2019-09-08 07:05:42,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:42,949 INFO L93 Difference]: Finished difference Result 2199 states and 3032 transitions. [2019-09-08 07:05:42,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 07:05:42,949 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 293 [2019-09-08 07:05:42,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:42,958 INFO L225 Difference]: With dead ends: 2199 [2019-09-08 07:05:42,958 INFO L226 Difference]: Without dead ends: 1182 [2019-09-08 07:05:42,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:05:42,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2019-09-08 07:05:43,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1182. [2019-09-08 07:05:43,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1182 states. [2019-09-08 07:05:43,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1545 transitions. [2019-09-08 07:05:43,033 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1545 transitions. Word has length 293 [2019-09-08 07:05:43,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:43,034 INFO L475 AbstractCegarLoop]: Abstraction has 1182 states and 1545 transitions. [2019-09-08 07:05:43,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 07:05:43,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1545 transitions. [2019-09-08 07:05:43,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-08 07:05:43,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:43,045 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 07:05:43,046 INFO L418 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:43,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:43,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1000522157, now seen corresponding path program 1 times [2019-09-08 07:05:43,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:43,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:43,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:43,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:43,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:43,344 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-09-08 07:05:43,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:05:43,345 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) [2019-09-08 07:05:43,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:05:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:43,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 1357 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 07:05:43,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:05:43,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 07:05:43,697 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2019-09-08 07:05:43,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:05:43,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 15 [2019-09-08 07:05:43,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 07:05:43,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 07:05:43,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-09-08 07:05:43,712 INFO L87 Difference]: Start difference. First operand 1182 states and 1545 transitions. Second operand 15 states. [2019-09-08 07:05:43,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:43,891 INFO L93 Difference]: Finished difference Result 1243 states and 1652 transitions. [2019-09-08 07:05:43,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 07:05:43,892 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 294 [2019-09-08 07:05:43,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:43,904 INFO L225 Difference]: With dead ends: 1243 [2019-09-08 07:05:43,904 INFO L226 Difference]: Without dead ends: 1241 [2019-09-08 07:05:43,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 290 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-09-08 07:05:43,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2019-09-08 07:05:43,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1206. [2019-09-08 07:05:43,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1206 states. [2019-09-08 07:05:43,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 1572 transitions. [2019-09-08 07:05:43,980 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 1572 transitions. Word has length 294 [2019-09-08 07:05:43,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:43,980 INFO L475 AbstractCegarLoop]: Abstraction has 1206 states and 1572 transitions. [2019-09-08 07:05:43,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 07:05:43,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1572 transitions. [2019-09-08 07:05:43,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-08 07:05:43,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:43,990 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 07:05:43,990 INFO L418 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:43,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:43,991 INFO L82 PathProgramCache]: Analyzing trace with hash 220996093, now seen corresponding path program 1 times [2019-09-08 07:05:43,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:43,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:43,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:43,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:43,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:44,322 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 142 proven. 27 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2019-09-08 07:05:44,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:05:44,323 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 07:05:44,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:44,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 1381 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 07:05:44,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:05:44,899 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 251 proven. 33 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-08 07:05:44,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:05:44,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2019-09-08 07:05:44,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 07:05:44,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 07:05:44,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2019-09-08 07:05:44,916 INFO L87 Difference]: Start difference. First operand 1206 states and 1572 transitions. Second operand 21 states. [2019-09-08 07:05:51,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:51,173 INFO L93 Difference]: Finished difference Result 4389 states and 5873 transitions. [2019-09-08 07:05:51,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 07:05:51,178 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 302 [2019-09-08 07:05:51,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:51,200 INFO L225 Difference]: With dead ends: 4389 [2019-09-08 07:05:51,200 INFO L226 Difference]: Without dead ends: 3339 [2019-09-08 07:05:51,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=194, Invalid=1446, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 07:05:51,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2019-09-08 07:05:51,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 2904. [2019-09-08 07:05:51,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2904 states. [2019-09-08 07:05:51,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2904 states to 2904 states and 3860 transitions. [2019-09-08 07:05:51,370 INFO L78 Accepts]: Start accepts. Automaton has 2904 states and 3860 transitions. Word has length 302 [2019-09-08 07:05:51,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:51,370 INFO L475 AbstractCegarLoop]: Abstraction has 2904 states and 3860 transitions. [2019-09-08 07:05:51,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 07:05:51,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2904 states and 3860 transitions. [2019-09-08 07:05:51,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-08 07:05:51,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:51,381 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 07:05:51,382 INFO L418 AbstractCegarLoop]: === Iteration 26 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:51,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:51,382 INFO L82 PathProgramCache]: Analyzing trace with hash 914097790, now seen corresponding path program 1 times [2019-09-08 07:05:51,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:51,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:51,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:51,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:51,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:51,529 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2019-09-08 07:05:51,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:05:51,530 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:05:51,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:51,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 07:05:51,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:05:51,862 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2019-09-08 07:05:51,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:05:51,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2019-09-08 07:05:51,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:05:51,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:05:51,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:05:51,874 INFO L87 Difference]: Start difference. First operand 2904 states and 3860 transitions. Second operand 4 states. [2019-09-08 07:05:51,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:51,991 INFO L93 Difference]: Finished difference Result 4611 states and 6008 transitions. [2019-09-08 07:05:51,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:05:51,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 302 [2019-09-08 07:05:51,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:52,006 INFO L225 Difference]: With dead ends: 4611 [2019-09-08 07:05:52,006 INFO L226 Difference]: Without dead ends: 2391 [2019-09-08 07:05:52,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:05:52,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2019-09-08 07:05:52,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 2391. [2019-09-08 07:05:52,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2391 states. [2019-09-08 07:05:52,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2391 states to 2391 states and 3029 transitions. [2019-09-08 07:05:52,117 INFO L78 Accepts]: Start accepts. Automaton has 2391 states and 3029 transitions. Word has length 302 [2019-09-08 07:05:52,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:52,117 INFO L475 AbstractCegarLoop]: Abstraction has 2391 states and 3029 transitions. [2019-09-08 07:05:52,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:05:52,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2391 states and 3029 transitions. [2019-09-08 07:05:52,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-08 07:05:52,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:52,128 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 07:05:52,129 INFO L418 AbstractCegarLoop]: === Iteration 27 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:52,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:52,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1092621299, now seen corresponding path program 1 times [2019-09-08 07:05:52,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:52,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:52,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:52,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:52,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:52,307 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-09-08 07:05:52,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:05:52,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 07:05:52,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 07:05:52,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 07:05:52,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:05:52,309 INFO L87 Difference]: Start difference. First operand 2391 states and 3029 transitions. Second operand 10 states. [2019-09-08 07:05:52,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:52,864 INFO L93 Difference]: Finished difference Result 5136 states and 6586 transitions. [2019-09-08 07:05:52,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 07:05:52,864 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 317 [2019-09-08 07:05:52,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:52,883 INFO L225 Difference]: With dead ends: 5136 [2019-09-08 07:05:52,883 INFO L226 Difference]: Without dead ends: 3648 [2019-09-08 07:05:52,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-09-08 07:05:52,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3648 states. [2019-09-08 07:05:53,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3648 to 3306. [2019-09-08 07:05:53,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3306 states. [2019-09-08 07:05:53,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3306 states to 3306 states and 4228 transitions. [2019-09-08 07:05:53,050 INFO L78 Accepts]: Start accepts. Automaton has 3306 states and 4228 transitions. Word has length 317 [2019-09-08 07:05:53,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:53,051 INFO L475 AbstractCegarLoop]: Abstraction has 3306 states and 4228 transitions. [2019-09-08 07:05:53,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 07:05:53,051 INFO L276 IsEmpty]: Start isEmpty. Operand 3306 states and 4228 transitions. [2019-09-08 07:05:53,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-08 07:05:53,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:53,057 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 07:05:53,057 INFO L418 AbstractCegarLoop]: === Iteration 28 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:53,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:53,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1293888207, now seen corresponding path program 1 times [2019-09-08 07:05:53,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:53,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:53,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:53,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:53,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:53,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:53,305 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-09-08 07:05:53,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:05:53,306 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:05:53,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:05:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:53,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 1427 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 07:05:53,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:05:53,614 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2019-09-08 07:05:53,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:05:53,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2019-09-08 07:05:53,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 07:05:53,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 07:05:53,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-08 07:05:53,620 INFO L87 Difference]: Start difference. First operand 3306 states and 4228 transitions. Second operand 14 states. [2019-09-08 07:05:57,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:57,915 INFO L93 Difference]: Finished difference Result 5907 states and 7499 transitions. [2019-09-08 07:05:57,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 07:05:57,924 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 317 [2019-09-08 07:05:57,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:57,943 INFO L225 Difference]: With dead ends: 5907 [2019-09-08 07:05:57,943 INFO L226 Difference]: Without dead ends: 3333 [2019-09-08 07:05:57,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=1028, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 07:05:57,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3333 states. [2019-09-08 07:05:58,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3333 to 2667. [2019-09-08 07:05:58,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2667 states. [2019-09-08 07:05:58,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2667 states to 2667 states and 3290 transitions. [2019-09-08 07:05:58,075 INFO L78 Accepts]: Start accepts. Automaton has 2667 states and 3290 transitions. Word has length 317 [2019-09-08 07:05:58,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:58,075 INFO L475 AbstractCegarLoop]: Abstraction has 2667 states and 3290 transitions. [2019-09-08 07:05:58,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 07:05:58,075 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 3290 transitions. [2019-09-08 07:05:58,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-08 07:05:58,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:58,083 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 07:05:58,083 INFO L418 AbstractCegarLoop]: === Iteration 29 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:58,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:58,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1399334493, now seen corresponding path program 1 times [2019-09-08 07:05:58,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:58,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:58,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:58,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:58,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:58,272 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-09-08 07:05:58,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:05:58,273 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:05:58,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:58,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 1429 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-08 07:05:58,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:05:58,863 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2019-09-08 07:05:58,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:05:58,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [10] total 19 [2019-09-08 07:05:58,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 07:05:58,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 07:05:58,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-09-08 07:05:58,876 INFO L87 Difference]: Start difference. First operand 2667 states and 3290 transitions. Second operand 19 states. [2019-09-08 07:06:05,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:06:05,908 INFO L93 Difference]: Finished difference Result 5365 states and 6659 transitions. [2019-09-08 07:06:05,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 07:06:05,909 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 318 [2019-09-08 07:06:05,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:06:05,922 INFO L225 Difference]: With dead ends: 5365 [2019-09-08 07:06:05,922 INFO L226 Difference]: Without dead ends: 3232 [2019-09-08 07:06:05,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=320, Invalid=2542, Unknown=0, NotChecked=0, Total=2862 [2019-09-08 07:06:05,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2019-09-08 07:06:06,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 2661. [2019-09-08 07:06:06,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2661 states. [2019-09-08 07:06:06,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2661 states to 2661 states and 3248 transitions. [2019-09-08 07:06:06,048 INFO L78 Accepts]: Start accepts. Automaton has 2661 states and 3248 transitions. Word has length 318 [2019-09-08 07:06:06,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:06:06,049 INFO L475 AbstractCegarLoop]: Abstraction has 2661 states and 3248 transitions. [2019-09-08 07:06:06,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 07:06:06,049 INFO L276 IsEmpty]: Start isEmpty. Operand 2661 states and 3248 transitions. [2019-09-08 07:06:06,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-09-08 07:06:06,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:06:06,054 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 07:06:06,054 INFO L418 AbstractCegarLoop]: === Iteration 30 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:06:06,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:06:06,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1744104081, now seen corresponding path program 1 times [2019-09-08 07:06:06,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:06:06,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:06:06,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:06:06,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:06:06,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:06:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:06:06,195 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2019-09-08 07:06:06,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:06:06,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:06:06,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:06:06,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:06:06,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:06:06,196 INFO L87 Difference]: Start difference. First operand 2661 states and 3248 transitions. Second operand 6 states. [2019-09-08 07:06:06,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:06:06,457 INFO L93 Difference]: Finished difference Result 6474 states and 8562 transitions. [2019-09-08 07:06:06,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 07:06:06,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 323 [2019-09-08 07:06:06,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:06:06,475 INFO L225 Difference]: With dead ends: 6474 [2019-09-08 07:06:06,476 INFO L226 Difference]: Without dead ends: 4458 [2019-09-08 07:06:06,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:06:06,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4458 states. [2019-09-08 07:06:06,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4458 to 3066. [2019-09-08 07:06:06,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3066 states. [2019-09-08 07:06:06,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3066 states to 3066 states and 3887 transitions. [2019-09-08 07:06:06,656 INFO L78 Accepts]: Start accepts. Automaton has 3066 states and 3887 transitions. Word has length 323 [2019-09-08 07:06:06,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:06:06,657 INFO L475 AbstractCegarLoop]: Abstraction has 3066 states and 3887 transitions. [2019-09-08 07:06:06,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:06:06,657 INFO L276 IsEmpty]: Start isEmpty. Operand 3066 states and 3887 transitions. [2019-09-08 07:06:06,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-09-08 07:06:06,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:06:06,662 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 07:06:06,662 INFO L418 AbstractCegarLoop]: === Iteration 31 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:06:06,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:06:06,663 INFO L82 PathProgramCache]: Analyzing trace with hash 163691499, now seen corresponding path program 1 times [2019-09-08 07:06:06,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:06:06,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:06:06,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:06:06,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:06:06,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:06:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:06:06,843 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2019-09-08 07:06:06,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:06:06,844 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:06:06,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:06:07,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:06:07,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 1439 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 07:06:07,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:06:07,269 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-09-08 07:06:07,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:06:07,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2019-09-08 07:06:07,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 07:06:07,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 07:06:07,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-09-08 07:06:07,278 INFO L87 Difference]: Start difference. First operand 3066 states and 3887 transitions. Second operand 17 states. [2019-09-08 07:06:10,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:06:10,667 INFO L93 Difference]: Finished difference Result 8484 states and 10833 transitions. [2019-09-08 07:06:10,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-08 07:06:10,667 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 323 [2019-09-08 07:06:10,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:06:10,690 INFO L225 Difference]: With dead ends: 8484 [2019-09-08 07:06:10,690 INFO L226 Difference]: Without dead ends: 6081 [2019-09-08 07:06:10,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 898 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=384, Invalid=3038, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 07:06:10,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6081 states. [2019-09-08 07:06:10,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6081 to 3276. [2019-09-08 07:06:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3276 states. [2019-09-08 07:06:10,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3276 states to 3276 states and 4001 transitions. [2019-09-08 07:06:10,882 INFO L78 Accepts]: Start accepts. Automaton has 3276 states and 4001 transitions. Word has length 323 [2019-09-08 07:06:10,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:06:10,883 INFO L475 AbstractCegarLoop]: Abstraction has 3276 states and 4001 transitions. [2019-09-08 07:06:10,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 07:06:10,884 INFO L276 IsEmpty]: Start isEmpty. Operand 3276 states and 4001 transitions. [2019-09-08 07:06:10,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-09-08 07:06:10,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:06:10,889 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 07:06:10,889 INFO L418 AbstractCegarLoop]: === Iteration 32 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:06:10,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:06:10,890 INFO L82 PathProgramCache]: Analyzing trace with hash 618758123, now seen corresponding path program 1 times [2019-09-08 07:06:10,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:06:10,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:06:10,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:06:10,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:06:10,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:06:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:06:11,658 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2019-09-08 07:06:11,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:06:11,659 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:06:11,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:06:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:06:11,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 1439 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-08 07:06:11,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:06:12,183 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2019-09-08 07:06:12,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:06:12,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [23] total 30 [2019-09-08 07:06:12,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 07:06:12,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 07:06:12,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=801, Unknown=0, NotChecked=0, Total=870 [2019-09-08 07:06:12,200 INFO L87 Difference]: Start difference. First operand 3276 states and 4001 transitions. Second operand 30 states. [2019-09-08 07:06:25,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:06:25,496 INFO L93 Difference]: Finished difference Result 8139 states and 9885 transitions. [2019-09-08 07:06:25,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-08 07:06:25,497 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 323 [2019-09-08 07:06:25,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:06:25,518 INFO L225 Difference]: With dead ends: 8139 [2019-09-08 07:06:25,518 INFO L226 Difference]: Without dead ends: 5766 [2019-09-08 07:06:25,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 330 SyntacticMatches, 3 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2747 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1207, Invalid=9095, Unknown=0, NotChecked=0, Total=10302 [2019-09-08 07:06:25,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5766 states. [2019-09-08 07:06:25,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5766 to 3441. [2019-09-08 07:06:25,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3441 states. [2019-09-08 07:06:25,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3441 states to 3441 states and 4151 transitions. [2019-09-08 07:06:25,810 INFO L78 Accepts]: Start accepts. Automaton has 3441 states and 4151 transitions. Word has length 323 [2019-09-08 07:06:25,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:06:25,811 INFO L475 AbstractCegarLoop]: Abstraction has 3441 states and 4151 transitions. [2019-09-08 07:06:25,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 07:06:25,811 INFO L276 IsEmpty]: Start isEmpty. Operand 3441 states and 4151 transitions. [2019-09-08 07:06:25,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-09-08 07:06:25,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:06:25,823 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 07:06:25,824 INFO L418 AbstractCegarLoop]: === Iteration 33 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:06:25,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:06:25,824 INFO L82 PathProgramCache]: Analyzing trace with hash -435739282, now seen corresponding path program 1 times [2019-09-08 07:06:25,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:06:25,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:06:25,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:06:25,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:06:25,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:06:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:06:26,230 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-08 07:06:26,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:06:26,230 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:06:26,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:06:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:06:26,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 1441 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 07:06:26,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:06:26,552 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 593 trivial. 0 not checked. [2019-09-08 07:06:26,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:06:26,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2019-09-08 07:06:26,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 07:06:26,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 07:06:26,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-09-08 07:06:26,558 INFO L87 Difference]: Start difference. First operand 3441 states and 4151 transitions. Second operand 15 states. [2019-09-08 07:06:34,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:06:34,898 INFO L93 Difference]: Finished difference Result 7725 states and 9429 transitions. [2019-09-08 07:06:34,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-08 07:06:34,899 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 325 [2019-09-08 07:06:34,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:06:34,918 INFO L225 Difference]: With dead ends: 7725 [2019-09-08 07:06:34,918 INFO L226 Difference]: Without dead ends: 4911 [2019-09-08 07:06:34,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=305, Invalid=2347, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 07:06:34,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4911 states. [2019-09-08 07:06:35,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4911 to 2868. [2019-09-08 07:06:35,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2868 states. [2019-09-08 07:06:35,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2868 states to 2868 states and 3433 transitions. [2019-09-08 07:06:35,092 INFO L78 Accepts]: Start accepts. Automaton has 2868 states and 3433 transitions. Word has length 325 [2019-09-08 07:06:35,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:06:35,093 INFO L475 AbstractCegarLoop]: Abstraction has 2868 states and 3433 transitions. [2019-09-08 07:06:35,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 07:06:35,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2868 states and 3433 transitions. [2019-09-08 07:06:35,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-09-08 07:06:35,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:06:35,101 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-09-08 07:06:35,101 INFO L418 AbstractCegarLoop]: === Iteration 34 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:06:35,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:06:35,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1466593770, now seen corresponding path program 1 times [2019-09-08 07:06:35,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:06:35,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:06:35,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:06:35,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:06:35,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:06:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:06:35,615 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2019-09-08 07:06:35,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:06:35,616 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:06:35,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:06:35,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:06:36,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 1925 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-08 07:06:36,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:06:36,500 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 228 proven. 96 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-09-08 07:06:36,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:06:36,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2019-09-08 07:06:36,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 07:06:36,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 07:06:36,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-09-08 07:06:36,516 INFO L87 Difference]: Start difference. First operand 2868 states and 3433 transitions. Second operand 25 states. [2019-09-08 07:06:51,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:06:51,641 INFO L93 Difference]: Finished difference Result 10459 states and 13067 transitions. [2019-09-08 07:06:51,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-09-08 07:06:51,641 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 395 [2019-09-08 07:06:51,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:06:51,664 INFO L225 Difference]: With dead ends: 10459 [2019-09-08 07:06:51,665 INFO L226 Difference]: Without dead ends: 8218 [2019-09-08 07:06:51,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 423 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5634 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=2267, Invalid=15025, Unknown=0, NotChecked=0, Total=17292 [2019-09-08 07:06:51,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8218 states. [2019-09-08 07:06:52,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8218 to 6994. [2019-09-08 07:06:52,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6994 states. [2019-09-08 07:06:52,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6994 states to 6994 states and 8424 transitions. [2019-09-08 07:06:52,160 INFO L78 Accepts]: Start accepts. Automaton has 6994 states and 8424 transitions. Word has length 395 [2019-09-08 07:06:52,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:06:52,160 INFO L475 AbstractCegarLoop]: Abstraction has 6994 states and 8424 transitions. [2019-09-08 07:06:52,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 07:06:52,161 INFO L276 IsEmpty]: Start isEmpty. Operand 6994 states and 8424 transitions. [2019-09-08 07:06:52,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-09-08 07:06:52,177 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:06:52,177 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-09-08 07:06:52,177 INFO L418 AbstractCegarLoop]: === Iteration 35 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:06:52,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:06:52,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1181923341, now seen corresponding path program 1 times [2019-09-08 07:06:52,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:06:52,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:06:52,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:06:52,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:06:52,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:06:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:06:52,341 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 46 proven. 5 refuted. 0 times theorem prover too weak. 849 trivial. 0 not checked. [2019-09-08 07:06:52,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:06:52,341 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:06:52,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:06:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:06:52,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 1922 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 07:06:52,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:06:52,671 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2019-09-08 07:06:52,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:06:52,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2019-09-08 07:06:52,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:06:52,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:06:52,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:06:52,679 INFO L87 Difference]: Start difference. First operand 6994 states and 8424 transitions. Second operand 4 states. [2019-09-08 07:06:53,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:06:53,297 INFO L93 Difference]: Finished difference Result 13911 states and 16762 transitions. [2019-09-08 07:06:53,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:06:53,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 395 [2019-09-08 07:06:53,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:06:53,322 INFO L225 Difference]: With dead ends: 13911 [2019-09-08 07:06:53,322 INFO L226 Difference]: Without dead ends: 6930 [2019-09-08 07:06:53,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:06:53,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6930 states. [2019-09-08 07:06:53,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6930 to 6930. [2019-09-08 07:06:53,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6930 states. [2019-09-08 07:06:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6930 states to 6930 states and 8140 transitions. [2019-09-08 07:06:53,751 INFO L78 Accepts]: Start accepts. Automaton has 6930 states and 8140 transitions. Word has length 395 [2019-09-08 07:06:53,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:06:53,752 INFO L475 AbstractCegarLoop]: Abstraction has 6930 states and 8140 transitions. [2019-09-08 07:06:53,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:06:53,752 INFO L276 IsEmpty]: Start isEmpty. Operand 6930 states and 8140 transitions. [2019-09-08 07:06:53,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-09-08 07:06:53,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:06:53,768 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-09-08 07:06:53,768 INFO L418 AbstractCegarLoop]: === Iteration 36 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:06:53,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:06:53,769 INFO L82 PathProgramCache]: Analyzing trace with hash 224766659, now seen corresponding path program 1 times [2019-09-08 07:06:53,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:06:53,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:06:53,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:06:53,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:06:53,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:06:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:06:53,940 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2019-09-08 07:06:53,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:06:53,941 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:06:53,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:06:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:06:54,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 1912 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 07:06:54,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:06:54,368 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2019-09-08 07:06:54,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:06:54,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-09-08 07:06:54,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:06:54,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:06:54,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:06:54,385 INFO L87 Difference]: Start difference. First operand 6930 states and 8140 transitions. Second operand 4 states. [2019-09-08 07:06:55,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:06:55,110 INFO L93 Difference]: Finished difference Result 19594 states and 23074 transitions. [2019-09-08 07:06:55,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:06:55,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 395 [2019-09-08 07:06:55,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:06:55,150 INFO L225 Difference]: With dead ends: 19594 [2019-09-08 07:06:55,150 INFO L226 Difference]: Without dead ends: 13350 [2019-09-08 07:06:55,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 394 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:06:55,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13350 states. [2019-09-08 07:06:55,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13350 to 8467. [2019-09-08 07:06:55,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8467 states. [2019-09-08 07:06:55,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8467 states to 8467 states and 9924 transitions. [2019-09-08 07:06:55,706 INFO L78 Accepts]: Start accepts. Automaton has 8467 states and 9924 transitions. Word has length 395 [2019-09-08 07:06:55,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:06:55,707 INFO L475 AbstractCegarLoop]: Abstraction has 8467 states and 9924 transitions. [2019-09-08 07:06:55,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:06:55,707 INFO L276 IsEmpty]: Start isEmpty. Operand 8467 states and 9924 transitions. [2019-09-08 07:06:55,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-09-08 07:06:55,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:06:55,721 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-09-08 07:06:55,721 INFO L418 AbstractCegarLoop]: === Iteration 37 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:06:55,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:06:55,721 INFO L82 PathProgramCache]: Analyzing trace with hash 294414533, now seen corresponding path program 1 times [2019-09-08 07:06:55,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:06:55,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:06:55,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:06:55,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:06:55,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:06:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:06:55,886 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 878 trivial. 0 not checked. [2019-09-08 07:06:55,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:06:55,886 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:06:55,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:06:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:06:56,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 1911 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-08 07:06:56,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:06:56,510 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 194 proven. 122 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2019-09-08 07:06:56,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:06:56,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 13] total 14 [2019-09-08 07:06:56,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 07:06:56,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 07:06:56,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-09-08 07:06:56,525 INFO L87 Difference]: Start difference. First operand 8467 states and 9924 transitions. Second operand 14 states. [2019-09-08 07:07:01,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:01,334 INFO L93 Difference]: Finished difference Result 15019 states and 17697 transitions. [2019-09-08 07:07:01,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 07:07:01,335 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 395 [2019-09-08 07:07:01,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:01,356 INFO L225 Difference]: With dead ends: 15019 [2019-09-08 07:07:01,356 INFO L226 Difference]: Without dead ends: 7194 [2019-09-08 07:07:01,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 395 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=384, Invalid=1778, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 07:07:01,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7194 states. [2019-09-08 07:07:02,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7194 to 6922. [2019-09-08 07:07:02,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6922 states. [2019-09-08 07:07:02,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6922 states to 6922 states and 8103 transitions. [2019-09-08 07:07:02,018 INFO L78 Accepts]: Start accepts. Automaton has 6922 states and 8103 transitions. Word has length 395 [2019-09-08 07:07:02,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:02,018 INFO L475 AbstractCegarLoop]: Abstraction has 6922 states and 8103 transitions. [2019-09-08 07:07:02,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 07:07:02,019 INFO L276 IsEmpty]: Start isEmpty. Operand 6922 states and 8103 transitions. [2019-09-08 07:07:02,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-09-08 07:07:02,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:02,032 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-09-08 07:07:02,033 INFO L418 AbstractCegarLoop]: === Iteration 38 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:02,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:02,033 INFO L82 PathProgramCache]: Analyzing trace with hash -796919207, now seen corresponding path program 1 times [2019-09-08 07:07:02,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:02,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:02,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:02,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:02,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:02,502 INFO L134 CoverageAnalysis]: Checked inductivity of 957 backedges. 31 proven. 229 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2019-09-08 07:07:02,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:07:02,503 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:07:02,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:07:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:02,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 1948 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 07:07:02,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:07:02,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 07:07:03,296 INFO L134 CoverageAnalysis]: Checked inductivity of 957 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 704 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 07:07:03,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:07:03,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 21 [2019-09-08 07:07:03,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 07:07:03,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 07:07:03,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2019-09-08 07:07:03,317 INFO L87 Difference]: Start difference. First operand 6922 states and 8103 transitions. Second operand 21 states. [2019-09-08 07:07:08,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:08,460 INFO L93 Difference]: Finished difference Result 14607 states and 17081 transitions. [2019-09-08 07:07:08,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-08 07:07:08,460 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 405 [2019-09-08 07:07:08,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:08,481 INFO L225 Difference]: With dead ends: 14607 [2019-09-08 07:07:08,481 INFO L226 Difference]: Without dead ends: 8163 [2019-09-08 07:07:08,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 427 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=446, Invalid=2860, Unknown=0, NotChecked=0, Total=3306 [2019-09-08 07:07:08,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8163 states. [2019-09-08 07:07:08,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8163 to 7019. [2019-09-08 07:07:08,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7019 states. [2019-09-08 07:07:08,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7019 states to 7019 states and 8191 transitions. [2019-09-08 07:07:08,949 INFO L78 Accepts]: Start accepts. Automaton has 7019 states and 8191 transitions. Word has length 405 [2019-09-08 07:07:08,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:08,949 INFO L475 AbstractCegarLoop]: Abstraction has 7019 states and 8191 transitions. [2019-09-08 07:07:08,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 07:07:08,949 INFO L276 IsEmpty]: Start isEmpty. Operand 7019 states and 8191 transitions. [2019-09-08 07:07:08,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2019-09-08 07:07:08,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:08,959 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 12, 12, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-09-08 07:07:08,960 INFO L418 AbstractCegarLoop]: === Iteration 39 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:08,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:08,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1532104155, now seen corresponding path program 1 times [2019-09-08 07:07:08,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:08,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:08,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:08,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:08,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:09,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 1004 trivial. 0 not checked. [2019-09-08 07:07:09,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:07:09,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:07:09,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:07:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:09,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 1976 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-08 07:07:09,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:07:10,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 485 proven. 183 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2019-09-08 07:07:10,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:07:10,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 25] total 37 [2019-09-08 07:07:10,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-08 07:07:10,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-08 07:07:10,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1240, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 07:07:10,981 INFO L87 Difference]: Start difference. First operand 7019 states and 8191 transitions. Second operand 37 states. [2019-09-08 07:07:26,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:26,500 INFO L93 Difference]: Finished difference Result 15399 states and 18042 transitions. [2019-09-08 07:07:26,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-08 07:07:26,501 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 416 [2019-09-08 07:07:26,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:26,528 INFO L225 Difference]: With dead ends: 15399 [2019-09-08 07:07:26,528 INFO L226 Difference]: Without dead ends: 9014 [2019-09-08 07:07:26,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 426 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5362 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1656, Invalid=14856, Unknown=0, NotChecked=0, Total=16512 [2019-09-08 07:07:26,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9014 states. [2019-09-08 07:07:27,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9014 to 7025. [2019-09-08 07:07:27,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7025 states. [2019-09-08 07:07:27,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7025 states to 7025 states and 8192 transitions. [2019-09-08 07:07:27,080 INFO L78 Accepts]: Start accepts. Automaton has 7025 states and 8192 transitions. Word has length 416 [2019-09-08 07:07:27,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:27,081 INFO L475 AbstractCegarLoop]: Abstraction has 7025 states and 8192 transitions. [2019-09-08 07:07:27,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-08 07:07:27,081 INFO L276 IsEmpty]: Start isEmpty. Operand 7025 states and 8192 transitions. [2019-09-08 07:07:27,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2019-09-08 07:07:27,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:27,091 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-09-08 07:07:27,092 INFO L418 AbstractCegarLoop]: === Iteration 40 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:27,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:27,092 INFO L82 PathProgramCache]: Analyzing trace with hash 480639822, now seen corresponding path program 1 times [2019-09-08 07:07:27,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:27,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:27,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:27,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:27,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:27,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1094 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 1074 trivial. 0 not checked. [2019-09-08 07:07:27,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:07:27,509 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:07:27,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:27,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 2003 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-08 07:07:27,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:07:28,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1094 backedges. 569 proven. 217 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-09-08 07:07:28,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:07:28,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 24] total 36 [2019-09-08 07:07:28,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 07:07:28,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 07:07:28,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1170, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 07:07:28,783 INFO L87 Difference]: Start difference. First operand 7025 states and 8192 transitions. Second operand 36 states. [2019-09-08 07:07:31,348 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-09-08 07:07:43,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:43,320 INFO L93 Difference]: Finished difference Result 15331 states and 17948 transitions. [2019-09-08 07:07:43,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-08 07:07:43,320 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 428 [2019-09-08 07:07:43,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:43,342 INFO L225 Difference]: With dead ends: 15331 [2019-09-08 07:07:43,342 INFO L226 Difference]: Without dead ends: 8946 [2019-09-08 07:07:43,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 438 SyntacticMatches, 1 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5347 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1600, Invalid=14656, Unknown=0, NotChecked=0, Total=16256 [2019-09-08 07:07:43,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8946 states. [2019-09-08 07:07:43,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8946 to 6972. [2019-09-08 07:07:43,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6972 states. [2019-09-08 07:07:43,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6972 states to 6972 states and 8118 transitions. [2019-09-08 07:07:43,789 INFO L78 Accepts]: Start accepts. Automaton has 6972 states and 8118 transitions. Word has length 428 [2019-09-08 07:07:43,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:43,790 INFO L475 AbstractCegarLoop]: Abstraction has 6972 states and 8118 transitions. [2019-09-08 07:07:43,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 07:07:43,790 INFO L276 IsEmpty]: Start isEmpty. Operand 6972 states and 8118 transitions. [2019-09-08 07:07:43,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2019-09-08 07:07:43,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:43,800 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-09-08 07:07:43,800 INFO L418 AbstractCegarLoop]: === Iteration 41 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:43,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:43,800 INFO L82 PathProgramCache]: Analyzing trace with hash 2009358984, now seen corresponding path program 1 times [2019-09-08 07:07:43,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:43,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:43,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:43,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:43,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:44,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1214 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1205 trivial. 0 not checked. [2019-09-08 07:07:44,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:07:44,031 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:07:44,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:44,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 2089 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-08 07:07:44,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:07:44,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1214 backedges. 408 proven. 48 refuted. 0 times theorem prover too weak. 758 trivial. 0 not checked. [2019-09-08 07:07:44,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:07:44,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 10] total 11 [2019-09-08 07:07:44,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:07:44,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:07:44,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:07:44,567 INFO L87 Difference]: Start difference. First operand 6972 states and 8118 transitions. Second operand 11 states. [2019-09-08 07:07:46,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:46,078 INFO L93 Difference]: Finished difference Result 10535 states and 12289 transitions. [2019-09-08 07:07:46,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 07:07:46,078 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 454 [2019-09-08 07:07:46,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:46,086 INFO L225 Difference]: With dead ends: 10535 [2019-09-08 07:07:46,086 INFO L226 Difference]: Without dead ends: 4120 [2019-09-08 07:07:46,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 447 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2019-09-08 07:07:46,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4120 states. [2019-09-08 07:07:46,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4120 to 4120. [2019-09-08 07:07:46,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4120 states. [2019-09-08 07:07:46,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4120 states to 4120 states and 4777 transitions. [2019-09-08 07:07:46,330 INFO L78 Accepts]: Start accepts. Automaton has 4120 states and 4777 transitions. Word has length 454 [2019-09-08 07:07:46,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:46,331 INFO L475 AbstractCegarLoop]: Abstraction has 4120 states and 4777 transitions. [2019-09-08 07:07:46,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:07:46,331 INFO L276 IsEmpty]: Start isEmpty. Operand 4120 states and 4777 transitions. [2019-09-08 07:07:46,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2019-09-08 07:07:46,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:46,336 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-09-08 07:07:46,336 INFO L418 AbstractCegarLoop]: === Iteration 42 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:46,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:46,337 INFO L82 PathProgramCache]: Analyzing trace with hash 862287459, now seen corresponding path program 1 times [2019-09-08 07:07:46,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:46,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:46,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:46,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:46,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:46,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1214 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 1182 trivial. 0 not checked. [2019-09-08 07:07:46,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:07:46,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 07:07:46,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 07:07:46,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 07:07:46,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:07:46,567 INFO L87 Difference]: Start difference. First operand 4120 states and 4777 transitions. Second operand 10 states. [2019-09-08 07:07:47,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:47,694 INFO L93 Difference]: Finished difference Result 8728 states and 10327 transitions. [2019-09-08 07:07:47,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 07:07:47,694 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 452 [2019-09-08 07:07:47,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:47,705 INFO L225 Difference]: With dead ends: 8728 [2019-09-08 07:07:47,705 INFO L226 Difference]: Without dead ends: 5212 [2019-09-08 07:07:47,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-09-08 07:07:47,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5212 states. [2019-09-08 07:07:47,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5212 to 4162. [2019-09-08 07:07:47,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4162 states. [2019-09-08 07:07:47,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4162 states to 4162 states and 4846 transitions. [2019-09-08 07:07:47,978 INFO L78 Accepts]: Start accepts. Automaton has 4162 states and 4846 transitions. Word has length 452 [2019-09-08 07:07:47,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:47,978 INFO L475 AbstractCegarLoop]: Abstraction has 4162 states and 4846 transitions. [2019-09-08 07:07:47,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 07:07:47,979 INFO L276 IsEmpty]: Start isEmpty. Operand 4162 states and 4846 transitions. [2019-09-08 07:07:47,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-09-08 07:07:47,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:47,984 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-09-08 07:07:47,984 INFO L418 AbstractCegarLoop]: === Iteration 43 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:47,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:47,984 INFO L82 PathProgramCache]: Analyzing trace with hash -2094705451, now seen corresponding path program 1 times [2019-09-08 07:07:47,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:47,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:47,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:47,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:47,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:48,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2019-09-08 07:07:48,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:07:48,655 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:07:48,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:07:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:49,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 2088 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-08 07:07:49,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:07:50,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 298 proven. 333 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2019-09-08 07:07:50,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:07:50,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 49 [2019-09-08 07:07:50,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-08 07:07:50,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-08 07:07:50,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2177, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 07:07:50,385 INFO L87 Difference]: Start difference. First operand 4162 states and 4846 transitions. Second operand 49 states. [2019-09-08 07:08:22,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:08:22,979 INFO L93 Difference]: Finished difference Result 14775 states and 17510 transitions. [2019-09-08 07:08:22,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2019-09-08 07:08:22,980 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 453 [2019-09-08 07:08:22,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:08:22,999 INFO L225 Difference]: With dead ends: 14775 [2019-09-08 07:08:23,000 INFO L226 Difference]: Without dead ends: 11217 [2019-09-08 07:08:23,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 694 GetRequests, 483 SyntacticMatches, 2 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14892 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=3959, Invalid=40351, Unknown=0, NotChecked=0, Total=44310 [2019-09-08 07:08:23,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11217 states. [2019-09-08 07:08:23,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11217 to 5597. [2019-09-08 07:08:23,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5597 states. [2019-09-08 07:08:23,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5597 states to 5597 states and 6547 transitions. [2019-09-08 07:08:23,426 INFO L78 Accepts]: Start accepts. Automaton has 5597 states and 6547 transitions. Word has length 453 [2019-09-08 07:08:23,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:08:23,427 INFO L475 AbstractCegarLoop]: Abstraction has 5597 states and 6547 transitions. [2019-09-08 07:08:23,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-08 07:08:23,427 INFO L276 IsEmpty]: Start isEmpty. Operand 5597 states and 6547 transitions. [2019-09-08 07:08:23,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-09-08 07:08:23,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:08:23,436 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-09-08 07:08:23,436 INFO L418 AbstractCegarLoop]: === Iteration 44 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:08:23,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:08:23,437 INFO L82 PathProgramCache]: Analyzing trace with hash -241195945, now seen corresponding path program 1 times [2019-09-08 07:08:23,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:08:23,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:08:23,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:23,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:23,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:24,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 14 proven. 34 refuted. 0 times theorem prover too weak. 1157 trivial. 0 not checked. [2019-09-08 07:08:24,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:08:24,157 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:08:24,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:24,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 2086 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 07:08:24,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:08:24,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 07:08:24,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 408 proven. 4 refuted. 0 times theorem prover too weak. 793 trivial. 0 not checked. [2019-09-08 07:08:24,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:08:24,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 7] total 30 [2019-09-08 07:08:24,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 07:08:24,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 07:08:24,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=794, Unknown=0, NotChecked=0, Total=870 [2019-09-08 07:08:24,753 INFO L87 Difference]: Start difference. First operand 5597 states and 6547 transitions. Second operand 30 states. [2019-09-08 07:08:34,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:08:34,775 INFO L93 Difference]: Finished difference Result 13738 states and 16255 transitions. [2019-09-08 07:08:34,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-08 07:08:34,775 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 453 [2019-09-08 07:08:34,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:08:34,793 INFO L225 Difference]: With dead ends: 13738 [2019-09-08 07:08:34,793 INFO L226 Difference]: Without dead ends: 8623 [2019-09-08 07:08:34,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 464 SyntacticMatches, 4 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=828, Invalid=5178, Unknown=0, NotChecked=0, Total=6006 [2019-09-08 07:08:34,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8623 states. [2019-09-08 07:08:35,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8623 to 5613. [2019-09-08 07:08:35,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5613 states. [2019-09-08 07:08:35,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5613 states to 5613 states and 6559 transitions. [2019-09-08 07:08:35,219 INFO L78 Accepts]: Start accepts. Automaton has 5613 states and 6559 transitions. Word has length 453 [2019-09-08 07:08:35,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:08:35,219 INFO L475 AbstractCegarLoop]: Abstraction has 5613 states and 6559 transitions. [2019-09-08 07:08:35,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 07:08:35,220 INFO L276 IsEmpty]: Start isEmpty. Operand 5613 states and 6559 transitions. [2019-09-08 07:08:35,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2019-09-08 07:08:35,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:08:35,226 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-09-08 07:08:35,226 INFO L418 AbstractCegarLoop]: === Iteration 45 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:08:35,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:08:35,227 INFO L82 PathProgramCache]: Analyzing trace with hash 422770584, now seen corresponding path program 1 times [2019-09-08 07:08:35,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:08:35,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:08:35,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:35,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:35,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:35,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2019-09-08 07:08:35,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:08:35,946 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:08:35,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:36,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 2089 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 07:08:36,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:08:36,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 518 proven. 36 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2019-09-08 07:08:36,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:08:36,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 11] total 35 [2019-09-08 07:08:36,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 07:08:36,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 07:08:36,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1098, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 07:08:36,786 INFO L87 Difference]: Start difference. First operand 5613 states and 6559 transitions. Second operand 35 states. [2019-09-08 07:08:59,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:08:59,384 INFO L93 Difference]: Finished difference Result 18295 states and 21702 transitions. [2019-09-08 07:08:59,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-08 07:08:59,385 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 454 [2019-09-08 07:08:59,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:08:59,411 INFO L225 Difference]: With dead ends: 18295 [2019-09-08 07:08:59,412 INFO L226 Difference]: Without dead ends: 13417 [2019-09-08 07:08:59,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 591 GetRequests, 476 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3518 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1572, Invalid=12000, Unknown=0, NotChecked=0, Total=13572 [2019-09-08 07:08:59,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13417 states. [2019-09-08 07:08:59,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13417 to 5613. [2019-09-08 07:08:59,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5613 states. [2019-09-08 07:08:59,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5613 states to 5613 states and 6559 transitions. [2019-09-08 07:08:59,886 INFO L78 Accepts]: Start accepts. Automaton has 5613 states and 6559 transitions. Word has length 454 [2019-09-08 07:08:59,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:08:59,887 INFO L475 AbstractCegarLoop]: Abstraction has 5613 states and 6559 transitions. [2019-09-08 07:08:59,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 07:08:59,887 INFO L276 IsEmpty]: Start isEmpty. Operand 5613 states and 6559 transitions. [2019-09-08 07:08:59,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2019-09-08 07:08:59,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:08:59,897 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-09-08 07:08:59,898 INFO L418 AbstractCegarLoop]: === Iteration 46 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:08:59,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:08:59,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1467046357, now seen corresponding path program 1 times [2019-09-08 07:08:59,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:08:59,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:08:59,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:59,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:59,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:09:00,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 26 proven. 30 refuted. 0 times theorem prover too weak. 1149 trivial. 0 not checked. [2019-09-08 07:09:00,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:09:00,479 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:09:00,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:09:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:09:00,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 2089 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-08 07:09:00,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:09:01,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 403 proven. 162 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2019-09-08 07:09:01,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:09:01,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 13] total 40 [2019-09-08 07:09:01,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-08 07:09:01,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-08 07:09:01,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1475, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 07:09:01,266 INFO L87 Difference]: Start difference. First operand 5613 states and 6559 transitions. Second operand 40 states. [2019-09-08 07:09:45,363 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-08 07:09:56,970 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-09-08 07:11:40,594 WARN L188 SmtUtils]: Spent 2.43 s on a formula simplification that was a NOOP. DAG size: 29 [2019-09-08 07:11:53,228 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-09-08 07:12:34,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:12:34,344 INFO L93 Difference]: Finished difference Result 77464 states and 93909 transitions. [2019-09-08 07:12:34,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1502 states. [2019-09-08 07:12:34,345 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 454 [2019-09-08 07:12:34,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:12:34,568 INFO L225 Difference]: With dead ends: 77464 [2019-09-08 07:12:34,568 INFO L226 Difference]: Without dead ends: 72586 [2019-09-08 07:12:34,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2397 GetRequests, 858 SyntacticMatches, 1 SemanticMatches, 1538 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1121871 ImplicationChecksByTransitivity, 98.6s TimeCoverageRelationStatistics Valid=78391, Invalid=2291669, Unknown=0, NotChecked=0, Total=2370060 [2019-09-08 07:12:34,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72586 states. [2019-09-08 07:12:36,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72586 to 15662. [2019-09-08 07:12:36,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15662 states. [2019-09-08 07:12:36,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15662 states to 15662 states and 18167 transitions. [2019-09-08 07:12:36,884 INFO L78 Accepts]: Start accepts. Automaton has 15662 states and 18167 transitions. Word has length 454 [2019-09-08 07:12:36,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:12:36,885 INFO L475 AbstractCegarLoop]: Abstraction has 15662 states and 18167 transitions. [2019-09-08 07:12:36,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-08 07:12:36,885 INFO L276 IsEmpty]: Start isEmpty. Operand 15662 states and 18167 transitions. [2019-09-08 07:12:36,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2019-09-08 07:12:36,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:12:36,905 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-09-08 07:12:36,905 INFO L418 AbstractCegarLoop]: === Iteration 47 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:12:36,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:12:36,906 INFO L82 PathProgramCache]: Analyzing trace with hash 330618554, now seen corresponding path program 1 times [2019-09-08 07:12:36,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:12:36,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:12:36,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:12:36,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:12:36,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:12:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:12:37,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2019-09-08 07:12:37,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:12:37,465 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:12:37,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:12:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:12:37,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 2090 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-08 07:12:37,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:12:38,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 518 proven. 36 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2019-09-08 07:12:38,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:12:38,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 11] total 35 [2019-09-08 07:12:38,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 07:12:38,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 07:12:38,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1098, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 07:12:38,338 INFO L87 Difference]: Start difference. First operand 15662 states and 18167 transitions. Second operand 35 states. [2019-09-08 07:12:42,191 WARN L188 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2019-09-08 07:13:03,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:13:03,566 INFO L93 Difference]: Finished difference Result 51433 states and 60489 transitions. [2019-09-08 07:13:03,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-08 07:13:03,566 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 455 [2019-09-08 07:13:03,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:13:03,667 INFO L225 Difference]: With dead ends: 51433 [2019-09-08 07:13:03,668 INFO L226 Difference]: Without dead ends: 36721 [2019-09-08 07:13:03,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3517 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1572, Invalid=12000, Unknown=0, NotChecked=0, Total=13572 [2019-09-08 07:13:03,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36721 states. [2019-09-08 07:13:05,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36721 to 15648. [2019-09-08 07:13:05,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15648 states. [2019-09-08 07:13:05,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15648 states to 15648 states and 18153 transitions. [2019-09-08 07:13:05,747 INFO L78 Accepts]: Start accepts. Automaton has 15648 states and 18153 transitions. Word has length 455 [2019-09-08 07:13:05,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:13:05,748 INFO L475 AbstractCegarLoop]: Abstraction has 15648 states and 18153 transitions. [2019-09-08 07:13:05,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 07:13:05,748 INFO L276 IsEmpty]: Start isEmpty. Operand 15648 states and 18153 transitions. [2019-09-08 07:13:05,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2019-09-08 07:13:05,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:13:05,769 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-09-08 07:13:05,769 INFO L418 AbstractCegarLoop]: === Iteration 48 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:13:05,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:13:05,770 INFO L82 PathProgramCache]: Analyzing trace with hash -858174020, now seen corresponding path program 1 times [2019-09-08 07:13:05,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:13:05,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:13:05,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:05,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:05,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:05,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1198 trivial. 0 not checked. [2019-09-08 07:13:05,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:13:05,939 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:13:05,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:06,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 2089 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-08 07:13:06,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:13:06,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 427 proven. 52 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2019-09-08 07:13:06,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:13:06,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 12] total 13 [2019-09-08 07:13:06,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:13:06,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:13:06,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:13:06,440 INFO L87 Difference]: Start difference. First operand 15648 states and 18153 transitions. Second operand 13 states. [2019-09-08 07:13:09,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:13:09,681 INFO L93 Difference]: Finished difference Result 23807 states and 27647 transitions. [2019-09-08 07:13:09,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 07:13:09,682 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 455 [2019-09-08 07:13:09,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:13:09,700 INFO L225 Difference]: With dead ends: 23807 [2019-09-08 07:13:09,700 INFO L226 Difference]: Without dead ends: 8697 [2019-09-08 07:13:09,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 449 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2019-09-08 07:13:09,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8697 states. [2019-09-08 07:13:10,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8697 to 8575. [2019-09-08 07:13:10,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8575 states. [2019-09-08 07:13:10,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8575 states to 8575 states and 9918 transitions. [2019-09-08 07:13:10,547 INFO L78 Accepts]: Start accepts. Automaton has 8575 states and 9918 transitions. Word has length 455 [2019-09-08 07:13:10,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:13:10,547 INFO L475 AbstractCegarLoop]: Abstraction has 8575 states and 9918 transitions. [2019-09-08 07:13:10,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 07:13:10,547 INFO L276 IsEmpty]: Start isEmpty. Operand 8575 states and 9918 transitions. [2019-09-08 07:13:10,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2019-09-08 07:13:10,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:13:10,556 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-09-08 07:13:10,556 INFO L418 AbstractCegarLoop]: === Iteration 49 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:13:10,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:13:10,557 INFO L82 PathProgramCache]: Analyzing trace with hash -491481347, now seen corresponding path program 1 times [2019-09-08 07:13:10,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:13:10,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:13:10,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:10,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:10,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:10,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1204 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 1172 trivial. 0 not checked. [2019-09-08 07:13:10,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:13:10,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:13:10,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:13:10,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:13:10,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:13:10,816 INFO L87 Difference]: Start difference. First operand 8575 states and 9918 transitions. Second operand 11 states. [2019-09-08 07:13:13,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:13:13,631 INFO L93 Difference]: Finished difference Result 19078 states and 22567 transitions. [2019-09-08 07:13:13,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 07:13:13,631 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 454 [2019-09-08 07:13:13,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:13:13,654 INFO L225 Difference]: With dead ends: 19078 [2019-09-08 07:13:13,654 INFO L226 Difference]: Without dead ends: 11215 [2019-09-08 07:13:13,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 07:13:13,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11215 states. [2019-09-08 07:13:14,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11215 to 6617. [2019-09-08 07:13:14,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6617 states. [2019-09-08 07:13:14,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6617 states to 6617 states and 7598 transitions. [2019-09-08 07:13:14,372 INFO L78 Accepts]: Start accepts. Automaton has 6617 states and 7598 transitions. Word has length 454 [2019-09-08 07:13:14,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:13:14,372 INFO L475 AbstractCegarLoop]: Abstraction has 6617 states and 7598 transitions. [2019-09-08 07:13:14,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:13:14,372 INFO L276 IsEmpty]: Start isEmpty. Operand 6617 states and 7598 transitions. [2019-09-08 07:13:14,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2019-09-08 07:13:14,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:13:14,380 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-09-08 07:13:14,380 INFO L418 AbstractCegarLoop]: === Iteration 50 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:13:14,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:13:14,380 INFO L82 PathProgramCache]: Analyzing trace with hash 995728042, now seen corresponding path program 1 times [2019-09-08 07:13:14,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:13:14,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:13:14,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:14,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:14,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:14,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1285 backedges. 40 proven. 4 refuted. 0 times theorem prover too weak. 1241 trivial. 0 not checked. [2019-09-08 07:13:14,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:13:14,713 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:13:14,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:14,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 2120 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 07:13:14,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:13:15,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1285 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 939 trivial. 0 not checked. [2019-09-08 07:13:15,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:13:15,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 13 [2019-09-08 07:13:15,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:13:15,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:13:15,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:13:15,108 INFO L87 Difference]: Start difference. First operand 6617 states and 7598 transitions. Second operand 13 states. [2019-09-08 07:13:16,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:13:16,899 INFO L93 Difference]: Finished difference Result 14998 states and 17366 transitions. [2019-09-08 07:13:16,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 07:13:16,900 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 463 [2019-09-08 07:13:16,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:13:16,924 INFO L225 Difference]: With dead ends: 14998 [2019-09-08 07:13:16,924 INFO L226 Difference]: Without dead ends: 9093 [2019-09-08 07:13:16,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 462 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-08 07:13:16,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9093 states. [2019-09-08 07:13:17,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9093 to 6113. [2019-09-08 07:13:17,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6113 states. [2019-09-08 07:13:17,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6113 states to 6113 states and 6910 transitions. [2019-09-08 07:13:17,711 INFO L78 Accepts]: Start accepts. Automaton has 6113 states and 6910 transitions. Word has length 463 [2019-09-08 07:13:17,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:13:17,711 INFO L475 AbstractCegarLoop]: Abstraction has 6113 states and 6910 transitions. [2019-09-08 07:13:17,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 07:13:17,712 INFO L276 IsEmpty]: Start isEmpty. Operand 6113 states and 6910 transitions. [2019-09-08 07:13:17,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2019-09-08 07:13:17,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:13:17,719 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-09-08 07:13:17,720 INFO L418 AbstractCegarLoop]: === Iteration 51 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:13:17,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:13:17,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1690317777, now seen corresponding path program 1 times [2019-09-08 07:13:17,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:13:17,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:13:17,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:17,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:17,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:17,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1284 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1272 trivial. 0 not checked. [2019-09-08 07:13:17,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:13:17,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:13:17,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:13:17,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:13:17,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:13:17,896 INFO L87 Difference]: Start difference. First operand 6113 states and 6910 transitions. Second operand 4 states. [2019-09-08 07:13:19,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:13:19,048 INFO L93 Difference]: Finished difference Result 14137 states and 16301 transitions. [2019-09-08 07:13:19,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:13:19,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 465 [2019-09-08 07:13:19,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:13:19,072 INFO L225 Difference]: With dead ends: 14137 [2019-09-08 07:13:19,072 INFO L226 Difference]: Without dead ends: 8736 [2019-09-08 07:13:19,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:13:19,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8736 states. [2019-09-08 07:13:20,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8736 to 7536. [2019-09-08 07:13:20,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7536 states. [2019-09-08 07:13:20,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7536 states to 7536 states and 8445 transitions. [2019-09-08 07:13:20,078 INFO L78 Accepts]: Start accepts. Automaton has 7536 states and 8445 transitions. Word has length 465 [2019-09-08 07:13:20,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:13:20,079 INFO L475 AbstractCegarLoop]: Abstraction has 7536 states and 8445 transitions. [2019-09-08 07:13:20,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:13:20,079 INFO L276 IsEmpty]: Start isEmpty. Operand 7536 states and 8445 transitions. [2019-09-08 07:13:20,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2019-09-08 07:13:20,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:13:20,089 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-09-08 07:13:20,089 INFO L418 AbstractCegarLoop]: === Iteration 52 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:13:20,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:13:20,089 INFO L82 PathProgramCache]: Analyzing trace with hash -832681935, now seen corresponding path program 1 times [2019-09-08 07:13:20,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:13:20,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:13:20,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:20,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:20,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:20,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1284 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 1246 trivial. 0 not checked. [2019-09-08 07:13:20,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:13:20,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:13:20,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:13:20,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:13:20,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:13:20,314 INFO L87 Difference]: Start difference. First operand 7536 states and 8445 transitions. Second operand 11 states. [2019-09-08 07:13:23,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:13:23,513 INFO L93 Difference]: Finished difference Result 19358 states and 22509 transitions. [2019-09-08 07:13:23,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 07:13:23,514 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 465 [2019-09-08 07:13:23,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:13:23,544 INFO L225 Difference]: With dead ends: 19358 [2019-09-08 07:13:23,544 INFO L226 Difference]: Without dead ends: 12438 [2019-09-08 07:13:23,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=862, Unknown=0, NotChecked=0, Total=992 [2019-09-08 07:13:23,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12438 states. [2019-09-08 07:13:24,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12438 to 7384. [2019-09-08 07:13:24,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7384 states. [2019-09-08 07:13:24,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7384 states to 7384 states and 8253 transitions. [2019-09-08 07:13:24,463 INFO L78 Accepts]: Start accepts. Automaton has 7384 states and 8253 transitions. Word has length 465 [2019-09-08 07:13:24,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:13:24,464 INFO L475 AbstractCegarLoop]: Abstraction has 7384 states and 8253 transitions. [2019-09-08 07:13:24,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:13:24,464 INFO L276 IsEmpty]: Start isEmpty. Operand 7384 states and 8253 transitions. [2019-09-08 07:13:24,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2019-09-08 07:13:24,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:13:24,472 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-09-08 07:13:24,473 INFO L418 AbstractCegarLoop]: === Iteration 53 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:13:24,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:13:24,473 INFO L82 PathProgramCache]: Analyzing trace with hash 2039440897, now seen corresponding path program 1 times [2019-09-08 07:13:24,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:13:24,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:13:24,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:24,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:24,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:24,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 58 proven. 72 refuted. 0 times theorem prover too weak. 1149 trivial. 0 not checked. [2019-09-08 07:13:24,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:13:24,881 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:13:24,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:25,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 2123 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-08 07:13:25,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:13:25,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 532 proven. 98 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-09-08 07:13:25,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:13:25,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 18 [2019-09-08 07:13:25,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 07:13:25,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 07:13:25,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-09-08 07:13:25,399 INFO L87 Difference]: Start difference. First operand 7384 states and 8253 transitions. Second operand 18 states. [2019-09-08 07:13:31,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:13:31,144 INFO L93 Difference]: Finished difference Result 11820 states and 13259 transitions. [2019-09-08 07:13:31,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-08 07:13:31,144 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 465 [2019-09-08 07:13:31,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:13:31,156 INFO L225 Difference]: With dead ends: 11820 [2019-09-08 07:13:31,156 INFO L226 Difference]: Without dead ends: 5148 [2019-09-08 07:13:31,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 491 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=515, Invalid=3267, Unknown=0, NotChecked=0, Total=3782 [2019-09-08 07:13:31,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5148 states. [2019-09-08 07:13:31,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5148 to 4273. [2019-09-08 07:13:31,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4273 states. [2019-09-08 07:13:31,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4273 states to 4273 states and 4731 transitions. [2019-09-08 07:13:31,698 INFO L78 Accepts]: Start accepts. Automaton has 4273 states and 4731 transitions. Word has length 465 [2019-09-08 07:13:31,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:13:31,698 INFO L475 AbstractCegarLoop]: Abstraction has 4273 states and 4731 transitions. [2019-09-08 07:13:31,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 07:13:31,698 INFO L276 IsEmpty]: Start isEmpty. Operand 4273 states and 4731 transitions. [2019-09-08 07:13:31,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2019-09-08 07:13:31,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:13:31,706 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 12, 12, 10, 10, 10, 10, 9, 8, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-09-08 07:13:31,707 INFO L418 AbstractCegarLoop]: === Iteration 54 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:13:31,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:13:31,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1085169216, now seen corresponding path program 1 times [2019-09-08 07:13:31,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:13:31,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:13:31,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:31,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:31,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:32,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 13 proven. 35 refuted. 0 times theorem prover too weak. 1235 trivial. 0 not checked. [2019-09-08 07:13:32,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:13:32,540 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:13:32,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:32,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:32,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 2112 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 07:13:32,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:13:32,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 07:13:33,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 470 proven. 9 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2019-09-08 07:13:33,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:13:33,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 7] total 30 [2019-09-08 07:13:33,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 07:13:33,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 07:13:33,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=794, Unknown=0, NotChecked=0, Total=870 [2019-09-08 07:13:33,121 INFO L87 Difference]: Start difference. First operand 4273 states and 4731 transitions. Second operand 30 states. [2019-09-08 07:13:40,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:13:40,271 INFO L93 Difference]: Finished difference Result 9148 states and 10281 transitions. [2019-09-08 07:13:40,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 07:13:40,271 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 465 [2019-09-08 07:13:40,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:13:40,279 INFO L225 Difference]: With dead ends: 9148 [2019-09-08 07:13:40,280 INFO L226 Difference]: Without dead ends: 5272 [2019-09-08 07:13:40,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 470 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=623, Invalid=3799, Unknown=0, NotChecked=0, Total=4422 [2019-09-08 07:13:40,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5272 states. [2019-09-08 07:13:40,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5272 to 4303. [2019-09-08 07:13:40,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4303 states. [2019-09-08 07:13:40,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4303 states to 4303 states and 4752 transitions. [2019-09-08 07:13:40,811 INFO L78 Accepts]: Start accepts. Automaton has 4303 states and 4752 transitions. Word has length 465 [2019-09-08 07:13:40,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:13:40,811 INFO L475 AbstractCegarLoop]: Abstraction has 4303 states and 4752 transitions. [2019-09-08 07:13:40,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 07:13:40,811 INFO L276 IsEmpty]: Start isEmpty. Operand 4303 states and 4752 transitions. [2019-09-08 07:13:40,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2019-09-08 07:13:40,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:13:40,817 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 12, 12, 10, 10, 10, 10, 9, 8, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-09-08 07:13:40,817 INFO L418 AbstractCegarLoop]: === Iteration 55 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:13:40,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:13:40,818 INFO L82 PathProgramCache]: Analyzing trace with hash 2092035220, now seen corresponding path program 1 times [2019-09-08 07:13:40,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:13:40,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:13:40,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:40,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:40,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:41,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 26 proven. 30 refuted. 0 times theorem prover too weak. 1227 trivial. 0 not checked. [2019-09-08 07:13:41,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:13:41,529 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:13:41,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:41,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:41,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 2115 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-08 07:13:41,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:13:42,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 537 proven. 89 refuted. 0 times theorem prover too weak. 657 trivial. 0 not checked. [2019-09-08 07:13:42,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:13:42,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 17] total 43 [2019-09-08 07:13:42,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-08 07:13:42,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-08 07:13:42,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1682, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 07:13:42,704 INFO L87 Difference]: Start difference. First operand 4303 states and 4752 transitions. Second operand 43 states. [2019-09-08 07:14:27,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:14:27,583 INFO L93 Difference]: Finished difference Result 23307 states and 27539 transitions. [2019-09-08 07:14:27,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 257 states. [2019-09-08 07:14:27,583 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 466 [2019-09-08 07:14:27,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:14:27,622 INFO L225 Difference]: With dead ends: 23307 [2019-09-08 07:14:27,622 INFO L226 Difference]: Without dead ends: 19722 [2019-09-08 07:14:27,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 798 GetRequests, 504 SyntacticMatches, 2 SemanticMatches, 292 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32707 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=6138, Invalid=80004, Unknown=0, NotChecked=0, Total=86142 [2019-09-08 07:14:27,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19722 states. [2019-09-08 07:14:28,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19722 to 6881. [2019-09-08 07:14:28,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6881 states. [2019-09-08 07:14:28,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6881 states to 6881 states and 7671 transitions. [2019-09-08 07:14:28,671 INFO L78 Accepts]: Start accepts. Automaton has 6881 states and 7671 transitions. Word has length 466 [2019-09-08 07:14:28,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:14:28,672 INFO L475 AbstractCegarLoop]: Abstraction has 6881 states and 7671 transitions. [2019-09-08 07:14:28,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-08 07:14:28,672 INFO L276 IsEmpty]: Start isEmpty. Operand 6881 states and 7671 transitions. [2019-09-08 07:14:28,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2019-09-08 07:14:28,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:14:28,679 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 12, 12, 10, 10, 10, 10, 9, 8, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-09-08 07:14:28,680 INFO L418 AbstractCegarLoop]: === Iteration 56 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:14:28,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:14:28,680 INFO L82 PathProgramCache]: Analyzing trace with hash 175024067, now seen corresponding path program 1 times [2019-09-08 07:14:28,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:14:28,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:14:28,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:14:28,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:14:28,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:14:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:14:29,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 26 proven. 30 refuted. 0 times theorem prover too weak. 1227 trivial. 0 not checked. [2019-09-08 07:14:29,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:14:29,471 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:14:29,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:14:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:14:29,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 2116 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-08 07:14:29,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:14:30,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 537 proven. 89 refuted. 0 times theorem prover too weak. 657 trivial. 0 not checked. [2019-09-08 07:14:30,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:14:30,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 17] total 44 [2019-09-08 07:14:30,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-08 07:14:30,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-08 07:14:30,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1751, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 07:14:30,576 INFO L87 Difference]: Start difference. First operand 6881 states and 7671 transitions. Second operand 44 states. [2019-09-08 07:15:27,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:15:27,367 INFO L93 Difference]: Finished difference Result 33551 states and 40025 transitions. [2019-09-08 07:15:27,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 257 states. [2019-09-08 07:15:27,367 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 467 [2019-09-08 07:15:27,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:15:27,420 INFO L225 Difference]: With dead ends: 33551 [2019-09-08 07:15:27,420 INFO L226 Difference]: Without dead ends: 27496 [2019-09-08 07:15:27,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 505 SyntacticMatches, 1 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32668 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=6410, Invalid=80320, Unknown=0, NotChecked=0, Total=86730 [2019-09-08 07:15:27,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27496 states. [2019-09-08 07:15:28,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27496 to 9487. [2019-09-08 07:15:28,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9487 states. [2019-09-08 07:15:28,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9487 states to 9487 states and 10612 transitions. [2019-09-08 07:15:28,924 INFO L78 Accepts]: Start accepts. Automaton has 9487 states and 10612 transitions. Word has length 467 [2019-09-08 07:15:28,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:15:28,924 INFO L475 AbstractCegarLoop]: Abstraction has 9487 states and 10612 transitions. [2019-09-08 07:15:28,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-08 07:15:28,925 INFO L276 IsEmpty]: Start isEmpty. Operand 9487 states and 10612 transitions. [2019-09-08 07:15:28,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2019-09-08 07:15:28,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:15:28,934 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 12, 12, 10, 10, 10, 10, 9, 8, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-09-08 07:15:28,934 INFO L418 AbstractCegarLoop]: === Iteration 57 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:15:28,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:15:28,934 INFO L82 PathProgramCache]: Analyzing trace with hash 2028533573, now seen corresponding path program 1 times [2019-09-08 07:15:28,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:15:28,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:15:28,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:15:28,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:15:28,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:15:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:15:29,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-09-08 07:15:29,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:15:29,100 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:15:29,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:15:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:15:29,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 2115 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-08 07:15:29,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:15:29,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 489 proven. 56 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2019-09-08 07:15:29,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:15:29,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 12] total 13 [2019-09-08 07:15:29,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:15:29,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:15:29,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:15:29,749 INFO L87 Difference]: Start difference. First operand 9487 states and 10612 transitions. Second operand 13 states. [2019-09-08 07:15:32,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:15:32,256 INFO L93 Difference]: Finished difference Result 16718 states and 18746 transitions. [2019-09-08 07:15:32,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 07:15:32,256 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 467 [2019-09-08 07:15:32,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:15:32,272 INFO L225 Difference]: With dead ends: 16718 [2019-09-08 07:15:32,272 INFO L226 Difference]: Without dead ends: 7809 [2019-09-08 07:15:32,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 461 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2019-09-08 07:15:32,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7809 states. [2019-09-08 07:15:33,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7809 to 7352. [2019-09-08 07:15:33,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7352 states. [2019-09-08 07:15:33,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7352 states to 7352 states and 8164 transitions. [2019-09-08 07:15:33,411 INFO L78 Accepts]: Start accepts. Automaton has 7352 states and 8164 transitions. Word has length 467 [2019-09-08 07:15:33,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:15:33,412 INFO L475 AbstractCegarLoop]: Abstraction has 7352 states and 8164 transitions. [2019-09-08 07:15:33,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 07:15:33,412 INFO L276 IsEmpty]: Start isEmpty. Operand 7352 states and 8164 transitions. [2019-09-08 07:15:33,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2019-09-08 07:15:33,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:15:33,420 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-09-08 07:15:33,420 INFO L418 AbstractCegarLoop]: === Iteration 58 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:15:33,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:15:33,420 INFO L82 PathProgramCache]: Analyzing trace with hash -288762118, now seen corresponding path program 1 times [2019-09-08 07:15:33,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:15:33,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:15:33,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:15:33,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:15:33,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:15:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:15:33,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 1246 trivial. 0 not checked. [2019-09-08 07:15:33,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:15:33,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:15:33,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:15:33,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:15:33,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:15:33,759 INFO L87 Difference]: Start difference. First operand 7352 states and 8164 transitions. Second operand 11 states. [2019-09-08 07:15:36,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:15:36,978 INFO L93 Difference]: Finished difference Result 19601 states and 22477 transitions. [2019-09-08 07:15:36,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 07:15:36,979 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 466 [2019-09-08 07:15:36,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:15:37,004 INFO L225 Difference]: With dead ends: 19601 [2019-09-08 07:15:37,004 INFO L226 Difference]: Without dead ends: 13069 [2019-09-08 07:15:37,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2019-09-08 07:15:37,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13069 states. [2019-09-08 07:15:38,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13069 to 7478. [2019-09-08 07:15:38,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7478 states. [2019-09-08 07:15:38,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7478 states to 7478 states and 8281 transitions. [2019-09-08 07:15:38,302 INFO L78 Accepts]: Start accepts. Automaton has 7478 states and 8281 transitions. Word has length 466 [2019-09-08 07:15:38,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:15:38,302 INFO L475 AbstractCegarLoop]: Abstraction has 7478 states and 8281 transitions. [2019-09-08 07:15:38,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:15:38,302 INFO L276 IsEmpty]: Start isEmpty. Operand 7478 states and 8281 transitions. [2019-09-08 07:15:38,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2019-09-08 07:15:38,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:15:38,309 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-09-08 07:15:38,309 INFO L418 AbstractCegarLoop]: === Iteration 59 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:15:38,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:15:38,309 INFO L82 PathProgramCache]: Analyzing trace with hash -30596680, now seen corresponding path program 1 times [2019-09-08 07:15:38,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:15:38,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:15:38,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:15:38,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:15:38,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:15:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:15:38,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1267 trivial. 0 not checked. [2019-09-08 07:15:38,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:15:38,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:15:38,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:15:38,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:15:38,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:15:38,453 INFO L87 Difference]: Start difference. First operand 7478 states and 8281 transitions. Second operand 4 states. [2019-09-08 07:15:39,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:15:39,575 INFO L93 Difference]: Finished difference Result 14181 states and 15767 transitions. [2019-09-08 07:15:39,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:15:39,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 466 [2019-09-08 07:15:39,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:15:39,590 INFO L225 Difference]: With dead ends: 14181 [2019-09-08 07:15:39,590 INFO L226 Difference]: Without dead ends: 7548 [2019-09-08 07:15:39,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:15:39,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7548 states. [2019-09-08 07:15:40,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7548 to 7478. [2019-09-08 07:15:40,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7478 states. [2019-09-08 07:15:40,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7478 states to 7478 states and 8271 transitions. [2019-09-08 07:15:40,849 INFO L78 Accepts]: Start accepts. Automaton has 7478 states and 8271 transitions. Word has length 466 [2019-09-08 07:15:40,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:15:40,850 INFO L475 AbstractCegarLoop]: Abstraction has 7478 states and 8271 transitions. [2019-09-08 07:15:40,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:15:40,850 INFO L276 IsEmpty]: Start isEmpty. Operand 7478 states and 8271 transitions. [2019-09-08 07:15:40,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2019-09-08 07:15:40,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:15:40,857 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-09-08 07:15:40,857 INFO L418 AbstractCegarLoop]: === Iteration 60 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:15:40,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:15:40,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1103690991, now seen corresponding path program 1 times [2019-09-08 07:15:40,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:15:40,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:15:40,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:15:40,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:15:40,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:15:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:15:41,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1284 backedges. 85 proven. 52 refuted. 0 times theorem prover too weak. 1147 trivial. 0 not checked. [2019-09-08 07:15:41,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:15:41,379 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:15:41,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:15:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:15:41,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 2122 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-08 07:15:41,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:15:41,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1284 backedges. 544 proven. 98 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2019-09-08 07:15:41,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:15:41,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 18 [2019-09-08 07:15:41,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 07:15:41,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 07:15:41,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-09-08 07:15:41,898 INFO L87 Difference]: Start difference. First operand 7478 states and 8271 transitions. Second operand 18 states. [2019-09-08 07:15:48,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:15:48,870 INFO L93 Difference]: Finished difference Result 20475 states and 22803 transitions. [2019-09-08 07:15:48,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-08 07:15:48,871 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 466 [2019-09-08 07:15:48,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:15:48,896 INFO L225 Difference]: With dead ends: 20475 [2019-09-08 07:15:48,896 INFO L226 Difference]: Without dead ends: 13790 [2019-09-08 07:15:48,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 501 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=591, Invalid=3699, Unknown=0, NotChecked=0, Total=4290 [2019-09-08 07:15:48,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13790 states. [2019-09-08 07:15:50,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13790 to 11728. [2019-09-08 07:15:50,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11728 states. [2019-09-08 07:15:50,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11728 states to 11728 states and 12943 transitions. [2019-09-08 07:15:50,930 INFO L78 Accepts]: Start accepts. Automaton has 11728 states and 12943 transitions. Word has length 466 [2019-09-08 07:15:50,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:15:50,931 INFO L475 AbstractCegarLoop]: Abstraction has 11728 states and 12943 transitions. [2019-09-08 07:15:50,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 07:15:50,931 INFO L276 IsEmpty]: Start isEmpty. Operand 11728 states and 12943 transitions. [2019-09-08 07:15:50,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2019-09-08 07:15:50,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:15:50,941 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-09-08 07:15:50,941 INFO L418 AbstractCegarLoop]: === Iteration 61 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:15:50,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:15:50,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1902701431, now seen corresponding path program 1 times [2019-09-08 07:15:50,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:15:50,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:15:50,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:15:50,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:15:50,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:15:50,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:15:51,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 1254 trivial. 0 not checked. [2019-09-08 07:15:51,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:15:51,291 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:15:51,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:15:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:15:51,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 2137 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-08 07:15:51,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:15:51,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 536 proven. 92 refuted. 0 times theorem prover too weak. 654 trivial. 0 not checked. [2019-09-08 07:15:51,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:15:51,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2019-09-08 07:15:51,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 07:15:51,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 07:15:51,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=642, Unknown=0, NotChecked=0, Total=702 [2019-09-08 07:15:51,952 INFO L87 Difference]: Start difference. First operand 11728 states and 12943 transitions. Second operand 27 states. [2019-09-08 07:16:34,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:16:34,081 INFO L93 Difference]: Finished difference Result 53088 states and 60218 transitions. [2019-09-08 07:16:34,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 354 states. [2019-09-08 07:16:34,081 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 468 [2019-09-08 07:16:34,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:16:34,157 INFO L225 Difference]: With dead ends: 53088 [2019-09-08 07:16:34,157 INFO L226 Difference]: Without dead ends: 42201 [2019-09-08 07:16:34,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 936 GetRequests, 558 SyntacticMatches, 1 SemanticMatches, 377 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60456 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=11148, Invalid=132114, Unknown=0, NotChecked=0, Total=143262 [2019-09-08 07:16:34,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42201 states. [2019-09-08 07:16:37,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42201 to 19175. [2019-09-08 07:16:37,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19175 states. [2019-09-08 07:16:38,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19175 states to 19175 states and 21051 transitions. [2019-09-08 07:16:38,021 INFO L78 Accepts]: Start accepts. Automaton has 19175 states and 21051 transitions. Word has length 468 [2019-09-08 07:16:38,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:16:38,021 INFO L475 AbstractCegarLoop]: Abstraction has 19175 states and 21051 transitions. [2019-09-08 07:16:38,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 07:16:38,022 INFO L276 IsEmpty]: Start isEmpty. Operand 19175 states and 21051 transitions. [2019-09-08 07:16:38,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2019-09-08 07:16:38,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:16:38,040 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-09-08 07:16:38,040 INFO L418 AbstractCegarLoop]: === Iteration 62 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:16:38,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:16:38,041 INFO L82 PathProgramCache]: Analyzing trace with hash -801180767, now seen corresponding path program 1 times [2019-09-08 07:16:38,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:16:38,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:16:38,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:16:38,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:16:38,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:16:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:16:38,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1280 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 1252 trivial. 0 not checked. [2019-09-08 07:16:38,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:16:38,453 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:16:38,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:16:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:16:38,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 2152 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-08 07:16:38,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:16:39,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1280 backedges. 385 proven. 290 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2019-09-08 07:16:39,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:16:39,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 26] total 42 [2019-09-08 07:16:39,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-08 07:16:39,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-08 07:16:39,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1605, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 07:16:39,767 INFO L87 Difference]: Start difference. First operand 19175 states and 21051 transitions. Second operand 42 states. [2019-09-08 07:17:32,192 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2019-09-08 07:17:55,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:17:55,801 INFO L93 Difference]: Finished difference Result 76374 states and 88559 transitions. [2019-09-08 07:17:55,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 465 states. [2019-09-08 07:17:55,802 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 470 [2019-09-08 07:17:55,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:17:55,931 INFO L225 Difference]: With dead ends: 76374 [2019-09-08 07:17:55,931 INFO L226 Difference]: Without dead ends: 58630 [2019-09-08 07:17:55,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1113 GetRequests, 617 SyntacticMatches, 2 SemanticMatches, 494 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103957 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=13756, Invalid=231764, Unknown=0, NotChecked=0, Total=245520 [2019-09-08 07:17:55,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58630 states. [2019-09-08 07:18:03,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58630 to 26599. [2019-09-08 07:18:03,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26599 states. [2019-09-08 07:18:03,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26599 states to 26599 states and 29217 transitions. [2019-09-08 07:18:03,428 INFO L78 Accepts]: Start accepts. Automaton has 26599 states and 29217 transitions. Word has length 470 [2019-09-08 07:18:03,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:18:03,429 INFO L475 AbstractCegarLoop]: Abstraction has 26599 states and 29217 transitions. [2019-09-08 07:18:03,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-08 07:18:03,429 INFO L276 IsEmpty]: Start isEmpty. Operand 26599 states and 29217 transitions. [2019-09-08 07:18:03,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2019-09-08 07:18:03,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:18:03,455 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-09-08 07:18:03,455 INFO L418 AbstractCegarLoop]: === Iteration 63 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:18:03,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:18:03,456 INFO L82 PathProgramCache]: Analyzing trace with hash 495776395, now seen corresponding path program 1 times [2019-09-08 07:18:03,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:18:03,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:18:03,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:18:03,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:18:03,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:18:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:18:03,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1280 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 1257 trivial. 0 not checked. [2019-09-08 07:18:03,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:18:03,729 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:18:03,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:18:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:18:04,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 2153 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-08 07:18:04,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:18:04,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1280 backedges. 542 proven. 138 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-09-08 07:18:04,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:18:04,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 25] total 37 [2019-09-08 07:18:04,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-08 07:18:04,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-08 07:18:04,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1238, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 07:18:04,952 INFO L87 Difference]: Start difference. First operand 26599 states and 29217 transitions. Second operand 37 states.