/usr/bin/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.1.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:15:55,480 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:15:55,483 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:15:55,499 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:15:55,500 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:15:55,501 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:15:55,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:15:55,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:15:55,506 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:15:55,507 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:15:55,508 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:15:55,509 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:15:55,510 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:15:55,511 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:15:55,511 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:15:55,513 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:15:55,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:15:55,514 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:15:55,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:15:55,518 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:15:55,519 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:15:55,522 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:15:55,523 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:15:55,526 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:15:55,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:15:55,530 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:15:55,531 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:15:55,532 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:15:55,534 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:15:55,535 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:15:55,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:15:55,535 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:15:55,539 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:15:55,540 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:15:55,540 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:15:55,544 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:15:55,545 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:15:55,545 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:15:55,545 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:15:55,546 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:15:55,547 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:15:55,549 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-11-06 22:15:55,565 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:15:55,566 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:15:55,567 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:15:55,567 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:15:55,567 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:15:55,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:15:55,568 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:15:55,568 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:15:55,568 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:15:55,569 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:15:55,569 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:15:55,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:15:55,569 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:15:55,569 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:15:55,569 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:15:55,570 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:15:55,570 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:15:55,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:15:55,570 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:15:55,571 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:15:55,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:15:55,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:15:55,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:15:55,571 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:15:55,572 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:15:55,572 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:15:55,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:15:55,572 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:15:55,572 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 22:15:55,888 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:15:55,906 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:15:55,910 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:15:55,911 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:15:55,912 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:15:55,912 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-11-06 22:15:55,978 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ae7ee0e3/361c647fc4774a45860dbcd7d8fa73b3/FLAG55554359d [2019-11-06 22:15:56,468 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:15:56,471 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-11-06 22:15:56,499 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ae7ee0e3/361c647fc4774a45860dbcd7d8fa73b3/FLAG55554359d [2019-11-06 22:15:56,788 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ae7ee0e3/361c647fc4774a45860dbcd7d8fa73b3 [2019-11-06 22:15:56,796 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:15:56,797 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:15:56,798 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:15:56,798 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:15:56,802 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:15:56,803 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:15:56" (1/1) ... [2019-11-06 22:15:56,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f899ec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:56, skipping insertion in model container [2019-11-06 22:15:56,806 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:15:56" (1/1) ... [2019-11-06 22:15:56,814 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:15:56,868 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:15:57,238 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:15:57,258 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:15:57,320 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:15:57,357 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:15:57,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:57 WrapperNode [2019-11-06 22:15:57,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:15:57,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:15:57,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:15:57,359 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:15:57,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:57" (1/1) ... [2019-11-06 22:15:57,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:57" (1/1) ... [2019-11-06 22:15:57,385 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:57" (1/1) ... [2019-11-06 22:15:57,385 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:57" (1/1) ... [2019-11-06 22:15:57,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:57" (1/1) ... [2019-11-06 22:15:57,430 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:57" (1/1) ... [2019-11-06 22:15:57,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:57" (1/1) ... [2019-11-06 22:15:57,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:15:57,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:15:57,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:15:57,440 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:15:57,441 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:57" (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-11-06 22:15:57,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:15:57,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:15:57,502 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2019-11-06 22:15:57,502 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2019-11-06 22:15:57,502 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2019-11-06 22:15:57,502 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_int8 [2019-11-06 22:15:57,502 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2019-11-06 22:15:57,503 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-11-06 22:15:57,503 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-11-06 22:15:57,503 INFO L138 BoogieDeclarations]: Found implementation of procedure gate1_each_pals_period [2019-11-06 22:15:57,503 INFO L138 BoogieDeclarations]: Found implementation of procedure gate2_each_pals_period [2019-11-06 22:15:57,503 INFO L138 BoogieDeclarations]: Found implementation of procedure gate3_each_pals_period [2019-11-06 22:15:57,504 INFO L138 BoogieDeclarations]: Found implementation of procedure voter [2019-11-06 22:15:57,504 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:15:57,504 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-11-06 22:15:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:15:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-06 22:15:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-06 22:15:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-06 22:15:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-06 22:15:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 22:15:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-06 22:15:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2019-11-06 22:15:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2019-11-06 22:15:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2019-11-06 22:15:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_int8 [2019-11-06 22:15:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2019-11-06 22:15:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-06 22:15:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-06 22:15:57,507 INFO L130 BoogieDeclarations]: Found specification of procedure gate1_each_pals_period [2019-11-06 22:15:57,507 INFO L130 BoogieDeclarations]: Found specification of procedure gate2_each_pals_period [2019-11-06 22:15:57,507 INFO L130 BoogieDeclarations]: Found specification of procedure gate3_each_pals_period [2019-11-06 22:15:57,507 INFO L130 BoogieDeclarations]: Found specification of procedure voter [2019-11-06 22:15:57,507 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:15:57,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:15:57,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:15:58,324 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:15:58,324 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-06 22:15:58,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:15:58 BoogieIcfgContainer [2019-11-06 22:15:58,326 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:15:58,327 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:15:58,328 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:15:58,331 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:15:58,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:15:56" (1/3) ... [2019-11-06 22:15:58,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11179f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:15:58, skipping insertion in model container [2019-11-06 22:15:58,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:57" (2/3) ... [2019-11-06 22:15:58,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11179f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:15:58, skipping insertion in model container [2019-11-06 22:15:58,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:15:58" (3/3) ... [2019-11-06 22:15:58,336 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-11-06 22:15:58,346 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:15:58,354 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:15:58,366 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:15:58,404 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:15:58,404 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:15:58,404 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:15:58,405 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:15:58,405 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:15:58,405 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:15:58,405 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:15:58,405 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:15:58,430 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states. [2019-11-06 22:15:58,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-06 22:15:58,437 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:58,438 INFO L410 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-11-06 22:15:58,440 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:58,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:58,445 INFO L82 PathProgramCache]: Analyzing trace with hash -968101902, now seen corresponding path program 1 times [2019-11-06 22:15:58,452 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:58,453 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669901410] [2019-11-06 22:15:58,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:58,861 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-06 22:15:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:58,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:15:58,892 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669901410] [2019-11-06 22:15:58,893 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:58,894 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:15:58,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568488586] [2019-11-06 22:15:58,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:15:58,901 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:58,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:15:58,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:15:58,919 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 5 states. [2019-11-06 22:15:59,427 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-11-06 22:16:00,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:00,594 INFO L93 Difference]: Finished difference Result 423 states and 685 transitions. [2019-11-06 22:16:00,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:16:00,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-06 22:16:00,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:00,611 INFO L225 Difference]: With dead ends: 423 [2019-11-06 22:16:00,612 INFO L226 Difference]: Without dead ends: 217 [2019-11-06 22:16:00,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:16:00,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-11-06 22:16:00,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 211. [2019-11-06 22:16:00,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-11-06 22:16:00,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 314 transitions. [2019-11-06 22:16:00,727 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 314 transitions. Word has length 21 [2019-11-06 22:16:00,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:00,728 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 314 transitions. [2019-11-06 22:16:00,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:16:00,728 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 314 transitions. [2019-11-06 22:16:00,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 22:16:00,731 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:00,731 INFO L410 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-11-06 22:16:00,731 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:00,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:00,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1316040493, now seen corresponding path program 1 times [2019-11-06 22:16:00,732 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:00,732 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806430437] [2019-11-06 22:16:00,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:00,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:00,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:16:00,984 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806430437] [2019-11-06 22:16:00,984 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:00,984 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:16:00,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389226731] [2019-11-06 22:16:00,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:16:00,986 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:00,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:16:00,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:16:00,988 INFO L87 Difference]: Start difference. First operand 211 states and 314 transitions. Second operand 5 states. [2019-11-06 22:16:01,230 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-11-06 22:16:02,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:02,450 INFO L93 Difference]: Finished difference Result 433 states and 651 transitions. [2019-11-06 22:16:02,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:16:02,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-06 22:16:02,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:02,456 INFO L225 Difference]: With dead ends: 433 [2019-11-06 22:16:02,457 INFO L226 Difference]: Without dead ends: 231 [2019-11-06 22:16:02,459 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:16:02,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-11-06 22:16:02,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 224. [2019-11-06 22:16:02,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-06 22:16:02,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 330 transitions. [2019-11-06 22:16:02,498 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 330 transitions. Word has length 22 [2019-11-06 22:16:02,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:02,498 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 330 transitions. [2019-11-06 22:16:02,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:16:02,499 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 330 transitions. [2019-11-06 22:16:02,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-06 22:16:02,501 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:02,501 INFO L410 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-11-06 22:16:02,501 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:02,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:02,502 INFO L82 PathProgramCache]: Analyzing trace with hash 919864782, now seen corresponding path program 1 times [2019-11-06 22:16:02,502 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:02,502 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707440452] [2019-11-06 22:16:02,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:02,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:16:02,662 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707440452] [2019-11-06 22:16:02,662 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:02,663 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:16:02,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056109546] [2019-11-06 22:16:02,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:16:02,664 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:02,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:16:02,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:16:02,664 INFO L87 Difference]: Start difference. First operand 224 states and 330 transitions. Second operand 4 states. [2019-11-06 22:16:03,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:03,749 INFO L93 Difference]: Finished difference Result 465 states and 697 transitions. [2019-11-06 22:16:03,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:16:03,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-11-06 22:16:03,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:03,754 INFO L225 Difference]: With dead ends: 465 [2019-11-06 22:16:03,754 INFO L226 Difference]: Without dead ends: 257 [2019-11-06 22:16:03,755 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:16:03,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-11-06 22:16:03,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 226. [2019-11-06 22:16:03,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-06 22:16:03,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 332 transitions. [2019-11-06 22:16:03,801 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 332 transitions. Word has length 30 [2019-11-06 22:16:03,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:03,802 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 332 transitions. [2019-11-06 22:16:03,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:16:03,802 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 332 transitions. [2019-11-06 22:16:03,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-06 22:16:03,804 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:03,804 INFO L410 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-11-06 22:16:03,804 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:03,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:03,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1667611779, now seen corresponding path program 1 times [2019-11-06 22:16:03,805 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:03,805 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694244942] [2019-11-06 22:16:03,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:03,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:16:03,999 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694244942] [2019-11-06 22:16:03,999 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:04,000 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 22:16:04,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453952383] [2019-11-06 22:16:04,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 22:16:04,001 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:04,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:16:04,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:16:04,001 INFO L87 Difference]: Start difference. First operand 226 states and 332 transitions. Second operand 6 states. [2019-11-06 22:16:05,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:05,625 INFO L93 Difference]: Finished difference Result 442 states and 655 transitions. [2019-11-06 22:16:05,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:16:05,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-11-06 22:16:05,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:05,628 INFO L225 Difference]: With dead ends: 442 [2019-11-06 22:16:05,628 INFO L226 Difference]: Without dead ends: 238 [2019-11-06 22:16:05,630 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:16:05,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-11-06 22:16:05,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 230. [2019-11-06 22:16:05,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-06 22:16:05,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 336 transitions. [2019-11-06 22:16:05,659 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 336 transitions. Word has length 38 [2019-11-06 22:16:05,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:05,660 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 336 transitions. [2019-11-06 22:16:05,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 22:16:05,660 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 336 transitions. [2019-11-06 22:16:05,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-06 22:16:05,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:05,668 INFO L410 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-11-06 22:16:05,668 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:05,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:05,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1792772014, now seen corresponding path program 1 times [2019-11-06 22:16:05,669 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:05,669 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053450257] [2019-11-06 22:16:05,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:05,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:16:05,867 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053450257] [2019-11-06 22:16:05,867 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:05,867 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:16:05,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924994230] [2019-11-06 22:16:05,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:16:05,868 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:05,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:16:05,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:16:05,869 INFO L87 Difference]: Start difference. First operand 230 states and 336 transitions. Second operand 5 states. [2019-11-06 22:16:06,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:06,971 INFO L93 Difference]: Finished difference Result 403 states and 594 transitions. [2019-11-06 22:16:06,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:16:06,971 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-11-06 22:16:06,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:06,975 INFO L225 Difference]: With dead ends: 403 [2019-11-06 22:16:06,975 INFO L226 Difference]: Without dead ends: 230 [2019-11-06 22:16:06,976 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:16:06,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-06 22:16:06,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 226. [2019-11-06 22:16:06,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-06 22:16:06,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 327 transitions. [2019-11-06 22:16:06,996 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 327 transitions. Word has length 39 [2019-11-06 22:16:06,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:06,997 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 327 transitions. [2019-11-06 22:16:06,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:16:06,997 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 327 transitions. [2019-11-06 22:16:06,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-06 22:16:06,998 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:06,998 INFO L410 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-11-06 22:16:06,998 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:06,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:06,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1839866744, now seen corresponding path program 1 times [2019-11-06 22:16:06,999 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:06,999 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63503978] [2019-11-06 22:16:06,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:07,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 22:16:07,128 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63503978] [2019-11-06 22:16:07,128 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:07,129 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:16:07,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172343579] [2019-11-06 22:16:07,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:16:07,129 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:07,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:16:07,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:16:07,130 INFO L87 Difference]: Start difference. First operand 226 states and 327 transitions. Second operand 5 states. [2019-11-06 22:16:08,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:08,437 INFO L93 Difference]: Finished difference Result 452 states and 664 transitions. [2019-11-06 22:16:08,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:16:08,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-11-06 22:16:08,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:08,442 INFO L225 Difference]: With dead ends: 452 [2019-11-06 22:16:08,442 INFO L226 Difference]: Without dead ends: 249 [2019-11-06 22:16:08,444 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:16:08,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-11-06 22:16:08,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 242. [2019-11-06 22:16:08,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-06 22:16:08,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 346 transitions. [2019-11-06 22:16:08,465 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 346 transitions. Word has length 41 [2019-11-06 22:16:08,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:08,466 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 346 transitions. [2019-11-06 22:16:08,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:16:08,466 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 346 transitions. [2019-11-06 22:16:08,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-06 22:16:08,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:08,467 INFO L410 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-11-06 22:16:08,467 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:08,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:08,468 INFO L82 PathProgramCache]: Analyzing trace with hash 968772057, now seen corresponding path program 1 times [2019-11-06 22:16:08,468 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:08,468 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681994073] [2019-11-06 22:16:08,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:08,608 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-06 22:16:08,608 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681994073] [2019-11-06 22:16:08,608 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:08,608 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:16:08,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366421561] [2019-11-06 22:16:08,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:16:08,609 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:08,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:16:08,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:16:08,610 INFO L87 Difference]: Start difference. First operand 242 states and 346 transitions. Second operand 5 states. [2019-11-06 22:16:09,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:09,978 INFO L93 Difference]: Finished difference Result 472 states and 692 transitions. [2019-11-06 22:16:09,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:16:09,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-11-06 22:16:09,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:09,983 INFO L225 Difference]: With dead ends: 472 [2019-11-06 22:16:09,983 INFO L226 Difference]: Without dead ends: 255 [2019-11-06 22:16:09,984 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:16:09,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-06 22:16:10,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 249. [2019-11-06 22:16:10,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-11-06 22:16:10,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 354 transitions. [2019-11-06 22:16:10,004 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 354 transitions. Word has length 41 [2019-11-06 22:16:10,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:10,005 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 354 transitions. [2019-11-06 22:16:10,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:16:10,005 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 354 transitions. [2019-11-06 22:16:10,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-06 22:16:10,006 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:10,006 INFO L410 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-11-06 22:16:10,006 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:10,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:10,006 INFO L82 PathProgramCache]: Analyzing trace with hash -966374096, now seen corresponding path program 1 times [2019-11-06 22:16:10,007 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:10,007 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109178636] [2019-11-06 22:16:10,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:10,172 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-06 22:16:10,172 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109178636] [2019-11-06 22:16:10,172 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:10,172 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 22:16:10,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221506374] [2019-11-06 22:16:10,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 22:16:10,174 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:10,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:16:10,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:16:10,175 INFO L87 Difference]: Start difference. First operand 249 states and 354 transitions. Second operand 6 states. [2019-11-06 22:16:11,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:11,560 INFO L93 Difference]: Finished difference Result 471 states and 679 transitions. [2019-11-06 22:16:11,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:16:11,560 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-11-06 22:16:11,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:11,563 INFO L225 Difference]: With dead ends: 471 [2019-11-06 22:16:11,563 INFO L226 Difference]: Without dead ends: 255 [2019-11-06 22:16:11,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:16:11,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-06 22:16:11,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 249. [2019-11-06 22:16:11,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-11-06 22:16:11,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 353 transitions. [2019-11-06 22:16:11,604 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 353 transitions. Word has length 59 [2019-11-06 22:16:11,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:11,606 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 353 transitions. [2019-11-06 22:16:11,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 22:16:11,607 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 353 transitions. [2019-11-06 22:16:11,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-06 22:16:11,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:11,608 INFO L410 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-11-06 22:16:11,608 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:11,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:11,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1964020213, now seen corresponding path program 1 times [2019-11-06 22:16:11,610 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:11,610 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883442811] [2019-11-06 22:16:11,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:11,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:11,819 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-06 22:16:11,820 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883442811] [2019-11-06 22:16:11,820 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:11,822 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:16:11,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117130693] [2019-11-06 22:16:11,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:16:11,824 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:11,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:16:11,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:16:11,824 INFO L87 Difference]: Start difference. First operand 249 states and 353 transitions. Second operand 5 states. [2019-11-06 22:16:13,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:13,136 INFO L93 Difference]: Finished difference Result 485 states and 701 transitions. [2019-11-06 22:16:13,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:16:13,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-11-06 22:16:13,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:13,140 INFO L225 Difference]: With dead ends: 485 [2019-11-06 22:16:13,141 INFO L226 Difference]: Without dead ends: 274 [2019-11-06 22:16:13,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:16:13,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-11-06 22:16:13,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 267. [2019-11-06 22:16:13,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-11-06 22:16:13,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 374 transitions. [2019-11-06 22:16:13,164 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 374 transitions. Word has length 62 [2019-11-06 22:16:13,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:13,165 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 374 transitions. [2019-11-06 22:16:13,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:16:13,165 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 374 transitions. [2019-11-06 22:16:13,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-06 22:16:13,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:13,166 INFO L410 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-11-06 22:16:13,166 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:13,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:13,166 INFO L82 PathProgramCache]: Analyzing trace with hash -2021002903, now seen corresponding path program 1 times [2019-11-06 22:16:13,167 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:13,167 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526334850] [2019-11-06 22:16:13,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:13,310 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-06 22:16:13,311 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526334850] [2019-11-06 22:16:13,311 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:13,311 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:16:13,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921560725] [2019-11-06 22:16:13,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:16:13,312 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:13,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:16:13,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:16:13,313 INFO L87 Difference]: Start difference. First operand 267 states and 374 transitions. Second operand 5 states. [2019-11-06 22:16:14,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:14,504 INFO L93 Difference]: Finished difference Result 492 states and 705 transitions. [2019-11-06 22:16:14,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:16:14,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-11-06 22:16:14,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:14,507 INFO L225 Difference]: With dead ends: 492 [2019-11-06 22:16:14,507 INFO L226 Difference]: Without dead ends: 265 [2019-11-06 22:16:14,509 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:16:14,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-11-06 22:16:14,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 261. [2019-11-06 22:16:14,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-11-06 22:16:14,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 360 transitions. [2019-11-06 22:16:14,529 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 360 transitions. Word has length 63 [2019-11-06 22:16:14,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:14,530 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 360 transitions. [2019-11-06 22:16:14,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:16:14,530 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 360 transitions. [2019-11-06 22:16:14,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-06 22:16:14,531 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:14,531 INFO L410 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-11-06 22:16:14,531 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:14,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:14,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1782318518, now seen corresponding path program 1 times [2019-11-06 22:16:14,532 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:14,532 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892865633] [2019-11-06 22:16:14,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:14,693 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-06 22:16:14,694 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892865633] [2019-11-06 22:16:14,694 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:14,694 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 22:16:14,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622936852] [2019-11-06 22:16:14,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 22:16:14,695 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:14,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:16:14,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:16:14,696 INFO L87 Difference]: Start difference. First operand 261 states and 360 transitions. Second operand 6 states. [2019-11-06 22:16:16,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:16,061 INFO L93 Difference]: Finished difference Result 479 states and 672 transitions. [2019-11-06 22:16:16,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:16:16,062 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-11-06 22:16:16,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:16,065 INFO L225 Difference]: With dead ends: 479 [2019-11-06 22:16:16,065 INFO L226 Difference]: Without dead ends: 267 [2019-11-06 22:16:16,066 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:16:16,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-11-06 22:16:16,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 261. [2019-11-06 22:16:16,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-11-06 22:16:16,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 359 transitions. [2019-11-06 22:16:16,086 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 359 transitions. Word has length 82 [2019-11-06 22:16:16,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:16,087 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 359 transitions. [2019-11-06 22:16:16,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 22:16:16,087 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 359 transitions. [2019-11-06 22:16:16,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-06 22:16:16,088 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:16,088 INFO L410 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-11-06 22:16:16,088 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:16,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:16,089 INFO L82 PathProgramCache]: Analyzing trace with hash 77251503, now seen corresponding path program 1 times [2019-11-06 22:16:16,089 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:16,089 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985288731] [2019-11-06 22:16:16,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:16,255 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-11-06 22:16:16,256 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985288731] [2019-11-06 22:16:16,256 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:16,256 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:16:16,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940620022] [2019-11-06 22:16:16,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:16:16,257 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:16,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:16:16,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:16:16,257 INFO L87 Difference]: Start difference. First operand 261 states and 359 transitions. Second operand 5 states. [2019-11-06 22:16:17,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:17,477 INFO L93 Difference]: Finished difference Result 468 states and 670 transitions. [2019-11-06 22:16:17,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:16:17,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-11-06 22:16:17,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:17,481 INFO L225 Difference]: With dead ends: 468 [2019-11-06 22:16:17,482 INFO L226 Difference]: Without dead ends: 263 [2019-11-06 22:16:17,483 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:16:17,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-11-06 22:16:17,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 259. [2019-11-06 22:16:17,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-11-06 22:16:17,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 355 transitions. [2019-11-06 22:16:17,513 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 355 transitions. Word has length 85 [2019-11-06 22:16:17,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:17,514 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 355 transitions. [2019-11-06 22:16:17,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:16:17,514 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 355 transitions. [2019-11-06 22:16:17,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-06 22:16:17,516 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:17,516 INFO L410 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-11-06 22:16:17,516 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:17,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:17,517 INFO L82 PathProgramCache]: Analyzing trace with hash -763139322, now seen corresponding path program 1 times [2019-11-06 22:16:17,517 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:17,518 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120589374] [2019-11-06 22:16:17,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:17,752 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-06 22:16:17,753 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120589374] [2019-11-06 22:16:17,753 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064837728] [2019-11-06 22:16:17,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:16:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:17,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 22:16:17,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:16:17,949 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-06 22:16:17,950 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:16:17,950 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-11-06 22:16:17,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838484443] [2019-11-06 22:16:17,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:16:17,951 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:17,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:16:17,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:16:17,952 INFO L87 Difference]: Start difference. First operand 259 states and 355 transitions. Second operand 5 states. [2019-11-06 22:16:18,211 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-11-06 22:16:19,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:19,232 INFO L93 Difference]: Finished difference Result 598 states and 830 transitions. [2019-11-06 22:16:19,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:16:19,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-11-06 22:16:19,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:19,235 INFO L225 Difference]: With dead ends: 598 [2019-11-06 22:16:19,235 INFO L226 Difference]: Without dead ends: 356 [2019-11-06 22:16:19,237 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:16:19,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-11-06 22:16:19,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 304. [2019-11-06 22:16:19,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-11-06 22:16:19,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 415 transitions. [2019-11-06 22:16:19,265 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 415 transitions. Word has length 100 [2019-11-06 22:16:19,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:19,265 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 415 transitions. [2019-11-06 22:16:19,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:16:19,266 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 415 transitions. [2019-11-06 22:16:19,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-06 22:16:19,267 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:19,267 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:16:19,471 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:16:19,471 INFO L410 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:19,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:19,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1993729478, now seen corresponding path program 1 times [2019-11-06 22:16:19,472 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:19,472 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592877703] [2019-11-06 22:16:19,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:19,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:19,690 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-11-06 22:16:19,691 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592877703] [2019-11-06 22:16:19,691 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:19,691 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:16:19,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054320686] [2019-11-06 22:16:19,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:16:19,693 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:19,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:16:19,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:16:19,694 INFO L87 Difference]: Start difference. First operand 304 states and 415 transitions. Second operand 5 states. [2019-11-06 22:16:21,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:21,032 INFO L93 Difference]: Finished difference Result 481 states and 668 transitions. [2019-11-06 22:16:21,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:16:21,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-11-06 22:16:21,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:21,036 INFO L225 Difference]: With dead ends: 481 [2019-11-06 22:16:21,036 INFO L226 Difference]: Without dead ends: 297 [2019-11-06 22:16:21,037 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:16:21,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-11-06 22:16:21,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 293. [2019-11-06 22:16:21,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-11-06 22:16:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 397 transitions. [2019-11-06 22:16:21,062 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 397 transitions. Word has length 141 [2019-11-06 22:16:21,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:21,062 INFO L462 AbstractCegarLoop]: Abstraction has 293 states and 397 transitions. [2019-11-06 22:16:21,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:16:21,062 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 397 transitions. [2019-11-06 22:16:21,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-06 22:16:21,064 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:21,064 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:16:21,064 INFO L410 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:21,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:21,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1356364028, now seen corresponding path program 1 times [2019-11-06 22:16:21,065 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:21,065 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962132135] [2019-11-06 22:16:21,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:21,273 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-11-06 22:16:21,273 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962132135] [2019-11-06 22:16:21,273 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:21,273 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:16:21,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143043399] [2019-11-06 22:16:21,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:16:21,274 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:21,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:16:21,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:16:21,275 INFO L87 Difference]: Start difference. First operand 293 states and 397 transitions. Second operand 5 states. [2019-11-06 22:16:22,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:22,551 INFO L93 Difference]: Finished difference Result 470 states and 650 transitions. [2019-11-06 22:16:22,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:16:22,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-11-06 22:16:22,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:22,555 INFO L225 Difference]: With dead ends: 470 [2019-11-06 22:16:22,555 INFO L226 Difference]: Without dead ends: 285 [2019-11-06 22:16:22,556 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:16:22,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-06 22:16:22,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 281. [2019-11-06 22:16:22,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-11-06 22:16:22,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 378 transitions. [2019-11-06 22:16:22,585 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 378 transitions. Word has length 143 [2019-11-06 22:16:22,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:22,585 INFO L462 AbstractCegarLoop]: Abstraction has 281 states and 378 transitions. [2019-11-06 22:16:22,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:16:22,586 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 378 transitions. [2019-11-06 22:16:22,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-06 22:16:22,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:22,589 INFO L410 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-11-06 22:16:22,589 INFO L410 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:22,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:22,590 INFO L82 PathProgramCache]: Analyzing trace with hash -267545431, now seen corresponding path program 1 times [2019-11-06 22:16:22,590 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:22,590 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019084746] [2019-11-06 22:16:22,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:22,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:22,849 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-11-06 22:16:22,849 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019084746] [2019-11-06 22:16:22,849 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136361916] [2019-11-06 22:16:22,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:16:23,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:23,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 22:16:23,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:16:23,051 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 74 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-06 22:16:23,051 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:16:23,051 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-11-06 22:16:23,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307205321] [2019-11-06 22:16:23,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 22:16:23,052 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:23,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:16:23,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:16:23,053 INFO L87 Difference]: Start difference. First operand 281 states and 378 transitions. Second operand 6 states. [2019-11-06 22:16:24,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:24,384 INFO L93 Difference]: Finished difference Result 587 states and 797 transitions. [2019-11-06 22:16:24,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:16:24,385 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-11-06 22:16:24,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:24,388 INFO L225 Difference]: With dead ends: 587 [2019-11-06 22:16:24,388 INFO L226 Difference]: Without dead ends: 329 [2019-11-06 22:16:24,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:16:24,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-11-06 22:16:24,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 319. [2019-11-06 22:16:24,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-11-06 22:16:24,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 425 transitions. [2019-11-06 22:16:24,428 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 425 transitions. Word has length 144 [2019-11-06 22:16:24,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:24,428 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 425 transitions. [2019-11-06 22:16:24,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 22:16:24,429 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 425 transitions. [2019-11-06 22:16:24,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-06 22:16:24,431 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:24,431 INFO L410 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:16:24,635 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:16:24,636 INFO L410 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:24,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:24,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1984275244, now seen corresponding path program 2 times [2019-11-06 22:16:24,637 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:24,637 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886942588] [2019-11-06 22:16:24,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,926 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2019-11-06 22:16:24,926 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886942588] [2019-11-06 22:16:24,927 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:24,927 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 22:16:24,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728689808] [2019-11-06 22:16:24,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 22:16:24,928 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:24,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:16:24,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:16:24,929 INFO L87 Difference]: Start difference. First operand 319 states and 425 transitions. Second operand 6 states. [2019-11-06 22:16:26,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:26,296 INFO L93 Difference]: Finished difference Result 495 states and 677 transitions. [2019-11-06 22:16:26,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:16:26,297 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 183 [2019-11-06 22:16:26,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:26,300 INFO L225 Difference]: With dead ends: 495 [2019-11-06 22:16:26,301 INFO L226 Difference]: Without dead ends: 323 [2019-11-06 22:16:26,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:16:26,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-11-06 22:16:26,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 319. [2019-11-06 22:16:26,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-11-06 22:16:26,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 419 transitions. [2019-11-06 22:16:26,329 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 419 transitions. Word has length 183 [2019-11-06 22:16:26,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:26,329 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 419 transitions. [2019-11-06 22:16:26,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 22:16:26,330 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 419 transitions. [2019-11-06 22:16:26,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-06 22:16:26,332 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:26,332 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:16:26,332 INFO L410 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:26,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:26,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1391084918, now seen corresponding path program 2 times [2019-11-06 22:16:26,333 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:26,333 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141358661] [2019-11-06 22:16:26,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:26,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:26,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:26,632 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2019-11-06 22:16:26,633 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141358661] [2019-11-06 22:16:26,633 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399726399] [2019-11-06 22:16:26,633 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:16:26,782 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-06 22:16:26,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 22:16:26,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-06 22:16:26,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:16:26,845 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-11-06 22:16:26,846 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:16:26,846 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-06 22:16:26,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455801305] [2019-11-06 22:16:26,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:16:26,847 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:26,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:16:26,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:16:26,848 INFO L87 Difference]: Start difference. First operand 319 states and 419 transitions. Second operand 4 states. [2019-11-06 22:16:26,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:26,891 INFO L93 Difference]: Finished difference Result 490 states and 667 transitions. [2019-11-06 22:16:26,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:16:26,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-11-06 22:16:26,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:26,894 INFO L225 Difference]: With dead ends: 490 [2019-11-06 22:16:26,895 INFO L226 Difference]: Without dead ends: 325 [2019-11-06 22:16:26,896 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:16:26,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-11-06 22:16:26,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2019-11-06 22:16:26,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-11-06 22:16:26,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 422 transitions. [2019-11-06 22:16:26,921 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 422 transitions. Word has length 190 [2019-11-06 22:16:26,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:26,922 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 422 transitions. [2019-11-06 22:16:26,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:16:26,922 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 422 transitions. [2019-11-06 22:16:26,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-11-06 22:16:26,924 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:26,925 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:16:27,136 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:16:27,137 INFO L410 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:27,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:27,137 INFO L82 PathProgramCache]: Analyzing trace with hash 246207847, now seen corresponding path program 1 times [2019-11-06 22:16:27,138 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:27,138 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675771562] [2019-11-06 22:16:27,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,431 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 140 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2019-11-06 22:16:27,432 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675771562] [2019-11-06 22:16:27,432 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205457817] [2019-11-06 22:16:27,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:16:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-06 22:16:27,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:16:27,654 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2019-11-06 22:16:27,655 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:16:27,655 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 7 [2019-11-06 22:16:27,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906667558] [2019-11-06 22:16:27,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 22:16:27,656 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:27,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 22:16:27,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:16:27,659 INFO L87 Difference]: Start difference. First operand 323 states and 422 transitions. Second operand 7 states. [2019-11-06 22:16:29,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:29,356 INFO L93 Difference]: Finished difference Result 565 states and 760 transitions. [2019-11-06 22:16:29,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 22:16:29,357 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 202 [2019-11-06 22:16:29,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:29,359 INFO L225 Difference]: With dead ends: 565 [2019-11-06 22:16:29,360 INFO L226 Difference]: Without dead ends: 328 [2019-11-06 22:16:29,361 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:16:29,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-11-06 22:16:29,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 302. [2019-11-06 22:16:29,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-11-06 22:16:29,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 391 transitions. [2019-11-06 22:16:29,399 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 391 transitions. Word has length 202 [2019-11-06 22:16:29,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:29,400 INFO L462 AbstractCegarLoop]: Abstraction has 302 states and 391 transitions. [2019-11-06 22:16:29,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 22:16:29,400 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 391 transitions. [2019-11-06 22:16:29,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-06 22:16:29,405 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:29,406 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 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, 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] [2019-11-06 22:16:29,620 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:16:29,620 INFO L410 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:29,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:29,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1448564390, now seen corresponding path program 1 times [2019-11-06 22:16:29,621 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:29,622 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852203999] [2019-11-06 22:16:29,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:29,823 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-06 22:16:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:29,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:30,109 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-11-06 22:16:30,110 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852203999] [2019-11-06 22:16:30,110 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318140225] [2019-11-06 22:16:30,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:16:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:30,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-06 22:16:30,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:16:30,453 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-11-06 22:16:30,453 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:16:30,454 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 7 [2019-11-06 22:16:30,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855539897] [2019-11-06 22:16:30,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:16:30,455 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:30,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:16:30,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:16:30,456 INFO L87 Difference]: Start difference. First operand 302 states and 391 transitions. Second operand 4 states. [2019-11-06 22:16:30,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:30,528 INFO L93 Difference]: Finished difference Result 478 states and 643 transitions. [2019-11-06 22:16:30,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:16:30,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 226 [2019-11-06 22:16:30,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:30,533 INFO L225 Difference]: With dead ends: 478 [2019-11-06 22:16:30,533 INFO L226 Difference]: Without dead ends: 309 [2019-11-06 22:16:30,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:16:30,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-11-06 22:16:30,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2019-11-06 22:16:30,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-11-06 22:16:30,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 395 transitions. [2019-11-06 22:16:30,573 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 395 transitions. Word has length 226 [2019-11-06 22:16:30,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:30,574 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 395 transitions. [2019-11-06 22:16:30,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:16:30,574 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 395 transitions. [2019-11-06 22:16:30,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-06 22:16:30,579 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:30,580 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 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, 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, 1, 1, 1, 1, 1] [2019-11-06 22:16:30,787 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:16:30,788 INFO L410 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:30,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:30,788 INFO L82 PathProgramCache]: Analyzing trace with hash -2103066666, now seen corresponding path program 1 times [2019-11-06 22:16:30,789 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:30,789 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505549500] [2019-11-06 22:16:30,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:30,999 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-06 22:16:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,336 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2019-11-06 22:16:31,338 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505549500] [2019-11-06 22:16:31,338 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435942227] [2019-11-06 22:16:31,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:16:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 1134 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-06 22:16:31,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:16:31,733 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2019-11-06 22:16:31,734 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:16:31,734 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 8 [2019-11-06 22:16:31,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187718019] [2019-11-06 22:16:31,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:16:31,737 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:31,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:16:31,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:16:31,738 INFO L87 Difference]: Start difference. First operand 307 states and 395 transitions. Second operand 4 states. [2019-11-06 22:16:31,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:31,795 INFO L93 Difference]: Finished difference Result 480 states and 641 transitions. [2019-11-06 22:16:31,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:16:31,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 239 [2019-11-06 22:16:31,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:31,802 INFO L225 Difference]: With dead ends: 480 [2019-11-06 22:16:31,803 INFO L226 Difference]: Without dead ends: 306 [2019-11-06 22:16:31,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:16:31,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-11-06 22:16:31,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2019-11-06 22:16:31,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-11-06 22:16:31,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 390 transitions. [2019-11-06 22:16:31,840 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 390 transitions. Word has length 239 [2019-11-06 22:16:31,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:31,841 INFO L462 AbstractCegarLoop]: Abstraction has 306 states and 390 transitions. [2019-11-06 22:16:31,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:16:31,842 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 390 transitions. [2019-11-06 22:16:31,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-06 22:16:31,849 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:31,850 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 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, 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]