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_product30.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:36:15,882 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:36:15,884 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:36:15,896 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:36:15,896 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:36:15,897 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:36:15,898 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:36:15,900 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:36:15,902 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:36:15,903 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:36:15,904 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:36:15,905 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:36:15,905 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:36:15,906 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:36:15,907 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:36:15,908 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:36:15,909 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:36:15,910 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:36:15,911 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:36:15,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:36:15,915 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:36:15,916 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:36:15,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:36:15,917 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:36:15,920 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:36:15,920 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:36:15,920 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:36:15,921 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:36:15,921 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:36:15,922 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:36:15,922 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:36:15,923 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:36:15,924 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:36:15,925 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:36:15,926 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:36:15,926 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:36:15,927 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:36:15,927 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:36:15,927 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:36:15,928 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:36:15,929 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:36:15,929 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:36:15,943 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:36:15,944 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:36:15,944 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:36:15,944 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:36:15,945 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:36:15,945 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:36:15,945 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:36:15,945 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:36:15,946 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:36:15,946 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:36:15,946 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:36:15,947 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:36:15,947 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:36:15,947 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:36:15,947 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:36:15,947 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:36:15,948 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:36:15,948 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:36:15,948 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:36:15,948 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:36:15,948 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:36:15,949 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:36:15,949 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:36:15,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:36:15,949 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:36:15,949 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:36:15,950 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:36:15,950 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:36:15,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:36:15,950 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:36:15,978 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:36:15,990 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:36:15,993 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:36:15,995 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:36:15,995 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:36:15,996 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product30.cil.c [2019-09-10 02:36:16,055 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90dde8e36/d802b3e484074af1ac20d60cf1f4077f/FLAGa137acfc6 [2019-09-10 02:36:16,732 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:36:16,733 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product30.cil.c [2019-09-10 02:36:16,765 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90dde8e36/d802b3e484074af1ac20d60cf1f4077f/FLAGa137acfc6 [2019-09-10 02:36:16,887 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90dde8e36/d802b3e484074af1ac20d60cf1f4077f [2019-09-10 02:36:16,896 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:36:16,897 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:36:16,900 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:36:16,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:36:16,904 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:36:16,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:36:16" (1/1) ... [2019-09-10 02:36:16,908 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66aadf2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:16, skipping insertion in model container [2019-09-10 02:36:16,908 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:36:16" (1/1) ... [2019-09-10 02:36:16,916 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:36:17,007 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:36:17,737 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:36:17,761 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:36:17,955 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:36:18,096 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:36:18,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:18 WrapperNode [2019-09-10 02:36:18,098 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:36:18,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:36:18,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:36:18,100 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:36:18,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:18" (1/1) ... [2019-09-10 02:36:18,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:18" (1/1) ... [2019-09-10 02:36:18,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:18" (1/1) ... [2019-09-10 02:36:18,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:18" (1/1) ... [2019-09-10 02:36:18,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:18" (1/1) ... [2019-09-10 02:36:18,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:18" (1/1) ... [2019-09-10 02:36:18,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:18" (1/1) ... [2019-09-10 02:36:18,348 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:36:18,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:36:18,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:36:18,349 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:36:18,350 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:18" (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:36:18,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:36:18,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:36:18,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:36:18,420 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:36:18,420 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:36:18,420 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:36:18,420 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:36:18,421 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:36:18,421 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:36:18,421 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:36:18,421 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:36:18,421 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:36:18,422 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:36:18,422 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:36:18,422 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-09-10 02:36:18,422 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-09-10 02:36:18,423 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-09-10 02:36:18,423 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-09-10 02:36:18,423 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:36:18,423 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-10 02:36:18,423 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-10 02:36:18,424 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-10 02:36:18,424 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-10 02:36:18,424 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-10 02:36:18,424 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-10 02:36:18,425 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-10 02:36:18,425 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-10 02:36:18,425 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-10 02:36:18,425 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-10 02:36:18,425 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-10 02:36:18,425 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-09-10 02:36:18,426 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-10 02:36:18,426 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-10 02:36:18,426 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-10 02:36:18,426 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-10 02:36:18,426 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-10 02:36:18,427 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-10 02:36:18,427 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-10 02:36:18,427 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-10 02:36:18,427 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-10 02:36:18,427 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-10 02:36:18,427 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-09-10 02:36:18,428 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-10 02:36:18,428 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-10 02:36:18,428 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-10 02:36:18,428 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-10 02:36:18,428 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-10 02:36:18,428 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-10 02:36:18,429 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-10 02:36:18,429 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__twothirdsfull [2019-09-10 02:36:18,429 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-10 02:36:18,429 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__twothirdsfull [2019-09-10 02:36:18,429 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-10 02:36:18,430 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-10 02:36:18,430 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-10 02:36:18,430 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-10 02:36:18,430 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-10 02:36:18,430 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-10 02:36:18,430 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-10 02:36:18,431 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-10 02:36:18,431 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-10 02:36:18,431 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-10 02:36:18,431 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-10 02:36:18,431 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-10 02:36:18,432 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-10 02:36:18,432 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-10 02:36:18,432 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-10 02:36:18,432 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-10 02:36:18,432 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-10 02:36:18,433 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-10 02:36:18,433 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-10 02:36:18,433 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-10 02:36:18,433 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-10 02:36:18,433 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-10 02:36:18,433 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-10 02:36:18,434 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-10 02:36:18,434 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:36:18,434 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-10 02:36:18,434 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:36:18,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:36:18,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:36:18,435 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:36:18,435 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:36:18,435 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:36:18,435 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:36:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:36:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:36:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:36:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:36:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:36:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:36:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:36:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:36:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:36:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:36:18,438 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:36:18,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:36:18,438 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:36:18,438 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:36:18,438 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:36:18,438 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:36:18,438 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:36:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:36:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-10 02:36:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-10 02:36:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-10 02:36:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-09-10 02:36:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-09-10 02:36:18,440 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-09-10 02:36:18,440 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-09-10 02:36:18,440 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-10 02:36:18,440 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-10 02:36:18,440 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:36:18,440 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-10 02:36:18,440 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-10 02:36:18,441 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-10 02:36:18,441 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-10 02:36:18,441 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-10 02:36:18,441 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-10 02:36:18,441 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-10 02:36:18,441 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-10 02:36:18,442 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-10 02:36:18,442 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-10 02:36:18,442 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-10 02:36:18,442 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:36:18,442 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-10 02:36:18,442 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-10 02:36:18,442 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-10 02:36:18,443 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-10 02:36:18,443 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-10 02:36:18,443 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-10 02:36:18,443 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-10 02:36:18,443 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-10 02:36:18,443 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-10 02:36:18,444 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-10 02:36:18,444 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-10 02:36:18,444 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-10 02:36:18,444 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-09-10 02:36:18,444 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-10 02:36:18,444 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-10 02:36:18,444 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-10 02:36:18,445 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-10 02:36:18,445 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-10 02:36:18,445 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-09-10 02:36:18,445 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-10 02:36:18,445 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-10 02:36:18,445 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-10 02:36:18,446 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-10 02:36:18,446 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-10 02:36:18,446 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-10 02:36:18,446 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__twothirdsfull [2019-09-10 02:36:18,446 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__twothirdsfull [2019-09-10 02:36:18,446 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-10 02:36:18,446 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-10 02:36:18,447 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-10 02:36:18,447 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-10 02:36:18,447 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-10 02:36:18,447 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-10 02:36:18,447 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-10 02:36:18,447 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-10 02:36:18,447 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-10 02:36:18,447 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-10 02:36:18,448 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-10 02:36:18,448 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-10 02:36:18,448 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-10 02:36:18,448 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-10 02:36:18,448 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-10 02:36:18,448 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:36:18,448 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-10 02:36:18,449 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:36:18,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:36:18,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:36:18,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:36:20,800 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:36:20,800 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-10 02:36:20,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:36:20 BoogieIcfgContainer [2019-09-10 02:36:20,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:36:20,803 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:36:20,803 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:36:20,807 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:36:20,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:36:16" (1/3) ... [2019-09-10 02:36:20,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16397d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:36:20, skipping insertion in model container [2019-09-10 02:36:20,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:18" (2/3) ... [2019-09-10 02:36:20,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16397d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:36:20, skipping insertion in model container [2019-09-10 02:36:20,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:36:20" (3/3) ... [2019-09-10 02:36:20,811 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product30.cil.c [2019-09-10 02:36:20,822 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:36:20,833 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:36:20,850 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:36:20,891 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:36:20,891 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:36:20,891 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:36:20,891 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:36:20,891 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:36:20,891 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:36:20,892 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:36:20,892 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:36:20,938 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states. [2019-09-10 02:36:20,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 02:36:20,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:20,973 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:36:20,975 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:20,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:20,981 INFO L82 PathProgramCache]: Analyzing trace with hash 236945449, now seen corresponding path program 1 times [2019-09-10 02:36:20,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:21,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:21,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:21,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:21,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:21,556 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:36:21,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:21,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:36:21,559 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:21,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:36:21,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:36:21,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:36:21,584 INFO L87 Difference]: Start difference. First operand 796 states. Second operand 4 states. [2019-09-10 02:36:21,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:21,725 INFO L93 Difference]: Finished difference Result 640 states and 1013 transitions. [2019-09-10 02:36:21,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:36:21,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-10 02:36:21,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:21,763 INFO L225 Difference]: With dead ends: 640 [2019-09-10 02:36:21,764 INFO L226 Difference]: Without dead ends: 629 [2019-09-10 02:36:21,769 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:36:21,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-09-10 02:36:21,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-09-10 02:36:21,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-09-10 02:36:21,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1001 transitions. [2019-09-10 02:36:21,877 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 1001 transitions. Word has length 87 [2019-09-10 02:36:21,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:21,878 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 1001 transitions. [2019-09-10 02:36:21,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:36:21,878 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1001 transitions. [2019-09-10 02:36:21,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 02:36:21,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:21,884 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:36:21,884 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:21,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:21,885 INFO L82 PathProgramCache]: Analyzing trace with hash -217065445, now seen corresponding path program 1 times [2019-09-10 02:36:21,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:21,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:21,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:21,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:21,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:22,047 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:36:22,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:22,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:36:22,048 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:22,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:36:22,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:36:22,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:36:22,056 INFO L87 Difference]: Start difference. First operand 629 states and 1001 transitions. Second operand 4 states. [2019-09-10 02:36:22,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:22,170 INFO L93 Difference]: Finished difference Result 631 states and 1002 transitions. [2019-09-10 02:36:22,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:36:22,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-10 02:36:22,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:22,184 INFO L225 Difference]: With dead ends: 631 [2019-09-10 02:36:22,184 INFO L226 Difference]: Without dead ends: 629 [2019-09-10 02:36:22,185 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:36:22,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-09-10 02:36:22,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-09-10 02:36:22,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-09-10 02:36:22,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1000 transitions. [2019-09-10 02:36:22,256 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 1000 transitions. Word has length 90 [2019-09-10 02:36:22,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:22,258 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 1000 transitions. [2019-09-10 02:36:22,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:36:22,265 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1000 transitions. [2019-09-10 02:36:22,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 02:36:22,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:22,273 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:36:22,273 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:22,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:22,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1176241356, now seen corresponding path program 1 times [2019-09-10 02:36:22,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:22,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:22,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:22,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:22,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:22,493 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:36:22,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:22,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:36:22,495 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:22,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:36:22,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:36:22,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:36:22,497 INFO L87 Difference]: Start difference. First operand 629 states and 1000 transitions. Second operand 4 states. [2019-09-10 02:36:22,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:22,548 INFO L93 Difference]: Finished difference Result 631 states and 1001 transitions. [2019-09-10 02:36:22,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:36:22,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-10 02:36:22,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:22,553 INFO L225 Difference]: With dead ends: 631 [2019-09-10 02:36:22,554 INFO L226 Difference]: Without dead ends: 629 [2019-09-10 02:36:22,554 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:36:22,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-09-10 02:36:22,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-09-10 02:36:22,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-09-10 02:36:22,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 999 transitions. [2019-09-10 02:36:22,623 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 999 transitions. Word has length 91 [2019-09-10 02:36:22,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:22,624 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 999 transitions. [2019-09-10 02:36:22,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:36:22,624 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 999 transitions. [2019-09-10 02:36:22,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 02:36:22,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:22,628 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:36:22,629 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:22,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:22,629 INFO L82 PathProgramCache]: Analyzing trace with hash 21534647, now seen corresponding path program 1 times [2019-09-10 02:36:22,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:22,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:22,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:22,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:22,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:22,794 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:36:22,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:22,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:36:22,794 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:22,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:36:22,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:36:22,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:36:22,796 INFO L87 Difference]: Start difference. First operand 629 states and 999 transitions. Second operand 4 states. [2019-09-10 02:36:22,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:22,854 INFO L93 Difference]: Finished difference Result 631 states and 1000 transitions. [2019-09-10 02:36:22,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:36:22,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-09-10 02:36:22,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:22,866 INFO L225 Difference]: With dead ends: 631 [2019-09-10 02:36:22,867 INFO L226 Difference]: Without dead ends: 629 [2019-09-10 02:36:22,867 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:36:22,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-09-10 02:36:22,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-09-10 02:36:22,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-09-10 02:36:22,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 998 transitions. [2019-09-10 02:36:22,896 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 998 transitions. Word has length 92 [2019-09-10 02:36:22,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:22,898 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 998 transitions. [2019-09-10 02:36:22,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:36:22,898 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 998 transitions. [2019-09-10 02:36:22,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 02:36:22,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:22,907 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:36:22,907 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:22,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:22,907 INFO L82 PathProgramCache]: Analyzing trace with hash -634656752, now seen corresponding path program 1 times [2019-09-10 02:36:22,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:22,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:22,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:22,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:22,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:23,035 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:36:23,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:23,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:36:23,036 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:23,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:36:23,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:36:23,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:36:23,037 INFO L87 Difference]: Start difference. First operand 629 states and 998 transitions. Second operand 4 states. [2019-09-10 02:36:23,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:23,088 INFO L93 Difference]: Finished difference Result 631 states and 999 transitions. [2019-09-10 02:36:23,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:36:23,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-10 02:36:23,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:23,093 INFO L225 Difference]: With dead ends: 631 [2019-09-10 02:36:23,093 INFO L226 Difference]: Without dead ends: 629 [2019-09-10 02:36:23,094 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:36:23,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-09-10 02:36:23,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-09-10 02:36:23,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-09-10 02:36:23,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 997 transitions. [2019-09-10 02:36:23,115 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 997 transitions. Word has length 93 [2019-09-10 02:36:23,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:23,115 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 997 transitions. [2019-09-10 02:36:23,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:36:23,115 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 997 transitions. [2019-09-10 02:36:23,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 02:36:23,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:23,117 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:36:23,118 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:23,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:23,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1365704531, now seen corresponding path program 1 times [2019-09-10 02:36:23,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:23,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:23,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:23,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:23,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:23,303 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:36:23,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:23,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:36:23,304 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:23,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:36:23,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:36:23,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:36:23,307 INFO L87 Difference]: Start difference. First operand 629 states and 997 transitions. Second operand 10 states. [2019-09-10 02:36:23,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:23,455 INFO L93 Difference]: Finished difference Result 638 states and 1008 transitions. [2019-09-10 02:36:23,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:36:23,456 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-09-10 02:36:23,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:23,461 INFO L225 Difference]: With dead ends: 638 [2019-09-10 02:36:23,461 INFO L226 Difference]: Without dead ends: 638 [2019-09-10 02:36:23,462 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:36:23,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-09-10 02:36:23,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 636. [2019-09-10 02:36:23,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-09-10 02:36:23,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1006 transitions. [2019-09-10 02:36:23,492 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1006 transitions. Word has length 94 [2019-09-10 02:36:23,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:23,493 INFO L475 AbstractCegarLoop]: Abstraction has 636 states and 1006 transitions. [2019-09-10 02:36:23,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:36:23,493 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1006 transitions. [2019-09-10 02:36:23,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 02:36:23,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:23,496 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:36:23,497 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:23,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:23,497 INFO L82 PathProgramCache]: Analyzing trace with hash -564914574, now seen corresponding path program 1 times [2019-09-10 02:36:23,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:23,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:23,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:23,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:23,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:36:23,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:23,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:36:23,663 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:23,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:36:23,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:36:23,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:36:23,665 INFO L87 Difference]: Start difference. First operand 636 states and 1006 transitions. Second operand 4 states. [2019-09-10 02:36:23,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:23,718 INFO L93 Difference]: Finished difference Result 634 states and 1001 transitions. [2019-09-10 02:36:23,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:36:23,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-10 02:36:23,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:23,727 INFO L225 Difference]: With dead ends: 634 [2019-09-10 02:36:23,727 INFO L226 Difference]: Without dead ends: 623 [2019-09-10 02:36:23,727 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:36:23,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-09-10 02:36:23,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-09-10 02:36:23,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-09-10 02:36:23,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 983 transitions. [2019-09-10 02:36:23,747 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 983 transitions. Word has length 94 [2019-09-10 02:36:23,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:23,747 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 983 transitions. [2019-09-10 02:36:23,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:36:23,748 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 983 transitions. [2019-09-10 02:36:23,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 02:36:23,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:23,750 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:36:23,750 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:23,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:23,750 INFO L82 PathProgramCache]: Analyzing trace with hash -811237728, now seen corresponding path program 1 times [2019-09-10 02:36:23,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:23,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:23,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:23,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:23,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:23,875 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:36:23,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:23,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:36:23,875 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:23,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:36:23,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:36:23,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:36:23,876 INFO L87 Difference]: Start difference. First operand 623 states and 983 transitions. Second operand 6 states. [2019-09-10 02:36:24,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:24,076 INFO L93 Difference]: Finished difference Result 626 states and 986 transitions. [2019-09-10 02:36:24,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:36:24,077 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-09-10 02:36:24,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:24,081 INFO L225 Difference]: With dead ends: 626 [2019-09-10 02:36:24,082 INFO L226 Difference]: Without dead ends: 623 [2019-09-10 02:36:24,082 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:36:24,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-09-10 02:36:24,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-09-10 02:36:24,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-09-10 02:36:24,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 979 transitions. [2019-09-10 02:36:24,100 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 979 transitions. Word has length 95 [2019-09-10 02:36:24,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:24,101 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 979 transitions. [2019-09-10 02:36:24,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:36:24,101 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 979 transitions. [2019-09-10 02:36:24,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 02:36:24,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:24,103 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:36:24,103 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:24,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:24,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1457329514, now seen corresponding path program 1 times [2019-09-10 02:36:24,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:24,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:24,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:24,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:24,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:24,240 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:36:24,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:24,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:36:24,241 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:24,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:36:24,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:36:24,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:36:24,242 INFO L87 Difference]: Start difference. First operand 623 states and 979 transitions. Second operand 6 states. [2019-09-10 02:36:24,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:24,462 INFO L93 Difference]: Finished difference Result 626 states and 982 transitions. [2019-09-10 02:36:24,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:36:24,462 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-09-10 02:36:24,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:24,467 INFO L225 Difference]: With dead ends: 626 [2019-09-10 02:36:24,467 INFO L226 Difference]: Without dead ends: 623 [2019-09-10 02:36:24,468 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:36:24,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-09-10 02:36:24,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-09-10 02:36:24,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-09-10 02:36:24,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 975 transitions. [2019-09-10 02:36:24,486 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 975 transitions. Word has length 96 [2019-09-10 02:36:24,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:24,486 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 975 transitions. [2019-09-10 02:36:24,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:36:24,487 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 975 transitions. [2019-09-10 02:36:24,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 02:36:24,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:24,489 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:36:24,489 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:24,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:24,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1359647269, now seen corresponding path program 1 times [2019-09-10 02:36:24,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:24,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:24,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:24,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:24,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:24,609 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:36:24,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:24,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:36:24,609 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:24,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:36:24,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:36:24,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:36:24,611 INFO L87 Difference]: Start difference. First operand 623 states and 975 transitions. Second operand 6 states. [2019-09-10 02:36:24,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:24,803 INFO L93 Difference]: Finished difference Result 626 states and 978 transitions. [2019-09-10 02:36:24,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:36:24,804 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-09-10 02:36:24,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:24,808 INFO L225 Difference]: With dead ends: 626 [2019-09-10 02:36:24,809 INFO L226 Difference]: Without dead ends: 623 [2019-09-10 02:36:24,809 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:36:24,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-09-10 02:36:24,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-09-10 02:36:24,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-09-10 02:36:24,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 971 transitions. [2019-09-10 02:36:24,831 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 971 transitions. Word has length 97 [2019-09-10 02:36:24,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:24,831 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 971 transitions. [2019-09-10 02:36:24,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:36:24,832 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 971 transitions. [2019-09-10 02:36:24,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 02:36:24,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:24,834 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:36:24,834 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:24,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:24,834 INFO L82 PathProgramCache]: Analyzing trace with hash -969773403, now seen corresponding path program 1 times [2019-09-10 02:36:24,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:24,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:24,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:24,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:24,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:24,969 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:36:24,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:24,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:36:24,970 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:24,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:36:24,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:36:24,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:36:24,971 INFO L87 Difference]: Start difference. First operand 623 states and 971 transitions. Second operand 7 states. [2019-09-10 02:36:25,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:25,046 INFO L93 Difference]: Finished difference Result 626 states and 974 transitions. [2019-09-10 02:36:25,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:36:25,047 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-09-10 02:36:25,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:25,051 INFO L225 Difference]: With dead ends: 626 [2019-09-10 02:36:25,052 INFO L226 Difference]: Without dead ends: 602 [2019-09-10 02:36:25,053 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:36:25,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-09-10 02:36:25,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-09-10 02:36:25,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-09-10 02:36:25,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 937 transitions. [2019-09-10 02:36:25,077 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 937 transitions. Word has length 97 [2019-09-10 02:36:25,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:25,078 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 937 transitions. [2019-09-10 02:36:25,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:36:25,078 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 937 transitions. [2019-09-10 02:36:25,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 02:36:25,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:25,080 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:36:25,080 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:25,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:25,081 INFO L82 PathProgramCache]: Analyzing trace with hash -137400005, now seen corresponding path program 1 times [2019-09-10 02:36:25,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:25,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:25,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:25,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:25,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:25,215 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:36:25,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:25,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:36:25,215 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:25,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:36:25,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:36:25,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:36:25,217 INFO L87 Difference]: Start difference. First operand 602 states and 937 transitions. Second operand 6 states. [2019-09-10 02:36:25,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:25,309 INFO L93 Difference]: Finished difference Result 605 states and 940 transitions. [2019-09-10 02:36:25,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:36:25,310 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-09-10 02:36:25,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:25,315 INFO L225 Difference]: With dead ends: 605 [2019-09-10 02:36:25,315 INFO L226 Difference]: Without dead ends: 602 [2019-09-10 02:36:25,315 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:36:25,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-09-10 02:36:25,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-09-10 02:36:25,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-09-10 02:36:25,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 936 transitions. [2019-09-10 02:36:25,336 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 936 transitions. Word has length 98 [2019-09-10 02:36:25,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:25,337 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 936 transitions. [2019-09-10 02:36:25,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:36:25,337 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 936 transitions. [2019-09-10 02:36:25,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 02:36:25,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:25,339 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:36:25,340 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:25,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:25,340 INFO L82 PathProgramCache]: Analyzing trace with hash 2069760426, now seen corresponding path program 1 times [2019-09-10 02:36:25,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:25,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:25,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:25,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:25,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:25,517 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:36:25,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:25,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:36:25,518 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:25,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:36:25,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:36:25,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:36:25,520 INFO L87 Difference]: Start difference. First operand 602 states and 936 transitions. Second operand 6 states. [2019-09-10 02:36:25,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:25,607 INFO L93 Difference]: Finished difference Result 605 states and 939 transitions. [2019-09-10 02:36:25,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:36:25,608 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-09-10 02:36:25,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:25,612 INFO L225 Difference]: With dead ends: 605 [2019-09-10 02:36:25,612 INFO L226 Difference]: Without dead ends: 602 [2019-09-10 02:36:25,613 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:36:25,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-09-10 02:36:25,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-09-10 02:36:25,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-09-10 02:36:25,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 935 transitions. [2019-09-10 02:36:25,631 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 935 transitions. Word has length 99 [2019-09-10 02:36:25,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:25,631 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 935 transitions. [2019-09-10 02:36:25,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:36:25,632 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 935 transitions. [2019-09-10 02:36:25,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 02:36:25,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:25,634 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:36:25,634 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:25,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:25,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1151724576, now seen corresponding path program 1 times [2019-09-10 02:36:25,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:25,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:25,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:25,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:25,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:25,858 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:36:25,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:25,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 02:36:25,859 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:25,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:36:25,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:36:25,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:36:25,860 INFO L87 Difference]: Start difference. First operand 602 states and 935 transitions. Second operand 12 states. [2019-09-10 02:36:26,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:26,034 INFO L93 Difference]: Finished difference Result 606 states and 938 transitions. [2019-09-10 02:36:26,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:36:26,035 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 100 [2019-09-10 02:36:26,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:26,041 INFO L225 Difference]: With dead ends: 606 [2019-09-10 02:36:26,041 INFO L226 Difference]: Without dead ends: 602 [2019-09-10 02:36:26,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 02:36:26,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-09-10 02:36:26,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-09-10 02:36:26,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-09-10 02:36:26,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 934 transitions. [2019-09-10 02:36:26,072 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 934 transitions. Word has length 100 [2019-09-10 02:36:26,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:26,073 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 934 transitions. [2019-09-10 02:36:26,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:36:26,073 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 934 transitions. [2019-09-10 02:36:26,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 02:36:26,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:26,075 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:36:26,075 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:26,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:26,076 INFO L82 PathProgramCache]: Analyzing trace with hash 196339579, now seen corresponding path program 1 times [2019-09-10 02:36:26,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:26,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:26,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:26,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:26,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:26,300 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:36:26,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:26,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:36:26,301 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:26,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:36:26,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:36:26,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:36:26,303 INFO L87 Difference]: Start difference. First operand 602 states and 934 transitions. Second operand 10 states. [2019-09-10 02:36:33,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:33,513 INFO L93 Difference]: Finished difference Result 1240 states and 1967 transitions. [2019-09-10 02:36:33,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:36:33,514 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 101 [2019-09-10 02:36:33,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:33,523 INFO L225 Difference]: With dead ends: 1240 [2019-09-10 02:36:33,523 INFO L226 Difference]: Without dead ends: 1240 [2019-09-10 02:36:33,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 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:33,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2019-09-10 02:36:33,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 1210. [2019-09-10 02:36:33,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2019-09-10 02:36:33,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1927 transitions. [2019-09-10 02:36:33,563 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1927 transitions. Word has length 101 [2019-09-10 02:36:33,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:33,564 INFO L475 AbstractCegarLoop]: Abstraction has 1210 states and 1927 transitions. [2019-09-10 02:36:33,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:36:33,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1927 transitions. [2019-09-10 02:36:33,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 02:36:33,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:33,566 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] [2019-09-10 02:36:33,567 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:33,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:33,567 INFO L82 PathProgramCache]: Analyzing trace with hash 994116260, now seen corresponding path program 1 times [2019-09-10 02:36:33,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:33,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:33,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:33,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:33,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:33,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:33,722 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:36:33,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:33,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:36:33,725 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:33,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:36:33,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:36:33,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:36:33,727 INFO L87 Difference]: Start difference. First operand 1210 states and 1927 transitions. Second operand 10 states. [2019-09-10 02:36:40,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:40,764 INFO L93 Difference]: Finished difference Result 2629 states and 4271 transitions. [2019-09-10 02:36:40,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:36:40,765 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 102 [2019-09-10 02:36:40,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:40,785 INFO L225 Difference]: With dead ends: 2629 [2019-09-10 02:36:40,786 INFO L226 Difference]: Without dead ends: 2629 [2019-09-10 02:36:40,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 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,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2019-09-10 02:36:40,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2588. [2019-09-10 02:36:40,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2588 states. [2019-09-10 02:36:40,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2588 states to 2588 states and 4209 transitions. [2019-09-10 02:36:40,935 INFO L78 Accepts]: Start accepts. Automaton has 2588 states and 4209 transitions. Word has length 102 [2019-09-10 02:36:40,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:40,935 INFO L475 AbstractCegarLoop]: Abstraction has 2588 states and 4209 transitions. [2019-09-10 02:36:40,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:36:40,936 INFO L276 IsEmpty]: Start isEmpty. Operand 2588 states and 4209 transitions. [2019-09-10 02:36:40,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 02:36:40,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:40,938 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] [2019-09-10 02:36:40,938 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:40,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:40,939 INFO L82 PathProgramCache]: Analyzing trace with hash 800793247, now seen corresponding path program 1 times [2019-09-10 02:36:40,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:40,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:40,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:40,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:40,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:41,107 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:36:41,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:41,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:36:41,108 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:41,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:36:41,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:36:41,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:36:41,109 INFO L87 Difference]: Start difference. First operand 2588 states and 4209 transitions. Second operand 10 states. [2019-09-10 02:36:47,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:47,627 INFO L93 Difference]: Finished difference Result 5871 states and 9765 transitions. [2019-09-10 02:36:47,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:36:47,634 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2019-09-10 02:36:47,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:47,674 INFO L225 Difference]: With dead ends: 5871 [2019-09-10 02:36:47,674 INFO L226 Difference]: Without dead ends: 5871 [2019-09-10 02:36:47,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 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:47,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5871 states. [2019-09-10 02:36:47,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5871 to 5808. [2019-09-10 02:36:47,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5808 states. [2019-09-10 02:36:47,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5808 states to 5808 states and 9647 transitions. [2019-09-10 02:36:47,950 INFO L78 Accepts]: Start accepts. Automaton has 5808 states and 9647 transitions. Word has length 103 [2019-09-10 02:36:47,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:47,951 INFO L475 AbstractCegarLoop]: Abstraction has 5808 states and 9647 transitions. [2019-09-10 02:36:47,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:36:47,951 INFO L276 IsEmpty]: Start isEmpty. Operand 5808 states and 9647 transitions. [2019-09-10 02:36:47,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 02:36:47,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:47,953 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] [2019-09-10 02:36:47,953 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:47,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:47,954 INFO L82 PathProgramCache]: Analyzing trace with hash -51849208, now seen corresponding path program 1 times [2019-09-10 02:36:47,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:47,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:47,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:47,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:47,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:48,097 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:36:48,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:48,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:36:48,098 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:48,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:36:48,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:36:48,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:36:48,099 INFO L87 Difference]: Start difference. First operand 5808 states and 9647 transitions. Second operand 10 states. [2019-09-10 02:36:54,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:54,968 INFO L93 Difference]: Finished difference Result 13738 states and 23496 transitions. [2019-09-10 02:36:54,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:36:54,968 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2019-09-10 02:36:54,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:55,091 INFO L225 Difference]: With dead ends: 13738 [2019-09-10 02:36:55,092 INFO L226 Difference]: Without dead ends: 13738 [2019-09-10 02:36:55,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 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:55,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13738 states. [2019-09-10 02:36:55,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13738 to 13631. [2019-09-10 02:36:55,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13631 states. [2019-09-10 02:36:55,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13631 states to 13631 states and 23218 transitions. [2019-09-10 02:36:55,685 INFO L78 Accepts]: Start accepts. Automaton has 13631 states and 23218 transitions. Word has length 104 [2019-09-10 02:36:55,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:55,686 INFO L475 AbstractCegarLoop]: Abstraction has 13631 states and 23218 transitions. [2019-09-10 02:36:55,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:36:55,686 INFO L276 IsEmpty]: Start isEmpty. Operand 13631 states and 23218 transitions. [2019-09-10 02:36:55,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 02:36:55,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:55,688 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] [2019-09-10 02:36:55,688 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:55,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:55,689 INFO L82 PathProgramCache]: Analyzing trace with hash 131442115, now seen corresponding path program 1 times [2019-09-10 02:36:55,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:55,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:55,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:55,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:55,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:55,828 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:36:55,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:55,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:36:55,829 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:55,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:36:55,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:36:55,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:36:55,832 INFO L87 Difference]: Start difference. First operand 13631 states and 23218 transitions. Second operand 10 states. [2019-09-10 02:37:04,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:04,301 INFO L93 Difference]: Finished difference Result 33776 states and 59914 transitions. [2019-09-10 02:37:04,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:37:04,301 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-09-10 02:37:04,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:04,558 INFO L225 Difference]: With dead ends: 33776 [2019-09-10 02:37:04,558 INFO L226 Difference]: Without dead ends: 33776 [2019-09-10 02:37:04,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 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:04,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33776 states. [2019-09-10 02:37:05,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33776 to 33581. [2019-09-10 02:37:05,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33581 states. [2019-09-10 02:37:07,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33581 states to 33581 states and 59124 transitions. [2019-09-10 02:37:07,293 INFO L78 Accepts]: Start accepts. Automaton has 33581 states and 59124 transitions. Word has length 105 [2019-09-10 02:37:07,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:07,294 INFO L475 AbstractCegarLoop]: Abstraction has 33581 states and 59124 transitions. [2019-09-10 02:37:07,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:37:07,294 INFO L276 IsEmpty]: Start isEmpty. Operand 33581 states and 59124 transitions. [2019-09-10 02:37:07,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 02:37:07,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:07,296 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] [2019-09-10 02:37:07,296 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:07,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:07,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1931057812, now seen corresponding path program 1 times [2019-09-10 02:37:07,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:07,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:07,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:07,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:07,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:07,426 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:37:07,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:07,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:37:07,426 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:07,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:37:07,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:37:07,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:37:07,428 INFO L87 Difference]: Start difference. First operand 33581 states and 59124 transitions. Second operand 10 states. [2019-09-10 02:37:15,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:15,989 INFO L93 Difference]: Finished difference Result 87855 states and 163839 transitions. [2019-09-10 02:37:15,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:37:15,990 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-09-10 02:37:15,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:16,658 INFO L225 Difference]: With dead ends: 87855 [2019-09-10 02:37:16,658 INFO L226 Difference]: Without dead ends: 87855 [2019-09-10 02:37:16,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 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:16,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87855 states. [2019-09-10 02:37:21,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87855 to 87484. [2019-09-10 02:37:21,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87484 states. [2019-09-10 02:37:22,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87484 states to 87484 states and 161257 transitions. [2019-09-10 02:37:22,351 INFO L78 Accepts]: Start accepts. Automaton has 87484 states and 161257 transitions. Word has length 106 [2019-09-10 02:37:22,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:22,351 INFO L475 AbstractCegarLoop]: Abstraction has 87484 states and 161257 transitions. [2019-09-10 02:37:22,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:37:22,351 INFO L276 IsEmpty]: Start isEmpty. Operand 87484 states and 161257 transitions. [2019-09-10 02:37:22,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 02:37:22,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:22,353 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] [2019-09-10 02:37:22,353 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:22,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:22,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1719706899, now seen corresponding path program 1 times [2019-09-10 02:37:22,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:22,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:22,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:22,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:22,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:22,443 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:37:22,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:22,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:37:22,444 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:22,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:37:22,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:37:22,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:37:22,445 INFO L87 Difference]: Start difference. First operand 87484 states and 161257 transitions. Second operand 3 states. [2019-09-10 02:37:27,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:27,342 INFO L93 Difference]: Finished difference Result 174893 states and 361451 transitions. [2019-09-10 02:37:27,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:37:27,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 02:37:27,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:29,128 INFO L225 Difference]: With dead ends: 174893 [2019-09-10 02:37:29,128 INFO L226 Difference]: Without dead ends: 174893 [2019-09-10 02:37:29,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:37:29,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174893 states. [2019-09-10 02:37:35,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174893 to 174891. [2019-09-10 02:37:35,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174891 states. [2019-09-10 02:37:44,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174891 states to 174891 states and 361450 transitions. [2019-09-10 02:37:44,861 INFO L78 Accepts]: Start accepts. Automaton has 174891 states and 361450 transitions. Word has length 106 [2019-09-10 02:37:44,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:44,861 INFO L475 AbstractCegarLoop]: Abstraction has 174891 states and 361450 transitions. [2019-09-10 02:37:44,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:37:44,861 INFO L276 IsEmpty]: Start isEmpty. Operand 174891 states and 361450 transitions. [2019-09-10 02:37:44,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 02:37:44,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:44,863 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] [2019-09-10 02:37:44,863 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:44,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:44,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1772620946, now seen corresponding path program 1 times [2019-09-10 02:37:44,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:44,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:44,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:44,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:44,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:44,993 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:37:44,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:44,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:37:44,994 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:44,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:37:44,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:37:44,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:37:44,995 INFO L87 Difference]: Start difference. First operand 174891 states and 361450 transitions. Second operand 3 states. [2019-09-10 02:37:59,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:59,649 INFO L93 Difference]: Finished difference Result 349709 states and 845158 transitions. [2019-09-10 02:37:59,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:37:59,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-10 02:37:59,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:03,315 INFO L225 Difference]: With dead ends: 349709 [2019-09-10 02:38:03,316 INFO L226 Difference]: Without dead ends: 349709 [2019-09-10 02:38:03,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:38:03,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349709 states. [2019-09-10 02:38:23,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349709 to 349706. [2019-09-10 02:38:23,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349706 states. [2019-09-10 02:38:48,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349706 states to 349706 states and 845156 transitions. [2019-09-10 02:38:48,867 INFO L78 Accepts]: Start accepts. Automaton has 349706 states and 845156 transitions. Word has length 107 [2019-09-10 02:38:48,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:48,868 INFO L475 AbstractCegarLoop]: Abstraction has 349706 states and 845156 transitions. [2019-09-10 02:38:48,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:38:48,868 INFO L276 IsEmpty]: Start isEmpty. Operand 349706 states and 845156 transitions. [2019-09-10 02:38:48,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 02:38:48,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:48,869 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] [2019-09-10 02:38:48,870 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:48,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:48,870 INFO L82 PathProgramCache]: Analyzing trace with hash 882014799, now seen corresponding path program 1 times [2019-09-10 02:38:48,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:48,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:48,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:48,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:48,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:48,977 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:38:48,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:48,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:38:48,978 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:48,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:38:48,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:38:48,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:38:48,979 INFO L87 Difference]: Start difference. First operand 349706 states and 845156 transitions. Second operand 3 states. [2019-09-10 02:39:26,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:39:26,248 INFO L93 Difference]: Finished difference Result 699341 states and 2084187 transitions. [2019-09-10 02:39:26,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:39:26,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-10 02:39:26,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:39:49,204 INFO L225 Difference]: With dead ends: 699341 [2019-09-10 02:39:49,205 INFO L226 Difference]: Without dead ends: 699341 [2019-09-10 02:39:49,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:39:49,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699341 states.