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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec9_product26.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:35:00,259 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:35:00,261 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:35:00,277 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:35:00,277 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:35:00,279 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:35:00,281 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:35:00,295 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:35:00,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:35:00,300 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:35:00,302 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:35:00,304 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:35:00,304 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:35:00,308 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:35:00,311 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:35:00,313 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:35:00,314 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:35:00,317 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:35:00,320 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:35:00,326 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:35:00,329 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:35:00,331 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:35:00,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:35:00,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:35:00,337 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:35:00,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:35:00,338 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:35:00,340 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:35:00,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:35:00,343 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:35:00,343 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:35:00,345 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:35:00,345 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:35:00,346 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:35:00,351 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:35:00,351 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:35:00,352 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:35:00,353 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:35:00,353 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:35:00,354 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:35:00,354 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:35:00,356 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:35:00,382 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:35:00,383 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:35:00,384 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:35:00,384 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:35:00,385 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:35:00,385 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:35:00,385 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:35:00,385 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:35:00,386 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:35:00,386 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:35:00,388 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:35:00,388 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:35:00,389 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:35:00,389 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:35:00,389 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:35:00,390 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:35:00,390 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:35:00,390 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:35:00,390 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:35:00,390 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:35:00,391 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:35:00,391 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:35:00,391 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:35:00,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:35:00,392 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:35:00,392 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:35:00,392 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:35:00,392 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:35:00,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:35:00,393 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:35:00,447 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:35:00,468 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:35:00,474 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:35:00,476 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:35:00,476 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:35:00,478 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product26.cil.c [2019-09-10 02:35:00,550 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e7bf7acd/9cb9ba772eac483b8f80c4dbdca4c7e0/FLAG46223d79c [2019-09-10 02:35:01,221 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:35:01,222 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product26.cil.c [2019-09-10 02:35:01,257 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e7bf7acd/9cb9ba772eac483b8f80c4dbdca4c7e0/FLAG46223d79c [2019-09-10 02:35:01,373 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e7bf7acd/9cb9ba772eac483b8f80c4dbdca4c7e0 [2019-09-10 02:35:01,385 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:35:01,387 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:35:01,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:35:01,391 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:35:01,395 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:35:01,396 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:35:01" (1/1) ... [2019-09-10 02:35:01,399 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7011cb3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:35:01, skipping insertion in model container [2019-09-10 02:35:01,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:35:01" (1/1) ... [2019-09-10 02:35:01,408 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:35:01,500 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:35:02,215 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:35:02,237 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:35:02,441 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:35:02,515 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:35:02,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:35:02 WrapperNode [2019-09-10 02:35:02,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:35:02,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:35:02,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:35:02,516 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:35:02,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:35:02" (1/1) ... [2019-09-10 02:35:02,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:35:02" (1/1) ... [2019-09-10 02:35:02,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:35:02" (1/1) ... [2019-09-10 02:35:02,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:35:02" (1/1) ... [2019-09-10 02:35:02,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:35:02" (1/1) ... [2019-09-10 02:35:02,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:35:02" (1/1) ... [2019-09-10 02:35:02,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:35:02" (1/1) ... [2019-09-10 02:35:02,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:35:02,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:35:02,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:35:02,686 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:35:02,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:35:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:35:02,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:35:02,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:35:02,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:35:02,749 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:35:02,750 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:35:02,750 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:35:02,750 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:35:02,750 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:35:02,751 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:35:02,751 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:35:02,751 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-09-10 02:35:02,752 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-09-10 02:35:02,752 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-09-10 02:35:02,753 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-09-10 02:35:02,753 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-10 02:35:02,754 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-10 02:35:02,754 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-10 02:35:02,755 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-10 02:35:02,755 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-10 02:35:02,755 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-10 02:35:02,755 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-09-10 02:35:02,756 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-10 02:35:02,756 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-10 02:35:02,757 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-10 02:35:02,757 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-10 02:35:02,758 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-10 02:35:02,758 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-10 02:35:02,758 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-10 02:35:02,758 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-10 02:35:02,759 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-10 02:35:02,759 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-10 02:35:02,759 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-10 02:35:02,759 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-10 02:35:02,759 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-10 02:35:02,759 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-10 02:35:02,760 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-10 02:35:02,760 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-10 02:35:02,760 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__empty [2019-09-10 02:35:02,760 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-10 02:35:02,760 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__empty [2019-09-10 02:35:02,760 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-10 02:35:02,761 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-10 02:35:02,761 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:35:02,761 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-10 02:35:02,761 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-10 02:35:02,761 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-10 02:35:02,762 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-10 02:35:02,762 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-10 02:35:02,762 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-10 02:35:02,762 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-10 02:35:02,762 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-10 02:35:02,762 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-10 02:35:02,763 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-10 02:35:02,763 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-10 02:35:02,763 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-10 02:35:02,763 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-10 02:35:02,763 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-10 02:35:02,763 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-10 02:35:02,764 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-10 02:35:02,764 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-10 02:35:02,764 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-10 02:35:02,765 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-10 02:35:02,765 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-10 02:35:02,765 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-10 02:35:02,765 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-10 02:35:02,766 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:35:02,766 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-10 02:35:02,766 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:35:02,766 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-10 02:35:02,766 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-10 02:35:02,766 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:35:02,767 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:35:02,767 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:35:02,768 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:35:02,768 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-10 02:35:02,768 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-10 02:35:02,768 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-10 02:35:02,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:35:02,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:35:02,770 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:35:02,770 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:35:02,770 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:35:02,770 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:35:02,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:35:02,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:35:02,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:35:02,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:35:02,773 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:35:02,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:35:02,773 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:35:02,773 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:35:02,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:35:02,774 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:35:02,774 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:35:02,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:35:02,774 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:35:02,774 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-10 02:35:02,774 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-10 02:35:02,774 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:35:02,775 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:35:02,775 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-10 02:35:02,775 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-10 02:35:02,775 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-10 02:35:02,775 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-09-10 02:35:02,775 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-09-10 02:35:02,776 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-09-10 02:35:02,776 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-09-10 02:35:02,776 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:35:02,776 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-10 02:35:02,776 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-10 02:35:02,776 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-10 02:35:02,776 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-10 02:35:02,777 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-10 02:35:02,777 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-10 02:35:02,777 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-10 02:35:02,777 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-10 02:35:02,778 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-10 02:35:02,778 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-10 02:35:02,779 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-10 02:35:02,779 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-10 02:35:02,779 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-10 02:35:02,779 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-10 02:35:02,780 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-10 02:35:02,781 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-10 02:35:02,781 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-10 02:35:02,781 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-10 02:35:02,781 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-10 02:35:02,782 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-09-10 02:35:02,782 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-10 02:35:02,782 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-10 02:35:02,785 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-10 02:35:02,785 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-10 02:35:02,786 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-10 02:35:02,786 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-10 02:35:02,786 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-10 02:35:02,786 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-10 02:35:02,786 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-10 02:35:02,787 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-10 02:35:02,787 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__empty [2019-09-10 02:35:02,791 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__empty [2019-09-10 02:35:02,791 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-10 02:35:02,792 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-10 02:35:02,792 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-10 02:35:02,792 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-10 02:35:02,792 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-10 02:35:02,794 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-10 02:35:02,794 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-10 02:35:02,794 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-10 02:35:02,794 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-10 02:35:02,794 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-10 02:35:02,794 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-10 02:35:02,794 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-10 02:35:02,794 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-10 02:35:02,795 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-10 02:35:02,795 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-10 02:35:02,795 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-10 02:35:02,795 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-10 02:35:02,795 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:35:02,795 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-10 02:35:02,796 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:35:02,796 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:35:02,796 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:35:02,796 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:35:02,796 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-10 02:35:02,796 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-10 02:35:02,796 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:35:02,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:35:02,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:35:02,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:35:05,051 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:35:05,051 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-10 02:35:05,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:35:05 BoogieIcfgContainer [2019-09-10 02:35:05,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:35:05,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:35:05,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:35:05,058 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:35:05,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:35:01" (1/3) ... [2019-09-10 02:35:05,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c22b5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:35:05, skipping insertion in model container [2019-09-10 02:35:05,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:35:02" (2/3) ... [2019-09-10 02:35:05,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c22b5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:35:05, skipping insertion in model container [2019-09-10 02:35:05,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:35:05" (3/3) ... [2019-09-10 02:35:05,062 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product26.cil.c [2019-09-10 02:35:05,072 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:35:05,082 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:35:05,099 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:35:05,124 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:35:05,124 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:35:05,124 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:35:05,124 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:35:05,124 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:35:05,125 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:35:05,125 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:35:05,125 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:35:05,172 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states. [2019-09-10 02:35:05,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 02:35:05,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:05,207 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:05,210 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:05,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:05,217 INFO L82 PathProgramCache]: Analyzing trace with hash 750707123, now seen corresponding path program 1 times [2019-09-10 02:35:05,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:05,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:05,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:05,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:05,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:05,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:05,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:05,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:05,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:35:05,794 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:05,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:35:05,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:35:05,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:35:05,817 INFO L87 Difference]: Start difference. First operand 765 states. Second operand 4 states. [2019-09-10 02:35:05,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:05,980 INFO L93 Difference]: Finished difference Result 609 states and 970 transitions. [2019-09-10 02:35:05,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:35:05,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-10 02:35:05,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:06,013 INFO L225 Difference]: With dead ends: 609 [2019-09-10 02:35:06,014 INFO L226 Difference]: Without dead ends: 598 [2019-09-10 02:35:06,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:35:06,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-09-10 02:35:06,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-09-10 02:35:06,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-09-10 02:35:06,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 958 transitions. [2019-09-10 02:35:06,129 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 958 transitions. Word has length 87 [2019-09-10 02:35:06,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:06,130 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 958 transitions. [2019-09-10 02:35:06,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:35:06,130 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 958 transitions. [2019-09-10 02:35:06,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 02:35:06,137 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:06,137 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:06,137 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:06,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:06,138 INFO L82 PathProgramCache]: Analyzing trace with hash 773508994, now seen corresponding path program 1 times [2019-09-10 02:35:06,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:06,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:06,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:06,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:06,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:06,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:06,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:06,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:35:06,401 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:06,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:35:06,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:35:06,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:35:06,405 INFO L87 Difference]: Start difference. First operand 598 states and 958 transitions. Second operand 4 states. [2019-09-10 02:35:06,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:06,507 INFO L93 Difference]: Finished difference Result 600 states and 959 transitions. [2019-09-10 02:35:06,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:35:06,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-10 02:35:06,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:06,513 INFO L225 Difference]: With dead ends: 600 [2019-09-10 02:35:06,513 INFO L226 Difference]: Without dead ends: 598 [2019-09-10 02:35:06,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:35:06,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-09-10 02:35:06,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-09-10 02:35:06,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-09-10 02:35:06,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 957 transitions. [2019-09-10 02:35:06,548 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 957 transitions. Word has length 90 [2019-09-10 02:35:06,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:06,548 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 957 transitions. [2019-09-10 02:35:06,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:35:06,548 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 957 transitions. [2019-09-10 02:35:06,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 02:35:06,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:06,553 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:06,553 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:06,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:06,554 INFO L82 PathProgramCache]: Analyzing trace with hash -580839806, now seen corresponding path program 1 times [2019-09-10 02:35:06,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:06,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:06,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:06,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:06,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:06,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:06,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:06,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:35:06,675 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:06,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:35:06,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:35:06,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:35:06,676 INFO L87 Difference]: Start difference. First operand 598 states and 957 transitions. Second operand 4 states. [2019-09-10 02:35:06,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:06,731 INFO L93 Difference]: Finished difference Result 600 states and 958 transitions. [2019-09-10 02:35:06,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:35:06,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-10 02:35:06,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:06,736 INFO L225 Difference]: With dead ends: 600 [2019-09-10 02:35:06,737 INFO L226 Difference]: Without dead ends: 598 [2019-09-10 02:35:06,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:35:06,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-09-10 02:35:06,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-09-10 02:35:06,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-09-10 02:35:06,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 956 transitions. [2019-09-10 02:35:06,762 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 956 transitions. Word has length 91 [2019-09-10 02:35:06,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:06,762 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 956 transitions. [2019-09-10 02:35:06,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:35:06,763 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 956 transitions. [2019-09-10 02:35:06,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 02:35:06,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:06,765 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:06,765 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:06,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:06,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1251478526, now seen corresponding path program 1 times [2019-09-10 02:35:06,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:06,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:06,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:06,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:06,767 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:06,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:06,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:06,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:35:06,877 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:06,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:35:06,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:35:06,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:35:06,878 INFO L87 Difference]: Start difference. First operand 598 states and 956 transitions. Second operand 4 states. [2019-09-10 02:35:06,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:06,926 INFO L93 Difference]: Finished difference Result 600 states and 957 transitions. [2019-09-10 02:35:06,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:35:06,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-09-10 02:35:06,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:06,931 INFO L225 Difference]: With dead ends: 600 [2019-09-10 02:35:06,931 INFO L226 Difference]: Without dead ends: 598 [2019-09-10 02:35:06,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:35:06,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-09-10 02:35:06,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-09-10 02:35:06,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-09-10 02:35:06,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 955 transitions. [2019-09-10 02:35:06,954 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 955 transitions. Word has length 92 [2019-09-10 02:35:06,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:06,954 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 955 transitions. [2019-09-10 02:35:06,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:35:06,954 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 955 transitions. [2019-09-10 02:35:06,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 02:35:06,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:06,957 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:06,957 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:06,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:06,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1208737154, now seen corresponding path program 1 times [2019-09-10 02:35:06,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:06,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:06,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:06,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:06,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:07,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:07,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:07,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:35:07,103 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:07,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:35:07,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:35:07,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:35:07,105 INFO L87 Difference]: Start difference. First operand 598 states and 955 transitions. Second operand 4 states. [2019-09-10 02:35:07,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:07,195 INFO L93 Difference]: Finished difference Result 600 states and 956 transitions. [2019-09-10 02:35:07,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:35:07,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-10 02:35:07,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:07,200 INFO L225 Difference]: With dead ends: 600 [2019-09-10 02:35:07,200 INFO L226 Difference]: Without dead ends: 598 [2019-09-10 02:35:07,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:35:07,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-09-10 02:35:07,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-09-10 02:35:07,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-09-10 02:35:07,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 954 transitions. [2019-09-10 02:35:07,222 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 954 transitions. Word has length 93 [2019-09-10 02:35:07,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:07,222 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 954 transitions. [2019-09-10 02:35:07,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:35:07,223 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 954 transitions. [2019-09-10 02:35:07,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 02:35:07,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:07,225 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:07,225 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:07,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:07,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1229172839, now seen corresponding path program 1 times [2019-09-10 02:35:07,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:07,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:07,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:07,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:07,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:07,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:07,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:07,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:35:07,342 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:07,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:35:07,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:35:07,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:35:07,343 INFO L87 Difference]: Start difference. First operand 598 states and 954 transitions. Second operand 4 states. [2019-09-10 02:35:07,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:07,390 INFO L93 Difference]: Finished difference Result 600 states and 955 transitions. [2019-09-10 02:35:07,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:35:07,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-10 02:35:07,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:07,401 INFO L225 Difference]: With dead ends: 600 [2019-09-10 02:35:07,401 INFO L226 Difference]: Without dead ends: 598 [2019-09-10 02:35:07,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:35:07,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-09-10 02:35:07,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-09-10 02:35:07,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-09-10 02:35:07,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 953 transitions. [2019-09-10 02:35:07,425 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 953 transitions. Word has length 94 [2019-09-10 02:35:07,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:07,427 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 953 transitions. [2019-09-10 02:35:07,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:35:07,427 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 953 transitions. [2019-09-10 02:35:07,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 02:35:07,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:07,430 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:07,430 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:07,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:07,431 INFO L82 PathProgramCache]: Analyzing trace with hash 701446266, now seen corresponding path program 1 times [2019-09-10 02:35:07,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:07,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:07,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:07,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:07,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:07,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:07,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:07,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:35:07,614 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:07,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:35:07,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:35:07,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:35:07,615 INFO L87 Difference]: Start difference. First operand 598 states and 953 transitions. Second operand 10 states. [2019-09-10 02:35:07,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:07,757 INFO L93 Difference]: Finished difference Result 601 states and 956 transitions. [2019-09-10 02:35:07,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:35:07,757 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-09-10 02:35:07,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:07,762 INFO L225 Difference]: With dead ends: 601 [2019-09-10 02:35:07,762 INFO L226 Difference]: Without dead ends: 592 [2019-09-10 02:35:07,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:35:07,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-09-10 02:35:07,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-09-10 02:35:07,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-09-10 02:35:07,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 940 transitions. [2019-09-10 02:35:07,783 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 940 transitions. Word has length 94 [2019-09-10 02:35:07,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:07,783 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 940 transitions. [2019-09-10 02:35:07,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:35:07,783 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 940 transitions. [2019-09-10 02:35:07,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 02:35:07,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:07,785 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:07,786 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:07,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:07,786 INFO L82 PathProgramCache]: Analyzing trace with hash -870815129, now seen corresponding path program 1 times [2019-09-10 02:35:07,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:07,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:07,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:07,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:07,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:07,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:07,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:07,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:35:07,897 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:07,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:35:07,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:35:07,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:35:07,898 INFO L87 Difference]: Start difference. First operand 592 states and 940 transitions. Second operand 6 states. [2019-09-10 02:35:08,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:08,121 INFO L93 Difference]: Finished difference Result 595 states and 943 transitions. [2019-09-10 02:35:08,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:35:08,122 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-09-10 02:35:08,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:08,127 INFO L225 Difference]: With dead ends: 595 [2019-09-10 02:35:08,127 INFO L226 Difference]: Without dead ends: 592 [2019-09-10 02:35:08,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:35:08,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-09-10 02:35:08,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-09-10 02:35:08,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-09-10 02:35:08,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 936 transitions. [2019-09-10 02:35:08,150 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 936 transitions. Word has length 95 [2019-09-10 02:35:08,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:08,150 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 936 transitions. [2019-09-10 02:35:08,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:35:08,150 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 936 transitions. [2019-09-10 02:35:08,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 02:35:08,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:08,153 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:08,153 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:08,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:08,154 INFO L82 PathProgramCache]: Analyzing trace with hash 48330685, now seen corresponding path program 1 times [2019-09-10 02:35:08,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:08,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:08,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:08,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:08,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:08,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:08,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:08,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:35:08,287 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:08,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:35:08,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:35:08,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:35:08,289 INFO L87 Difference]: Start difference. First operand 592 states and 936 transitions. Second operand 6 states. [2019-09-10 02:35:08,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:08,538 INFO L93 Difference]: Finished difference Result 595 states and 939 transitions. [2019-09-10 02:35:08,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:35:08,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-09-10 02:35:08,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:08,543 INFO L225 Difference]: With dead ends: 595 [2019-09-10 02:35:08,543 INFO L226 Difference]: Without dead ends: 592 [2019-09-10 02:35:08,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:35:08,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-09-10 02:35:08,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-09-10 02:35:08,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-09-10 02:35:08,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 932 transitions. [2019-09-10 02:35:08,561 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 932 transitions. Word has length 96 [2019-09-10 02:35:08,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:08,562 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 932 transitions. [2019-09-10 02:35:08,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:35:08,562 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 932 transitions. [2019-09-10 02:35:08,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 02:35:08,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:08,565 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:08,565 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:08,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:08,565 INFO L82 PathProgramCache]: Analyzing trace with hash -151934484, now seen corresponding path program 1 times [2019-09-10 02:35:08,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:08,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:08,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:08,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:08,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:08,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:08,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:08,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:35:08,674 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:08,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:35:08,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:35:08,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:35:08,675 INFO L87 Difference]: Start difference. First operand 592 states and 932 transitions. Second operand 6 states. [2019-09-10 02:35:08,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:08,893 INFO L93 Difference]: Finished difference Result 595 states and 935 transitions. [2019-09-10 02:35:08,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:35:08,893 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-09-10 02:35:08,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:08,898 INFO L225 Difference]: With dead ends: 595 [2019-09-10 02:35:08,898 INFO L226 Difference]: Without dead ends: 592 [2019-09-10 02:35:08,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:35:08,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-09-10 02:35:08,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-09-10 02:35:08,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-09-10 02:35:08,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 928 transitions. [2019-09-10 02:35:08,916 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 928 transitions. Word has length 97 [2019-09-10 02:35:08,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:08,917 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 928 transitions. [2019-09-10 02:35:08,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:35:08,917 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 928 transitions. [2019-09-10 02:35:08,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 02:35:08,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:08,920 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:08,920 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:08,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:08,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1813612140, now seen corresponding path program 1 times [2019-09-10 02:35:08,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:08,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:08,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:08,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:08,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:09,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:09,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:09,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:35:09,040 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:09,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:35:09,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:35:09,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:35:09,041 INFO L87 Difference]: Start difference. First operand 592 states and 928 transitions. Second operand 7 states. [2019-09-10 02:35:09,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:09,110 INFO L93 Difference]: Finished difference Result 595 states and 931 transitions. [2019-09-10 02:35:09,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:35:09,111 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-09-10 02:35:09,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:09,115 INFO L225 Difference]: With dead ends: 595 [2019-09-10 02:35:09,115 INFO L226 Difference]: Without dead ends: 571 [2019-09-10 02:35:09,116 INFO L628 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-09-10 02:35:09,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-09-10 02:35:09,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-09-10 02:35:09,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-09-10 02:35:09,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 894 transitions. [2019-09-10 02:35:09,133 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 894 transitions. Word has length 97 [2019-09-10 02:35:09,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:09,133 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 894 transitions. [2019-09-10 02:35:09,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:35:09,134 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 894 transitions. [2019-09-10 02:35:09,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 02:35:09,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:09,138 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:09,138 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:09,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:09,139 INFO L82 PathProgramCache]: Analyzing trace with hash -694201758, now seen corresponding path program 1 times [2019-09-10 02:35:09,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:09,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:09,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:09,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:09,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:09,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:09,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:09,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:35:09,250 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:09,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:35:09,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:35:09,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:35:09,251 INFO L87 Difference]: Start difference. First operand 571 states and 894 transitions. Second operand 6 states. [2019-09-10 02:35:09,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:09,337 INFO L93 Difference]: Finished difference Result 574 states and 897 transitions. [2019-09-10 02:35:09,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:35:09,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-09-10 02:35:09,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:09,342 INFO L225 Difference]: With dead ends: 574 [2019-09-10 02:35:09,342 INFO L226 Difference]: Without dead ends: 571 [2019-09-10 02:35:09,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:35:09,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-09-10 02:35:09,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-09-10 02:35:09,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-09-10 02:35:09,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 893 transitions. [2019-09-10 02:35:09,367 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 893 transitions. Word has length 98 [2019-09-10 02:35:09,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:09,369 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 893 transitions. [2019-09-10 02:35:09,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:35:09,369 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 893 transitions. [2019-09-10 02:35:09,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 02:35:09,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:09,371 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:09,371 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:09,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:09,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1046367601, now seen corresponding path program 1 times [2019-09-10 02:35:09,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:09,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:09,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:09,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:09,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:09,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:09,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:09,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:35:09,536 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:09,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:35:09,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:35:09,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:35:09,537 INFO L87 Difference]: Start difference. First operand 571 states and 893 transitions. Second operand 6 states. [2019-09-10 02:35:09,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:09,646 INFO L93 Difference]: Finished difference Result 574 states and 896 transitions. [2019-09-10 02:35:09,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:35:09,647 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-09-10 02:35:09,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:09,651 INFO L225 Difference]: With dead ends: 574 [2019-09-10 02:35:09,652 INFO L226 Difference]: Without dead ends: 571 [2019-09-10 02:35:09,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:35:09,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-09-10 02:35:09,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-09-10 02:35:09,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-09-10 02:35:09,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 892 transitions. [2019-09-10 02:35:09,676 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 892 transitions. Word has length 99 [2019-09-10 02:35:09,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:09,676 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 892 transitions. [2019-09-10 02:35:09,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:35:09,676 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 892 transitions. [2019-09-10 02:35:09,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 02:35:09,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:09,679 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:09,679 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:09,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:09,680 INFO L82 PathProgramCache]: Analyzing trace with hash 540428551, now seen corresponding path program 1 times [2019-09-10 02:35:09,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:09,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:09,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:09,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:09,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:09,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:09,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:09,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 02:35:09,848 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:09,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:35:09,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:35:09,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:35:09,849 INFO L87 Difference]: Start difference. First operand 571 states and 892 transitions. Second operand 12 states. [2019-09-10 02:35:10,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:10,027 INFO L93 Difference]: Finished difference Result 575 states and 895 transitions. [2019-09-10 02:35:10,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:35:10,028 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 100 [2019-09-10 02:35:10,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:10,034 INFO L225 Difference]: With dead ends: 575 [2019-09-10 02:35:10,034 INFO L226 Difference]: Without dead ends: 571 [2019-09-10 02:35:10,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 02:35:10,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-09-10 02:35:10,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-09-10 02:35:10,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-09-10 02:35:10,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 891 transitions. [2019-09-10 02:35:10,061 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 891 transitions. Word has length 100 [2019-09-10 02:35:10,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:10,062 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 891 transitions. [2019-09-10 02:35:10,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:35:10,062 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 891 transitions. [2019-09-10 02:35:10,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 02:35:10,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:10,064 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:10,064 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:10,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:10,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1660047310, now seen corresponding path program 1 times [2019-09-10 02:35:10,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:10,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:10,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:10,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:10,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:10,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:10,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:10,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:35:10,246 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:10,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:35:10,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:35:10,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:35:10,247 INFO L87 Difference]: Start difference. First operand 571 states and 891 transitions. Second operand 6 states. [2019-09-10 02:35:13,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:13,813 INFO L93 Difference]: Finished difference Result 1181 states and 1894 transitions. [2019-09-10 02:35:13,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:35:13,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-09-10 02:35:13,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:13,823 INFO L225 Difference]: With dead ends: 1181 [2019-09-10 02:35:13,824 INFO L226 Difference]: Without dead ends: 1181 [2019-09-10 02:35:13,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:35:13,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2019-09-10 02:35:13,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1054. [2019-09-10 02:35:13,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-09-10 02:35:13,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1692 transitions. [2019-09-10 02:35:13,866 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1692 transitions. Word has length 101 [2019-09-10 02:35:13,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:13,867 INFO L475 AbstractCegarLoop]: Abstraction has 1054 states and 1692 transitions. [2019-09-10 02:35:13,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:35:13,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1692 transitions. [2019-09-10 02:35:13,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 02:35:13,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:13,872 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:13,872 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:13,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:13,873 INFO L82 PathProgramCache]: Analyzing trace with hash 335474846, now seen corresponding path program 1 times [2019-09-10 02:35:13,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:13,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:13,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:13,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:13,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:14,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:14,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:14,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 02:35:14,072 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:14,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:35:14,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:35:14,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:35:14,074 INFO L87 Difference]: Start difference. First operand 1054 states and 1692 transitions. Second operand 12 states. [2019-09-10 02:35:24,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:24,141 INFO L93 Difference]: Finished difference Result 2378 states and 3792 transitions. [2019-09-10 02:35:24,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 02:35:24,141 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 133 [2019-09-10 02:35:24,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:24,157 INFO L225 Difference]: With dead ends: 2378 [2019-09-10 02:35:24,157 INFO L226 Difference]: Without dead ends: 2378 [2019-09-10 02:35:24,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-09-10 02:35:24,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2019-09-10 02:35:24,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 2320. [2019-09-10 02:35:24,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2320 states. [2019-09-10 02:35:24,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 3712 transitions. [2019-09-10 02:35:24,236 INFO L78 Accepts]: Start accepts. Automaton has 2320 states and 3712 transitions. Word has length 133 [2019-09-10 02:35:24,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:24,237 INFO L475 AbstractCegarLoop]: Abstraction has 2320 states and 3712 transitions. [2019-09-10 02:35:24,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:35:24,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 3712 transitions. [2019-09-10 02:35:24,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 02:35:24,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:24,241 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:24,242 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:24,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:24,242 INFO L82 PathProgramCache]: Analyzing trace with hash -165410431, now seen corresponding path program 1 times [2019-09-10 02:35:24,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:24,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:24,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:24,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:24,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:24,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:24,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:24,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:35:24,440 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:24,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:35:24,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:35:24,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:35:24,441 INFO L87 Difference]: Start difference. First operand 2320 states and 3712 transitions. Second operand 9 states. [2019-09-10 02:35:27,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:27,968 INFO L93 Difference]: Finished difference Result 2360 states and 3840 transitions. [2019-09-10 02:35:27,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:35:27,969 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 02:35:27,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:27,983 INFO L225 Difference]: With dead ends: 2360 [2019-09-10 02:35:27,983 INFO L226 Difference]: Without dead ends: 2360 [2019-09-10 02:35:27,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:35:27,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2019-09-10 02:35:28,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 2344. [2019-09-10 02:35:28,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2344 states. [2019-09-10 02:35:28,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 3796 transitions. [2019-09-10 02:35:28,055 INFO L78 Accepts]: Start accepts. Automaton has 2344 states and 3796 transitions. Word has length 134 [2019-09-10 02:35:28,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:28,056 INFO L475 AbstractCegarLoop]: Abstraction has 2344 states and 3796 transitions. [2019-09-10 02:35:28,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:35:28,056 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 3796 transitions. [2019-09-10 02:35:28,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 02:35:28,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:28,060 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:28,061 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:28,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:28,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1058567112, now seen corresponding path program 1 times [2019-09-10 02:35:28,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:28,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:28,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:28,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:28,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:28,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:28,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:28,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:35:28,222 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:28,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:35:28,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:35:28,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:35:28,223 INFO L87 Difference]: Start difference. First operand 2344 states and 3796 transitions. Second operand 8 states. [2019-09-10 02:35:34,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:34,518 INFO L93 Difference]: Finished difference Result 5669 states and 9070 transitions. [2019-09-10 02:35:34,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 02:35:34,532 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 135 [2019-09-10 02:35:34,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:34,571 INFO L225 Difference]: With dead ends: 5669 [2019-09-10 02:35:34,571 INFO L226 Difference]: Without dead ends: 5669 [2019-09-10 02:35:34,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:35:34,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5669 states. [2019-09-10 02:35:34,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5669 to 5621. [2019-09-10 02:35:34,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5621 states. [2019-09-10 02:35:34,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5621 states to 5621 states and 8997 transitions. [2019-09-10 02:35:34,757 INFO L78 Accepts]: Start accepts. Automaton has 5621 states and 8997 transitions. Word has length 135 [2019-09-10 02:35:34,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:34,759 INFO L475 AbstractCegarLoop]: Abstraction has 5621 states and 8997 transitions. [2019-09-10 02:35:34,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:35:34,759 INFO L276 IsEmpty]: Start isEmpty. Operand 5621 states and 8997 transitions. [2019-09-10 02:35:34,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 02:35:34,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:34,763 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:34,763 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:34,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:34,764 INFO L82 PathProgramCache]: Analyzing trace with hash 2066663089, now seen corresponding path program 1 times [2019-09-10 02:35:34,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:34,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:34,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:34,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:34,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:34,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:34,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:34,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:34,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:35:34,937 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:34,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:35:34,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:35:34,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:35:34,941 INFO L87 Difference]: Start difference. First operand 5621 states and 8997 transitions. Second operand 9 states. [2019-09-10 02:35:44,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:44,209 INFO L93 Difference]: Finished difference Result 9498 states and 15362 transitions. [2019-09-10 02:35:44,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 02:35:44,210 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 141 [2019-09-10 02:35:44,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:44,296 INFO L225 Difference]: With dead ends: 9498 [2019-09-10 02:35:44,296 INFO L226 Difference]: Without dead ends: 9492 [2019-09-10 02:35:44,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:35:44,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9492 states. [2019-09-10 02:35:44,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9492 to 8882. [2019-09-10 02:35:44,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8882 states. [2019-09-10 02:35:44,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8882 states to 8882 states and 14232 transitions. [2019-09-10 02:35:44,632 INFO L78 Accepts]: Start accepts. Automaton has 8882 states and 14232 transitions. Word has length 141 [2019-09-10 02:35:44,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:44,632 INFO L475 AbstractCegarLoop]: Abstraction has 8882 states and 14232 transitions. [2019-09-10 02:35:44,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:35:44,633 INFO L276 IsEmpty]: Start isEmpty. Operand 8882 states and 14232 transitions. [2019-09-10 02:35:44,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 02:35:44,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:44,637 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:44,637 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:44,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:44,637 INFO L82 PathProgramCache]: Analyzing trace with hash 141129778, now seen corresponding path program 1 times [2019-09-10 02:35:44,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:44,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:44,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:44,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:44,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:44,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:44,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:44,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:35:44,793 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:44,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:35:44,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:35:44,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:35:44,794 INFO L87 Difference]: Start difference. First operand 8882 states and 14232 transitions. Second operand 7 states. [2019-09-10 02:35:49,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:49,256 INFO L93 Difference]: Finished difference Result 18010 states and 29462 transitions. [2019-09-10 02:35:49,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:35:49,257 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-09-10 02:35:49,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:49,360 INFO L225 Difference]: With dead ends: 18010 [2019-09-10 02:35:49,360 INFO L226 Difference]: Without dead ends: 18010 [2019-09-10 02:35:49,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:35:49,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18010 states. [2019-09-10 02:35:49,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18010 to 17628. [2019-09-10 02:35:49,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17628 states. [2019-09-10 02:35:49,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17628 states to 17628 states and 28629 transitions. [2019-09-10 02:35:49,923 INFO L78 Accepts]: Start accepts. Automaton has 17628 states and 28629 transitions. Word has length 141 [2019-09-10 02:35:49,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:49,924 INFO L475 AbstractCegarLoop]: Abstraction has 17628 states and 28629 transitions. [2019-09-10 02:35:49,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:35:49,924 INFO L276 IsEmpty]: Start isEmpty. Operand 17628 states and 28629 transitions. [2019-09-10 02:35:49,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 02:35:49,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:49,929 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:49,929 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:49,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:49,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1685261202, now seen corresponding path program 1 times [2019-09-10 02:35:49,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:49,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:49,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:49,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:49,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:50,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:50,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:50,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:35:50,067 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:50,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:35:50,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:35:50,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:35:50,069 INFO L87 Difference]: Start difference. First operand 17628 states and 28629 transitions. Second operand 5 states. [2019-09-10 02:35:50,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:50,924 INFO L93 Difference]: Finished difference Result 18033 states and 29232 transitions. [2019-09-10 02:35:50,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:35:50,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2019-09-10 02:35:50,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:51,015 INFO L225 Difference]: With dead ends: 18033 [2019-09-10 02:35:51,016 INFO L226 Difference]: Without dead ends: 18033 [2019-09-10 02:35:51,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:35:51,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18033 states. [2019-09-10 02:35:51,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18033 to 17817. [2019-09-10 02:35:51,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17817 states. [2019-09-10 02:35:51,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17817 states to 17817 states and 28893 transitions. [2019-09-10 02:35:51,515 INFO L78 Accepts]: Start accepts. Automaton has 17817 states and 28893 transitions. Word has length 146 [2019-09-10 02:35:51,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:51,516 INFO L475 AbstractCegarLoop]: Abstraction has 17817 states and 28893 transitions. [2019-09-10 02:35:51,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:35:51,516 INFO L276 IsEmpty]: Start isEmpty. Operand 17817 states and 28893 transitions. [2019-09-10 02:35:51,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 02:35:51,520 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:51,521 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:51,522 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:51,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:51,522 INFO L82 PathProgramCache]: Analyzing trace with hash 793992918, now seen corresponding path program 1 times [2019-09-10 02:35:51,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:51,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:51,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:51,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:51,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:51,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:51,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:51,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:35:51,658 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:51,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:35:51,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:35:51,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:35:51,659 INFO L87 Difference]: Start difference. First operand 17817 states and 28893 transitions. Second operand 7 states. [2019-09-10 02:35:51,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:51,891 INFO L93 Difference]: Finished difference Result 19845 states and 32136 transitions. [2019-09-10 02:35:51,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:35:51,893 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 153 [2019-09-10 02:35:51,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:51,983 INFO L225 Difference]: With dead ends: 19845 [2019-09-10 02:35:51,983 INFO L226 Difference]: Without dead ends: 17817 [2019-09-10 02:35:51,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-09-10 02:35:51,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17817 states. [2019-09-10 02:35:52,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17817 to 17817. [2019-09-10 02:35:52,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17817 states. [2019-09-10 02:35:52,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17817 states to 17817 states and 28503 transitions. [2019-09-10 02:35:52,456 INFO L78 Accepts]: Start accepts. Automaton has 17817 states and 28503 transitions. Word has length 153 [2019-09-10 02:35:52,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:52,457 INFO L475 AbstractCegarLoop]: Abstraction has 17817 states and 28503 transitions. [2019-09-10 02:35:52,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:35:52,457 INFO L276 IsEmpty]: Start isEmpty. Operand 17817 states and 28503 transitions. [2019-09-10 02:35:52,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-10 02:35:52,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:52,463 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:52,463 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:52,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:52,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1507371187, now seen corresponding path program 1 times [2019-09-10 02:35:52,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:52,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:52,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:52,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:52,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:52,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:35:52,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:52,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:35:52,620 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:52,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:35:52,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:35:52,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:35:52,622 INFO L87 Difference]: Start difference. First operand 17817 states and 28503 transitions. Second operand 7 states. [2019-09-10 02:35:57,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:57,212 INFO L93 Difference]: Finished difference Result 19420 states and 31004 transitions. [2019-09-10 02:35:57,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 02:35:57,212 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 158 [2019-09-10 02:35:57,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:57,272 INFO L225 Difference]: With dead ends: 19420 [2019-09-10 02:35:57,272 INFO L226 Difference]: Without dead ends: 19420 [2019-09-10 02:35:57,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:35:57,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19420 states. [2019-09-10 02:35:57,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19420 to 18879. [2019-09-10 02:35:57,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18879 states. [2019-09-10 02:35:57,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18879 states to 18879 states and 29934 transitions. [2019-09-10 02:35:57,887 INFO L78 Accepts]: Start accepts. Automaton has 18879 states and 29934 transitions. Word has length 158 [2019-09-10 02:35:57,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:57,888 INFO L475 AbstractCegarLoop]: Abstraction has 18879 states and 29934 transitions. [2019-09-10 02:35:57,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:35:57,888 INFO L276 IsEmpty]: Start isEmpty. Operand 18879 states and 29934 transitions. [2019-09-10 02:35:57,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-10 02:35:57,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:57,894 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:57,895 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:57,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:57,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1591637241, now seen corresponding path program 1 times [2019-09-10 02:35:57,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:57,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:57,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:57,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:57,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:58,018 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:35:58,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:58,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:35:58,018 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:58,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:35:58,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:35:58,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:35:58,020 INFO L87 Difference]: Start difference. First operand 18879 states and 29934 transitions. Second operand 6 states. [2019-09-10 02:35:58,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:58,306 INFO L93 Difference]: Finished difference Result 26794 states and 42985 transitions. [2019-09-10 02:35:58,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:35:58,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2019-09-10 02:35:58,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:58,379 INFO L225 Difference]: With dead ends: 26794 [2019-09-10 02:35:58,379 INFO L226 Difference]: Without dead ends: 26794 [2019-09-10 02:35:58,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:35:58,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26794 states. [2019-09-10 02:35:58,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26794 to 24812. [2019-09-10 02:35:58,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24812 states. [2019-09-10 02:35:58,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24812 states to 24812 states and 39761 transitions. [2019-09-10 02:35:58,927 INFO L78 Accepts]: Start accepts. Automaton has 24812 states and 39761 transitions. Word has length 163 [2019-09-10 02:35:58,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:58,928 INFO L475 AbstractCegarLoop]: Abstraction has 24812 states and 39761 transitions. [2019-09-10 02:35:58,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:35:58,928 INFO L276 IsEmpty]: Start isEmpty. Operand 24812 states and 39761 transitions. [2019-09-10 02:35:58,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-10 02:35:58,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:58,933 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:58,934 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:58,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:58,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1611875958, now seen corresponding path program 1 times [2019-09-10 02:35:58,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:58,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:58,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:58,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:58,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:59,096 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:35:59,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:59,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 02:35:59,097 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:59,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:35:59,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:35:59,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:35:59,099 INFO L87 Difference]: Start difference. First operand 24812 states and 39761 transitions. Second operand 11 states. [2019-09-10 02:36:08,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:08,035 INFO L93 Difference]: Finished difference Result 32580 states and 52012 transitions. [2019-09-10 02:36:08,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 02:36:08,036 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 165 [2019-09-10 02:36:08,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:08,120 INFO L225 Difference]: With dead ends: 32580 [2019-09-10 02:36:08,120 INFO L226 Difference]: Without dead ends: 32526 [2019-09-10 02:36:08,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-09-10 02:36:08,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32526 states. [2019-09-10 02:36:08,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32526 to 30140. [2019-09-10 02:36:08,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30140 states. [2019-09-10 02:36:08,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30140 states to 30140 states and 47570 transitions. [2019-09-10 02:36:08,628 INFO L78 Accepts]: Start accepts. Automaton has 30140 states and 47570 transitions. Word has length 165 [2019-09-10 02:36:08,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:08,628 INFO L475 AbstractCegarLoop]: Abstraction has 30140 states and 47570 transitions. [2019-09-10 02:36:08,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:36:08,628 INFO L276 IsEmpty]: Start isEmpty. Operand 30140 states and 47570 transitions. [2019-09-10 02:36:08,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-10 02:36:08,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:08,634 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:08,634 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:08,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:08,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1591538583, now seen corresponding path program 1 times [2019-09-10 02:36:08,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:08,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:08,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:08,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:08,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:08,811 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:36:08,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:08,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:36:08,812 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:08,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:36:08,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:36:08,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:36:08,816 INFO L87 Difference]: Start difference. First operand 30140 states and 47570 transitions. Second operand 10 states. [2019-09-10 02:36:16,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:16,258 INFO L93 Difference]: Finished difference Result 54539 states and 87776 transitions. [2019-09-10 02:36:16,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:36:16,258 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 165 [2019-09-10 02:36:16,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:16,478 INFO L225 Difference]: With dead ends: 54539 [2019-09-10 02:36:16,479 INFO L226 Difference]: Without dead ends: 54539 [2019-09-10 02:36:16,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:36:16,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54539 states. [2019-09-10 02:36:17,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54539 to 53507. [2019-09-10 02:36:17,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53507 states. [2019-09-10 02:36:17,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53507 states to 53507 states and 85281 transitions. [2019-09-10 02:36:17,702 INFO L78 Accepts]: Start accepts. Automaton has 53507 states and 85281 transitions. Word has length 165 [2019-09-10 02:36:17,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:17,703 INFO L475 AbstractCegarLoop]: Abstraction has 53507 states and 85281 transitions. [2019-09-10 02:36:17,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:36:17,703 INFO L276 IsEmpty]: Start isEmpty. Operand 53507 states and 85281 transitions. [2019-09-10 02:36:17,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 02:36:17,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:17,709 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:17,710 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:17,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:17,710 INFO L82 PathProgramCache]: Analyzing trace with hash -740255397, now seen corresponding path program 1 times [2019-09-10 02:36:17,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:17,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:17,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:17,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:17,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:17,867 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:36:17,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:17,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:36:17,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:17,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:36:17,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:36:17,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:36:17,870 INFO L87 Difference]: Start difference. First operand 53507 states and 85281 transitions. Second operand 10 states. [2019-09-10 02:36:26,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:26,026 INFO L93 Difference]: Finished difference Result 108126 states and 178213 transitions. [2019-09-10 02:36:26,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:36:26,026 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 166 [2019-09-10 02:36:26,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:26,432 INFO L225 Difference]: With dead ends: 108126 [2019-09-10 02:36:26,432 INFO L226 Difference]: Without dead ends: 108126 [2019-09-10 02:36:26,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:36:26,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108126 states. [2019-09-10 02:36:28,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108126 to 106796. [2019-09-10 02:36:28,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106796 states. [2019-09-10 02:36:28,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106796 states to 106796 states and 173941 transitions. [2019-09-10 02:36:28,544 INFO L78 Accepts]: Start accepts. Automaton has 106796 states and 173941 transitions. Word has length 166 [2019-09-10 02:36:28,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:28,545 INFO L475 AbstractCegarLoop]: Abstraction has 106796 states and 173941 transitions. [2019-09-10 02:36:28,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:36:28,545 INFO L276 IsEmpty]: Start isEmpty. Operand 106796 states and 173941 transitions. [2019-09-10 02:36:28,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 02:36:28,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:28,552 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:28,552 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:28,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:28,553 INFO L82 PathProgramCache]: Analyzing trace with hash 725123245, now seen corresponding path program 1 times [2019-09-10 02:36:28,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:28,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:28,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:28,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:28,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:28,713 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:36:28,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:28,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:36:28,714 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:28,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:36:28,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:36:28,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:36:28,715 INFO L87 Difference]: Start difference. First operand 106796 states and 173941 transitions. Second operand 10 states. [2019-09-10 02:36:38,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:38,606 INFO L93 Difference]: Finished difference Result 235440 states and 402789 transitions. [2019-09-10 02:36:38,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:36:38,606 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 167 [2019-09-10 02:36:38,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:40,099 INFO L225 Difference]: With dead ends: 235440 [2019-09-10 02:36:40,099 INFO L226 Difference]: Without dead ends: 235440 [2019-09-10 02:36:40,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:36:40,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235440 states. [2019-09-10 02:36:47,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235440 to 233438. [2019-09-10 02:36:47,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233438 states. [2019-09-10 02:36:49,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233438 states to 233438 states and 393198 transitions. [2019-09-10 02:36:49,096 INFO L78 Accepts]: Start accepts. Automaton has 233438 states and 393198 transitions. Word has length 167 [2019-09-10 02:36:49,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:49,097 INFO L475 AbstractCegarLoop]: Abstraction has 233438 states and 393198 transitions. [2019-09-10 02:36:49,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:36:49,097 INFO L276 IsEmpty]: Start isEmpty. Operand 233438 states and 393198 transitions. [2019-09-10 02:36:49,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 02:36:49,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:49,103 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:49,103 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:49,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:49,104 INFO L82 PathProgramCache]: Analyzing trace with hash 79112063, now seen corresponding path program 1 times [2019-09-10 02:36:49,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:49,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:49,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:49,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:49,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:49,253 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:36:49,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:49,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:36:49,253 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:49,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:36:49,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:36:49,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:36:49,254 INFO L87 Difference]: Start difference. First operand 233438 states and 393198 transitions. Second operand 10 states. [2019-09-10 02:37:05,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:05,121 INFO L93 Difference]: Finished difference Result 555397 states and 1001256 transitions. [2019-09-10 02:37:05,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:37:05,122 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 166 [2019-09-10 02:37:05,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:07,667 INFO L225 Difference]: With dead ends: 555397 [2019-09-10 02:37:07,667 INFO L226 Difference]: Without dead ends: 555397 [2019-09-10 02:37:07,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:37:07,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555397 states. [2019-09-10 02:37:41,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555397 to 551975. [2019-09-10 02:37:41,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551975 states. [2019-09-10 02:37:56,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551975 states to 551975 states and 974366 transitions. [2019-09-10 02:37:56,147 INFO L78 Accepts]: Start accepts. Automaton has 551975 states and 974366 transitions. Word has length 166 [2019-09-10 02:37:56,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:56,147 INFO L475 AbstractCegarLoop]: Abstraction has 551975 states and 974366 transitions. [2019-09-10 02:37:56,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:37:56,147 INFO L276 IsEmpty]: Start isEmpty. Operand 551975 states and 974366 transitions. [2019-09-10 02:37:56,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-10 02:37:56,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:56,153 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:56,153 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:56,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:56,154 INFO L82 PathProgramCache]: Analyzing trace with hash 515339505, now seen corresponding path program 1 times [2019-09-10 02:37:56,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:56,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:56,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:56,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:56,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:56,361 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:37:56,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:56,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:37:56,362 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:56,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:37:56,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:37:56,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:37:56,363 INFO L87 Difference]: Start difference. First operand 551975 states and 974366 transitions. Second operand 10 states. [2019-09-10 02:38:43,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:43,656 INFO L93 Difference]: Finished difference Result 1418653 states and 2743118 transitions. [2019-09-10 02:38:43,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:38:43,656 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 169 [2019-09-10 02:38:43,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:39:11,970 INFO L225 Difference]: With dead ends: 1418653 [2019-09-10 02:39:11,970 INFO L226 Difference]: Without dead ends: 1418653 [2019-09-10 02:39:11,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:39:12,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418653 states.