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/product-lines/elevator_spec3_product25.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:31:29,437 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:31:29,439 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:31:29,452 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:31:29,452 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:31:29,454 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:31:29,455 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:31:29,457 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:31:29,459 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:31:29,460 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:31:29,461 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:31:29,462 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:31:29,462 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:31:29,464 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:31:29,465 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:31:29,466 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:31:29,467 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:31:29,468 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:31:29,470 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:31:29,476 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:31:29,478 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:31:29,481 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:31:29,485 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:31:29,486 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:31:29,491 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:31:29,491 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:31:29,491 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:31:29,493 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:31:29,494 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:31:29,495 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:31:29,498 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:31:29,499 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:31:29,499 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:31:29,501 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:31:29,505 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:31:29,505 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:31:29,506 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:31:29,506 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:31:29,507 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:31:29,508 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:31:29,511 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:31:29,513 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-10-02 12:31:29,542 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:31:29,542 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:31:29,543 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:31:29,544 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:31:29,544 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:31:29,544 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:31:29,544 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:31:29,545 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:31:29,545 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:31:29,545 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:31:29,545 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:31:29,545 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:31:29,546 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:31:29,546 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:31:29,546 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:31:29,546 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:31:29,546 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:31:29,547 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:31:29,547 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:31:29,547 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:31:29,547 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:31:29,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:31:29,548 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:31:29,548 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:31:29,548 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:31:29,548 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:31:29,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:31:29,549 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:31:29,549 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:31:29,577 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:31:29,595 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:31:29,600 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:31:29,602 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:31:29,603 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:31:29,603 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec3_product25.cil.c [2019-10-02 12:31:29,685 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/048ac60c7/a73b913a9da4442abe61f161d9935442/FLAG7e2d827f3 [2019-10-02 12:31:30,374 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:31:30,375 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product25.cil.c [2019-10-02 12:31:30,400 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/048ac60c7/a73b913a9da4442abe61f161d9935442/FLAG7e2d827f3 [2019-10-02 12:31:30,558 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/048ac60c7/a73b913a9da4442abe61f161d9935442 [2019-10-02 12:31:30,569 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:31:30,570 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:31:30,571 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:31:30,571 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:31:30,574 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:31:30,575 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:31:30" (1/1) ... [2019-10-02 12:31:30,577 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5baf383 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:31:30, skipping insertion in model container [2019-10-02 12:31:30,577 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:31:30" (1/1) ... [2019-10-02 12:31:30,584 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:31:30,670 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:31:31,401 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:31:31,422 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:31:31,614 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:31:31,736 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:31:31,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:31:31 WrapperNode [2019-10-02 12:31:31,738 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:31:31,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:31:31,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:31:31,739 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:31:31,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:31:31" (1/1) ... [2019-10-02 12:31:31,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:31:31" (1/1) ... [2019-10-02 12:31:31,832 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:31:31" (1/1) ... [2019-10-02 12:31:31,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:31:31" (1/1) ... [2019-10-02 12:31:31,909 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:31:31" (1/1) ... [2019-10-02 12:31:31,950 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:31:31" (1/1) ... [2019-10-02 12:31:31,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:31:31" (1/1) ... [2019-10-02 12:31:31,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:31:31,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:31:31,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:31:31,988 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:31:31,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:31:31" (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-10-02 12:31:32,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:31:32,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:31:32,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:31:32,046 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:31:32,047 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:31:32,048 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:31:32,048 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:31:32,048 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:31:32,048 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:31:32,048 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:31:32,048 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:31:32,049 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:31:32,049 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:31:32,049 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:31:32,050 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:31:32,051 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:31:32,053 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:31:32,053 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:31:32,054 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:31:32,054 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:31:32,055 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:31:32,055 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:31:32,056 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:31:32,056 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:31:32,056 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:31:32,056 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:31:32,057 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:31:32,057 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:31:32,057 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:31:32,057 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:31:32,057 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:31:32,057 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:31:32,058 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:31:32,058 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:31:32,058 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:31:32,058 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:31:32,058 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:31:32,058 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:31:32,059 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:31:32,059 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:31:32,059 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:31:32,059 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:31:32,059 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:31:32,060 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:31:32,060 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:31:32,060 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 12:31:32,060 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:31:32,060 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:31:32,060 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-02 12:31:32,061 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:31:32,061 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:31:32,061 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:31:32,061 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:31:32,061 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:31:32,061 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:31:32,062 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:31:32,062 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:31:32,062 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:31:32,062 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:31:32,063 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:31:32,063 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:31:32,063 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:31:32,063 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:31:32,063 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:31:32,064 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:31:32,064 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:31:32,064 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:31:32,064 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:31:32,065 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__1 [2019-10-02 12:31:32,065 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__2 [2019-10-02 12:31:32,065 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:31:32,065 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:31:32,065 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:31:32,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:31:32,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:31:32,067 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:31:32,067 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:31:32,067 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:31:32,067 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:31:32,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:31:32,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:31:32,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:31:32,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:31:32,069 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:31:32,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:31:32,069 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:31:32,069 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:31:32,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:31:32,070 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:31:32,071 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:31:32,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:31:32,072 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:31:32,072 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:31:32,072 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:31:32,072 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:31:32,072 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:31:32,072 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:31:32,073 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:31:32,073 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:31:32,073 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:31:32,073 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:31:32,073 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:31:32,073 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:31:32,074 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:31:32,074 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:31:32,074 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:31:32,074 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:31:32,074 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:31:32,074 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:31:32,075 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:31:32,075 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:31:32,075 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:31:32,075 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:31:32,075 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:31:32,075 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:31:32,076 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:31:32,076 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:31:32,076 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:31:32,077 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:31:32,077 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:31:32,077 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:31:32,077 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:31:32,078 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:31:32,078 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:31:32,079 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:31:32,079 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:31:32,080 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:31:32,080 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:31:32,080 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:31:32,080 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:31:32,080 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:31:32,081 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:31:32,081 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:31:32,081 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:31:32,081 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:31:32,082 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:31:32,082 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:31:32,082 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:31:32,082 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:31:32,083 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:31:32,086 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:31:32,087 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:31:32,087 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 12:31:32,088 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:31:32,095 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-02 12:31:32,095 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:31:32,096 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:31:32,096 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:31:32,096 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:31:32,096 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:31:32,097 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:31:32,097 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:31:32,097 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:31:32,097 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:31:32,097 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:31:32,098 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__1 [2019-10-02 12:31:32,098 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__2 [2019-10-02 12:31:32,098 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:31:32,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:31:32,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:31:32,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:31:34,553 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:31:34,554 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:31:34,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:31:34 BoogieIcfgContainer [2019-10-02 12:31:34,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:31:34,558 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:31:34,558 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:31:34,561 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:31:34,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:31:30" (1/3) ... [2019-10-02 12:31:34,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da4c993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:31:34, skipping insertion in model container [2019-10-02 12:31:34,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:31:31" (2/3) ... [2019-10-02 12:31:34,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da4c993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:31:34, skipping insertion in model container [2019-10-02 12:31:34,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:31:34" (3/3) ... [2019-10-02 12:31:34,565 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product25.cil.c [2019-10-02 12:31:34,576 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:31:34,588 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:31:34,606 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:31:34,647 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:31:34,648 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:31:34,648 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:31:34,649 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:31:34,649 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:31:34,649 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:31:34,649 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:31:34,649 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:31:34,649 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:31:34,686 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states. [2019-10-02 12:31:34,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-02 12:31:34,713 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:34,715 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:31:34,717 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:34,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:34,724 INFO L82 PathProgramCache]: Analyzing trace with hash 9789385, now seen corresponding path program 1 times [2019-10-02 12:31:34,725 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:34,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:34,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:34,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:34,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:35,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:31:35,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:31:35,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:31:35,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:31:35,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:31:35,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:31:35,436 INFO L87 Difference]: Start difference. First operand 778 states. Second operand 7 states. [2019-10-02 12:31:35,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:31:35,781 INFO L93 Difference]: Finished difference Result 1235 states and 2008 transitions. [2019-10-02 12:31:35,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:31:35,783 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2019-10-02 12:31:35,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:31:35,808 INFO L225 Difference]: With dead ends: 1235 [2019-10-02 12:31:35,808 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 12:31:35,822 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:31:35,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 12:31:35,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 624. [2019-10-02 12:31:35,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-10-02 12:31:35,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 999 transitions. [2019-10-02 12:31:35,975 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 999 transitions. Word has length 115 [2019-10-02 12:31:35,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:35,976 INFO L475 AbstractCegarLoop]: Abstraction has 624 states and 999 transitions. [2019-10-02 12:31:35,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:31:35,976 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 999 transitions. [2019-10-02 12:31:35,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-02 12:31:35,986 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:35,986 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:31:35,986 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:35,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:35,987 INFO L82 PathProgramCache]: Analyzing trace with hash -803565182, now seen corresponding path program 1 times [2019-10-02 12:31:35,987 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:35,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:35,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:35,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:35,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:36,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:31:36,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:31:36,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:31:36,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:31:36,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:31:36,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:31:36,207 INFO L87 Difference]: Start difference. First operand 624 states and 999 transitions. Second operand 4 states. [2019-10-02 12:31:36,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:31:36,319 INFO L93 Difference]: Finished difference Result 1214 states and 1963 transitions. [2019-10-02 12:31:36,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:31:36,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-10-02 12:31:36,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:31:36,326 INFO L225 Difference]: With dead ends: 1214 [2019-10-02 12:31:36,326 INFO L226 Difference]: Without dead ends: 606 [2019-10-02 12:31:36,330 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:31:36,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-10-02 12:31:36,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2019-10-02 12:31:36,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-10-02 12:31:36,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 966 transitions. [2019-10-02 12:31:36,367 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 966 transitions. Word has length 116 [2019-10-02 12:31:36,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:36,367 INFO L475 AbstractCegarLoop]: Abstraction has 606 states and 966 transitions. [2019-10-02 12:31:36,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:31:36,368 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 966 transitions. [2019-10-02 12:31:36,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-02 12:31:36,373 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:36,373 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:31:36,374 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:36,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:36,374 INFO L82 PathProgramCache]: Analyzing trace with hash -433705100, now seen corresponding path program 1 times [2019-10-02 12:31:36,374 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:36,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:36,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:36,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:36,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:36,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:31:36,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:31:36,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:31:36,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:31:36,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:31:36,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:31:36,625 INFO L87 Difference]: Start difference. First operand 606 states and 966 transitions. Second operand 7 states. [2019-10-02 12:31:36,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:31:36,746 INFO L93 Difference]: Finished difference Result 1183 states and 1905 transitions. [2019-10-02 12:31:36,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:31:36,747 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 116 [2019-10-02 12:31:36,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:31:36,753 INFO L225 Difference]: With dead ends: 1183 [2019-10-02 12:31:36,754 INFO L226 Difference]: Without dead ends: 600 [2019-10-02 12:31:36,757 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:31:36,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-02 12:31:36,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-02 12:31:36,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-02 12:31:36,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 953 transitions. [2019-10-02 12:31:36,790 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 953 transitions. Word has length 116 [2019-10-02 12:31:36,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:36,791 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 953 transitions. [2019-10-02 12:31:36,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:31:36,791 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 953 transitions. [2019-10-02 12:31:36,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-02 12:31:36,795 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:36,795 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:31:36,796 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:36,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:36,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1336159923, now seen corresponding path program 1 times [2019-10-02 12:31:36,796 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:36,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:36,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:36,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:36,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:37,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:31:37,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:31:37,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:31:37,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:31:37,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:31:37,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:31:37,014 INFO L87 Difference]: Start difference. First operand 600 states and 953 transitions. Second operand 7 states. [2019-10-02 12:31:37,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:31:37,156 INFO L93 Difference]: Finished difference Result 1171 states and 1879 transitions. [2019-10-02 12:31:37,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:31:37,157 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-10-02 12:31:37,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:31:37,165 INFO L225 Difference]: With dead ends: 1171 [2019-10-02 12:31:37,166 INFO L226 Difference]: Without dead ends: 594 [2019-10-02 12:31:37,174 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:31:37,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-10-02 12:31:37,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2019-10-02 12:31:37,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-10-02 12:31:37,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 940 transitions. [2019-10-02 12:31:37,221 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 940 transitions. Word has length 117 [2019-10-02 12:31:37,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:37,222 INFO L475 AbstractCegarLoop]: Abstraction has 594 states and 940 transitions. [2019-10-02 12:31:37,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:31:37,222 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 940 transitions. [2019-10-02 12:31:37,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-02 12:31:37,229 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:37,230 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:31:37,230 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:37,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:37,231 INFO L82 PathProgramCache]: Analyzing trace with hash 713483960, now seen corresponding path program 1 times [2019-10-02 12:31:37,231 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:37,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:37,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:37,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:37,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:37,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:37,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:31:37,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:31:37,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:31:37,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:31:37,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:31:37,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:31:37,500 INFO L87 Difference]: Start difference. First operand 594 states and 940 transitions. Second operand 7 states. [2019-10-02 12:31:37,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:31:37,599 INFO L93 Difference]: Finished difference Result 1159 states and 1853 transitions. [2019-10-02 12:31:37,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:31:37,600 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-10-02 12:31:37,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:31:37,606 INFO L225 Difference]: With dead ends: 1159 [2019-10-02 12:31:37,606 INFO L226 Difference]: Without dead ends: 588 [2019-10-02 12:31:37,612 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:31:37,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-10-02 12:31:37,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2019-10-02 12:31:37,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-10-02 12:31:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 927 transitions. [2019-10-02 12:31:37,647 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 927 transitions. Word has length 118 [2019-10-02 12:31:37,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:37,647 INFO L475 AbstractCegarLoop]: Abstraction has 588 states and 927 transitions. [2019-10-02 12:31:37,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:31:37,648 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 927 transitions. [2019-10-02 12:31:37,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-02 12:31:37,652 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:37,653 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:31:37,653 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:37,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:37,653 INFO L82 PathProgramCache]: Analyzing trace with hash -467103239, now seen corresponding path program 1 times [2019-10-02 12:31:37,654 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:37,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:37,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:37,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:37,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:37,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:31:37,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:31:37,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:31:37,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:31:37,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:31:37,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:31:37,884 INFO L87 Difference]: Start difference. First operand 588 states and 927 transitions. Second operand 7 states. [2019-10-02 12:31:37,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:31:37,966 INFO L93 Difference]: Finished difference Result 1147 states and 1827 transitions. [2019-10-02 12:31:37,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:31:37,966 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-10-02 12:31:37,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:31:37,981 INFO L225 Difference]: With dead ends: 1147 [2019-10-02 12:31:37,981 INFO L226 Difference]: Without dead ends: 588 [2019-10-02 12:31:37,985 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:31:37,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-10-02 12:31:38,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2019-10-02 12:31:38,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-10-02 12:31:38,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 926 transitions. [2019-10-02 12:31:38,009 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 926 transitions. Word has length 118 [2019-10-02 12:31:38,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:38,010 INFO L475 AbstractCegarLoop]: Abstraction has 588 states and 926 transitions. [2019-10-02 12:31:38,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:31:38,010 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 926 transitions. [2019-10-02 12:31:38,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-02 12:31:38,013 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:38,013 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:31:38,014 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:38,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:38,014 INFO L82 PathProgramCache]: Analyzing trace with hash -211092783, now seen corresponding path program 1 times [2019-10-02 12:31:38,014 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:38,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:38,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:38,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:38,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:38,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:31:38,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:31:38,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:31:38,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:31:38,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:31:38,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:31:38,161 INFO L87 Difference]: Start difference. First operand 588 states and 926 transitions. Second operand 5 states. [2019-10-02 12:31:38,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:31:38,241 INFO L93 Difference]: Finished difference Result 1146 states and 1824 transitions. [2019-10-02 12:31:38,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:31:38,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2019-10-02 12:31:38,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:31:38,247 INFO L225 Difference]: With dead ends: 1146 [2019-10-02 12:31:38,247 INFO L226 Difference]: Without dead ends: 588 [2019-10-02 12:31:38,250 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:31:38,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-10-02 12:31:38,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2019-10-02 12:31:38,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-10-02 12:31:38,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 925 transitions. [2019-10-02 12:31:38,276 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 925 transitions. Word has length 119 [2019-10-02 12:31:38,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:38,277 INFO L475 AbstractCegarLoop]: Abstraction has 588 states and 925 transitions. [2019-10-02 12:31:38,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:31:38,277 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 925 transitions. [2019-10-02 12:31:38,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-02 12:31:38,281 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:38,281 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:31:38,281 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:38,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:38,282 INFO L82 PathProgramCache]: Analyzing trace with hash 644803690, now seen corresponding path program 1 times [2019-10-02 12:31:38,282 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:38,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:38,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:38,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:38,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:38,441 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:31:38,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:31:38,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:31:38,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:31:38,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:31:38,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:31:38,443 INFO L87 Difference]: Start difference. First operand 588 states and 925 transitions. Second operand 5 states. [2019-10-02 12:31:38,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:31:38,522 INFO L93 Difference]: Finished difference Result 1146 states and 1822 transitions. [2019-10-02 12:31:38,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:31:38,523 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-10-02 12:31:38,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:31:38,530 INFO L225 Difference]: With dead ends: 1146 [2019-10-02 12:31:38,530 INFO L226 Difference]: Without dead ends: 588 [2019-10-02 12:31:38,534 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:31:38,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-10-02 12:31:38,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2019-10-02 12:31:38,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-10-02 12:31:38,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 924 transitions. [2019-10-02 12:31:38,561 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 924 transitions. Word has length 120 [2019-10-02 12:31:38,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:38,562 INFO L475 AbstractCegarLoop]: Abstraction has 588 states and 924 transitions. [2019-10-02 12:31:38,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:31:38,562 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 924 transitions. [2019-10-02 12:31:38,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-02 12:31:38,566 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:38,567 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:31:38,567 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:38,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:38,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1883967756, now seen corresponding path program 1 times [2019-10-02 12:31:38,568 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:38,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:38,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:38,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:38,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:38,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:31:38,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:31:38,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:31:38,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:31:38,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:31:38,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:31:38,755 INFO L87 Difference]: Start difference. First operand 588 states and 924 transitions. Second operand 5 states. [2019-10-02 12:31:38,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:31:38,820 INFO L93 Difference]: Finished difference Result 1146 states and 1820 transitions. [2019-10-02 12:31:38,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:31:38,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-10-02 12:31:38,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:31:38,826 INFO L225 Difference]: With dead ends: 1146 [2019-10-02 12:31:38,826 INFO L226 Difference]: Without dead ends: 588 [2019-10-02 12:31:38,830 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:31:38,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-10-02 12:31:38,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2019-10-02 12:31:38,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-10-02 12:31:38,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 923 transitions. [2019-10-02 12:31:38,853 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 923 transitions. Word has length 121 [2019-10-02 12:31:38,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:38,853 INFO L475 AbstractCegarLoop]: Abstraction has 588 states and 923 transitions. [2019-10-02 12:31:38,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:31:38,854 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 923 transitions. [2019-10-02 12:31:38,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-02 12:31:38,857 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:38,857 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:31:38,858 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:38,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:38,858 INFO L82 PathProgramCache]: Analyzing trace with hash 2119525317, now seen corresponding path program 1 times [2019-10-02 12:31:38,858 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:38,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:38,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:38,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:38,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:38,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:31:38,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:31:38,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:31:38,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:31:38,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:31:38,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:31:38,991 INFO L87 Difference]: Start difference. First operand 588 states and 923 transitions. Second operand 5 states. [2019-10-02 12:31:39,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:31:39,060 INFO L93 Difference]: Finished difference Result 1146 states and 1818 transitions. [2019-10-02 12:31:39,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:31:39,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2019-10-02 12:31:39,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:31:39,066 INFO L225 Difference]: With dead ends: 1146 [2019-10-02 12:31:39,066 INFO L226 Difference]: Without dead ends: 588 [2019-10-02 12:31:39,070 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:31:39,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-10-02 12:31:39,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2019-10-02 12:31:39,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-10-02 12:31:39,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 922 transitions. [2019-10-02 12:31:39,094 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 922 transitions. Word has length 122 [2019-10-02 12:31:39,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:39,095 INFO L475 AbstractCegarLoop]: Abstraction has 588 states and 922 transitions. [2019-10-02 12:31:39,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:31:39,095 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 922 transitions. [2019-10-02 12:31:39,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-02 12:31:39,097 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:39,098 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:31:39,098 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:39,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:39,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1308052295, now seen corresponding path program 1 times [2019-10-02 12:31:39,099 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:39,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:39,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:39,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:39,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:39,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:31:39,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:31:39,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:31:39,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:31:39,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:31:39,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:31:39,303 INFO L87 Difference]: Start difference. First operand 588 states and 922 transitions. Second operand 8 states. [2019-10-02 12:31:42,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:31:42,259 INFO L93 Difference]: Finished difference Result 2139 states and 3411 transitions. [2019-10-02 12:31:42,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:31:42,260 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 123 [2019-10-02 12:31:42,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:31:42,275 INFO L225 Difference]: With dead ends: 2139 [2019-10-02 12:31:42,276 INFO L226 Difference]: Without dead ends: 1585 [2019-10-02 12:31:42,281 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:31:42,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2019-10-02 12:31:42,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1573. [2019-10-02 12:31:42,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2019-10-02 12:31:42,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2469 transitions. [2019-10-02 12:31:42,358 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2469 transitions. Word has length 123 [2019-10-02 12:31:42,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:42,358 INFO L475 AbstractCegarLoop]: Abstraction has 1573 states and 2469 transitions. [2019-10-02 12:31:42,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:31:42,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2469 transitions. [2019-10-02 12:31:42,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-02 12:31:42,362 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:42,362 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:31:42,362 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:42,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:42,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1202656165, now seen corresponding path program 1 times [2019-10-02 12:31:42,363 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:42,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:42,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:42,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:42,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:42,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:42,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 12:31:42,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:31:42,605 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:31:42,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:43,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 3002 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 12:31:43,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:31:43,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:31:43,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:31:43,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-10-02 12:31:43,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:31:43,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:31:43,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:31:43,256 INFO L87 Difference]: Start difference. First operand 1573 states and 2469 transitions. Second operand 12 states. [2019-10-02 12:31:49,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:31:49,372 INFO L93 Difference]: Finished difference Result 7687 states and 12611 transitions. [2019-10-02 12:31:49,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 12:31:49,372 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 128 [2019-10-02 12:31:49,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:31:49,425 INFO L225 Difference]: With dead ends: 7687 [2019-10-02 12:31:49,425 INFO L226 Difference]: Without dead ends: 6148 [2019-10-02 12:31:49,445 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=844, Unknown=0, NotChecked=0, Total=992 [2019-10-02 12:31:49,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6148 states. [2019-10-02 12:31:49,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6148 to 3962. [2019-10-02 12:31:49,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3962 states. [2019-10-02 12:31:49,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3962 states to 3962 states and 6300 transitions. [2019-10-02 12:31:49,835 INFO L78 Accepts]: Start accepts. Automaton has 3962 states and 6300 transitions. Word has length 128 [2019-10-02 12:31:49,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:49,836 INFO L475 AbstractCegarLoop]: Abstraction has 3962 states and 6300 transitions. [2019-10-02 12:31:49,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:31:49,836 INFO L276 IsEmpty]: Start isEmpty. Operand 3962 states and 6300 transitions. [2019-10-02 12:31:49,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-02 12:31:49,839 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:49,840 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:31:49,840 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:49,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:49,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1118227935, now seen corresponding path program 1 times [2019-10-02 12:31:49,841 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:49,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:49,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:49,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:49,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:50,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:31:50,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:31:50,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:31:50,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:31:50,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:31:50,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:31:50,057 INFO L87 Difference]: Start difference. First operand 3962 states and 6300 transitions. Second operand 7 states. [2019-10-02 12:31:53,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:31:53,291 INFO L93 Difference]: Finished difference Result 11728 states and 19070 transitions. [2019-10-02 12:31:53,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:31:53,292 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 131 [2019-10-02 12:31:53,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:31:53,354 INFO L225 Difference]: With dead ends: 11728 [2019-10-02 12:31:53,354 INFO L226 Difference]: Without dead ends: 7800 [2019-10-02 12:31:53,382 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:31:53,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7800 states. [2019-10-02 12:31:53,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7800 to 7712. [2019-10-02 12:31:53,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7712 states. [2019-10-02 12:31:53,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7712 states to 7712 states and 12402 transitions. [2019-10-02 12:31:53,744 INFO L78 Accepts]: Start accepts. Automaton has 7712 states and 12402 transitions. Word has length 131 [2019-10-02 12:31:53,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:53,745 INFO L475 AbstractCegarLoop]: Abstraction has 7712 states and 12402 transitions. [2019-10-02 12:31:53,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:31:53,745 INFO L276 IsEmpty]: Start isEmpty. Operand 7712 states and 12402 transitions. [2019-10-02 12:31:53,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-02 12:31:53,749 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:53,749 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:31:53,749 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:53,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:53,750 INFO L82 PathProgramCache]: Analyzing trace with hash -580532883, now seen corresponding path program 1 times [2019-10-02 12:31:53,750 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:53,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:53,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:53,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:53,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:53,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:31:53,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:31:53,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:31:53,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:31:53,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:31:53,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:31:53,879 INFO L87 Difference]: Start difference. First operand 7712 states and 12402 transitions. Second operand 4 states. [2019-10-02 12:31:54,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:31:54,290 INFO L93 Difference]: Finished difference Result 15065 states and 24490 transitions. [2019-10-02 12:31:54,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:31:54,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-10-02 12:31:54,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:31:54,387 INFO L225 Difference]: With dead ends: 15065 [2019-10-02 12:31:54,388 INFO L226 Difference]: Without dead ends: 7375 [2019-10-02 12:31:54,440 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:31:54,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7375 states. [2019-10-02 12:31:54,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7375 to 7353. [2019-10-02 12:31:54,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7353 states. [2019-10-02 12:31:54,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7353 states to 7353 states and 11794 transitions. [2019-10-02 12:31:54,859 INFO L78 Accepts]: Start accepts. Automaton has 7353 states and 11794 transitions. Word has length 132 [2019-10-02 12:31:54,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:54,859 INFO L475 AbstractCegarLoop]: Abstraction has 7353 states and 11794 transitions. [2019-10-02 12:31:54,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:31:54,860 INFO L276 IsEmpty]: Start isEmpty. Operand 7353 states and 11794 transitions. [2019-10-02 12:31:54,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 12:31:54,864 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:54,864 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:31:54,864 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:54,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:54,865 INFO L82 PathProgramCache]: Analyzing trace with hash 568064234, now seen corresponding path program 1 times [2019-10-02 12:31:54,865 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:54,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:54,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:54,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:54,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:55,682 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-02 12:31:55,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:31:55,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:31:55,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:31:55,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:31:55,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:31:55,684 INFO L87 Difference]: Start difference. First operand 7353 states and 11794 transitions. Second operand 7 states. [2019-10-02 12:31:58,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:31:58,643 INFO L93 Difference]: Finished difference Result 21983 states and 36155 transitions. [2019-10-02 12:31:58,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:31:58,644 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 140 [2019-10-02 12:31:58,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:31:58,749 INFO L225 Difference]: With dead ends: 21983 [2019-10-02 12:31:58,749 INFO L226 Difference]: Without dead ends: 14664 [2019-10-02 12:31:58,851 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:31:58,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14664 states. [2019-10-02 12:31:59,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14664 to 14540. [2019-10-02 12:31:59,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14540 states. [2019-10-02 12:31:59,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14540 states to 14540 states and 23692 transitions. [2019-10-02 12:31:59,476 INFO L78 Accepts]: Start accepts. Automaton has 14540 states and 23692 transitions. Word has length 140 [2019-10-02 12:31:59,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:59,477 INFO L475 AbstractCegarLoop]: Abstraction has 14540 states and 23692 transitions. [2019-10-02 12:31:59,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:31:59,477 INFO L276 IsEmpty]: Start isEmpty. Operand 14540 states and 23692 transitions. [2019-10-02 12:31:59,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 12:31:59,480 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:59,480 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:31:59,481 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:59,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:59,481 INFO L82 PathProgramCache]: Analyzing trace with hash 245962364, now seen corresponding path program 1 times [2019-10-02 12:31:59,481 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:59,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:59,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:59,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:59,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:59,604 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 12:31:59,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:31:59,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:31:59,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:31:59,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:31:59,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:31:59,608 INFO L87 Difference]: Start difference. First operand 14540 states and 23692 transitions. Second operand 4 states. [2019-10-02 12:32:00,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:32:00,275 INFO L93 Difference]: Finished difference Result 28771 states and 47448 transitions. [2019-10-02 12:32:00,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:32:00,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-10-02 12:32:00,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:32:00,383 INFO L225 Difference]: With dead ends: 28771 [2019-10-02 12:32:00,384 INFO L226 Difference]: Without dead ends: 14253 [2019-10-02 12:32:00,445 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:32:00,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14253 states. [2019-10-02 12:32:01,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14253 to 14213. [2019-10-02 12:32:01,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14213 states. [2019-10-02 12:32:01,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14213 states to 14213 states and 23111 transitions. [2019-10-02 12:32:01,149 INFO L78 Accepts]: Start accepts. Automaton has 14213 states and 23111 transitions. Word has length 141 [2019-10-02 12:32:01,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:32:01,149 INFO L475 AbstractCegarLoop]: Abstraction has 14213 states and 23111 transitions. [2019-10-02 12:32:01,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:32:01,149 INFO L276 IsEmpty]: Start isEmpty. Operand 14213 states and 23111 transitions. [2019-10-02 12:32:01,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-02 12:32:01,153 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:32:01,153 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:32:01,154 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:32:01,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:32:01,154 INFO L82 PathProgramCache]: Analyzing trace with hash 418409551, now seen corresponding path program 1 times [2019-10-02 12:32:01,154 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:32:01,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:32:01,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:01,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:32:01,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:32:01,307 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:32:01,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:32:01,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:32:01,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:32:01,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:32:01,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:32:01,309 INFO L87 Difference]: Start difference. First operand 14213 states and 23111 transitions. Second operand 7 states. [2019-10-02 12:32:04,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:32:04,730 INFO L93 Difference]: Finished difference Result 42679 states and 71684 transitions. [2019-10-02 12:32:04,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:32:04,730 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 150 [2019-10-02 12:32:04,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:32:04,945 INFO L225 Difference]: With dead ends: 42679 [2019-10-02 12:32:04,946 INFO L226 Difference]: Without dead ends: 28500 [2019-10-02 12:32:05,028 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:32:05,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28500 states. [2019-10-02 12:32:06,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28500 to 28316. [2019-10-02 12:32:06,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28316 states. [2019-10-02 12:32:07,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28316 states to 28316 states and 47222 transitions. [2019-10-02 12:32:07,135 INFO L78 Accepts]: Start accepts. Automaton has 28316 states and 47222 transitions. Word has length 150 [2019-10-02 12:32:07,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:32:07,136 INFO L475 AbstractCegarLoop]: Abstraction has 28316 states and 47222 transitions. [2019-10-02 12:32:07,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:32:07,136 INFO L276 IsEmpty]: Start isEmpty. Operand 28316 states and 47222 transitions. [2019-10-02 12:32:07,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-02 12:32:07,140 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:32:07,140 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:32:07,140 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:32:07,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:32:07,141 INFO L82 PathProgramCache]: Analyzing trace with hash -7319953, now seen corresponding path program 1 times [2019-10-02 12:32:07,141 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:32:07,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:32:07,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:07,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:32:07,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:32:07,261 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 12:32:07,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:32:07,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:32:07,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:32:07,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:32:07,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:32:07,263 INFO L87 Difference]: Start difference. First operand 28316 states and 47222 transitions. Second operand 4 states. [2019-10-02 12:32:08,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:32:08,012 INFO L93 Difference]: Finished difference Result 56373 states and 95543 transitions. [2019-10-02 12:32:08,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:32:08,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-10-02 12:32:08,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:32:08,210 INFO L225 Difference]: With dead ends: 56373 [2019-10-02 12:32:08,210 INFO L226 Difference]: Without dead ends: 28079 [2019-10-02 12:32:08,368 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:32:08,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28079 states. [2019-10-02 12:32:09,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28079 to 28003. [2019-10-02 12:32:09,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28003 states. [2019-10-02 12:32:09,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28003 states to 28003 states and 46624 transitions. [2019-10-02 12:32:09,658 INFO L78 Accepts]: Start accepts. Automaton has 28003 states and 46624 transitions. Word has length 151 [2019-10-02 12:32:09,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:32:09,658 INFO L475 AbstractCegarLoop]: Abstraction has 28003 states and 46624 transitions. [2019-10-02 12:32:09,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:32:09,659 INFO L276 IsEmpty]: Start isEmpty. Operand 28003 states and 46624 transitions. [2019-10-02 12:32:09,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 12:32:09,662 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:32:09,662 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:32:09,663 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:32:09,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:32:09,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1886003740, now seen corresponding path program 1 times [2019-10-02 12:32:09,663 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:32:09,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:32:09,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:09,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:32:09,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:32:09,898 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:32:09,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:32:09,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:32:09,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:32:09,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:32:09,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:32:09,902 INFO L87 Difference]: Start difference. First operand 28003 states and 46624 transitions. Second operand 7 states. [2019-10-02 12:32:13,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:32:13,746 INFO L93 Difference]: Finished difference Result 84221 states and 147117 transitions. [2019-10-02 12:32:13,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:32:13,747 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 161 [2019-10-02 12:32:13,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:32:14,096 INFO L225 Difference]: With dead ends: 84221 [2019-10-02 12:32:14,096 INFO L226 Difference]: Without dead ends: 56252 [2019-10-02 12:32:14,223 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:32:14,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56252 states. [2019-10-02 12:32:17,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56252 to 55968. [2019-10-02 12:32:17,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55968 states. [2019-10-02 12:32:17,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55968 states to 55968 states and 97390 transitions. [2019-10-02 12:32:17,672 INFO L78 Accepts]: Start accepts. Automaton has 55968 states and 97390 transitions. Word has length 161 [2019-10-02 12:32:17,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:32:17,673 INFO L475 AbstractCegarLoop]: Abstraction has 55968 states and 97390 transitions. [2019-10-02 12:32:17,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:32:17,673 INFO L276 IsEmpty]: Start isEmpty. Operand 55968 states and 97390 transitions. [2019-10-02 12:32:17,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-02 12:32:17,677 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:32:17,677 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:32:17,677 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:32:17,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:32:17,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1665494790, now seen corresponding path program 1 times [2019-10-02 12:32:17,678 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:32:17,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:32:17,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:17,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:32:17,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:32:18,170 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 12:32:18,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:32:18,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:32:18,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:32:18,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:32:18,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:32:18,171 INFO L87 Difference]: Start difference. First operand 55968 states and 97390 transitions. Second operand 4 states. [2019-10-02 12:32:19,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:32:19,850 INFO L93 Difference]: Finished difference Result 111526 states and 198863 transitions. [2019-10-02 12:32:19,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:32:19,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-10-02 12:32:19,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:32:20,173 INFO L225 Difference]: With dead ends: 111526 [2019-10-02 12:32:20,173 INFO L226 Difference]: Without dead ends: 55574 [2019-10-02 12:32:22,925 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:32:22,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55574 states. [2019-10-02 12:32:24,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55574 to 55430. [2019-10-02 12:32:24,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55430 states. [2019-10-02 12:32:24,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55430 states to 55430 states and 96240 transitions. [2019-10-02 12:32:24,434 INFO L78 Accepts]: Start accepts. Automaton has 55430 states and 96240 transitions. Word has length 162 [2019-10-02 12:32:24,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:32:24,435 INFO L475 AbstractCegarLoop]: Abstraction has 55430 states and 96240 transitions. [2019-10-02 12:32:24,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:32:24,435 INFO L276 IsEmpty]: Start isEmpty. Operand 55430 states and 96240 transitions. [2019-10-02 12:32:24,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-02 12:32:24,437 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:32:24,437 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:32:24,437 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:32:24,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:32:24,438 INFO L82 PathProgramCache]: Analyzing trace with hash 751071345, now seen corresponding path program 1 times [2019-10-02 12:32:24,438 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:32:24,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:32:24,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:24,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:32:24,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:32:24,677 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 12:32:24,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:32:24,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:32:24,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:32:24,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:32:24,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:32:24,679 INFO L87 Difference]: Start difference. First operand 55430 states and 96240 transitions. Second operand 12 states. [2019-10-02 12:32:31,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:32:31,903 INFO L93 Difference]: Finished difference Result 189162 states and 346712 transitions. [2019-10-02 12:32:31,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-02 12:32:31,904 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 163 [2019-10-02 12:32:31,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:32:32,705 INFO L225 Difference]: With dead ends: 189162 [2019-10-02 12:32:32,705 INFO L226 Difference]: Without dead ends: 133766 [2019-10-02 12:32:33,113 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=1240, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 12:32:33,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133766 states. [2019-10-02 12:32:40,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133766 to 133434. [2019-10-02 12:32:40,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133434 states. [2019-10-02 12:32:41,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133434 states to 133434 states and 233350 transitions. [2019-10-02 12:32:41,590 INFO L78 Accepts]: Start accepts. Automaton has 133434 states and 233350 transitions. Word has length 163 [2019-10-02 12:32:41,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:32:41,591 INFO L475 AbstractCegarLoop]: Abstraction has 133434 states and 233350 transitions. [2019-10-02 12:32:41,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:32:41,591 INFO L276 IsEmpty]: Start isEmpty. Operand 133434 states and 233350 transitions. [2019-10-02 12:32:41,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-02 12:32:41,594 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:32:41,594 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:32:41,595 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:32:41,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:32:41,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1850666730, now seen corresponding path program 1 times [2019-10-02 12:32:41,595 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:32:41,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:32:41,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:41,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:32:41,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:32:41,804 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 12:32:41,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:32:41,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:32:41,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:32:41,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:32:41,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:32:41,805 INFO L87 Difference]: Start difference. First operand 133434 states and 233350 transitions. Second operand 12 states. [2019-10-02 12:33:04,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:33:04,669 INFO L93 Difference]: Finished difference Result 437403 states and 791869 transitions. [2019-10-02 12:33:04,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-02 12:33:04,673 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 164 [2019-10-02 12:33:04,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:33:06,604 INFO L225 Difference]: With dead ends: 437403 [2019-10-02 12:33:06,604 INFO L226 Difference]: Without dead ends: 303971 [2019-10-02 12:33:07,695 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=1240, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 12:33:07,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303971 states. [2019-10-02 12:33:26,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303971 to 299167. [2019-10-02 12:33:26,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299167 states. [2019-10-02 12:33:31,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299167 states to 299167 states and 520477 transitions. [2019-10-02 12:33:31,291 INFO L78 Accepts]: Start accepts. Automaton has 299167 states and 520477 transitions. Word has length 164 [2019-10-02 12:33:31,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:33:31,292 INFO L475 AbstractCegarLoop]: Abstraction has 299167 states and 520477 transitions. [2019-10-02 12:33:31,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:33:31,292 INFO L276 IsEmpty]: Start isEmpty. Operand 299167 states and 520477 transitions. [2019-10-02 12:33:31,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-02 12:33:31,294 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:33:31,294 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:33:31,295 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:33:31,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:33:31,295 INFO L82 PathProgramCache]: Analyzing trace with hash -403875443, now seen corresponding path program 1 times [2019-10-02 12:33:31,295 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:33:31,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:33:31,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:33:31,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:33:31,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:33:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:33:31,486 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 12:33:31,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:33:31,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:33:31,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:33:31,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:33:31,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:33:31,488 INFO L87 Difference]: Start difference. First operand 299167 states and 520477 transitions. Second operand 12 states. [2019-10-02 12:34:08,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:34:08,641 INFO L93 Difference]: Finished difference Result 837296 states and 1499048 transitions. [2019-10-02 12:34:08,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-02 12:34:08,641 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 165 [2019-10-02 12:34:08,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:34:12,713 INFO L225 Difference]: With dead ends: 837296 [2019-10-02 12:34:12,713 INFO L226 Difference]: Without dead ends: 537419 [2019-10-02 12:34:28,732 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=1240, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 12:34:29,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537419 states. [2019-10-02 12:35:05,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537419 to 526659. [2019-10-02 12:35:05,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526659 states. [2019-10-02 12:35:25,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526659 states to 526659 states and 911097 transitions. [2019-10-02 12:35:25,921 INFO L78 Accepts]: Start accepts. Automaton has 526659 states and 911097 transitions. Word has length 165 [2019-10-02 12:35:25,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:25,922 INFO L475 AbstractCegarLoop]: Abstraction has 526659 states and 911097 transitions. [2019-10-02 12:35:25,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:35:25,922 INFO L276 IsEmpty]: Start isEmpty. Operand 526659 states and 911097 transitions. [2019-10-02 12:35:25,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 12:35:25,923 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:25,923 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:35:25,924 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:25,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:25,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1993274482, now seen corresponding path program 1 times [2019-10-02 12:35:25,924 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:25,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:25,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:25,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:25,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:26,110 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 12:35:26,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:35:26,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:35:26,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:35:26,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:35:26,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:35:26,111 INFO L87 Difference]: Start difference. First operand 526659 states and 911097 transitions. Second operand 12 states. [2019-10-02 12:37:12,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:12,869 INFO L93 Difference]: Finished difference Result 1563518 states and 2787671 transitions. [2019-10-02 12:37:12,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-02 12:37:12,870 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 166 [2019-10-02 12:37:12,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted.