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_spec14_product19.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:30:01,812 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:30:01,815 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:30:01,831 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:30:01,832 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:30:01,833 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:30:01,835 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:30:01,847 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:30:01,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:30:01,850 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:30:01,853 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:30:01,855 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:30:01,855 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:30:01,858 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:30:01,860 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:30:01,861 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:30:01,863 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:30:01,867 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:30:01,868 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:30:01,870 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:30:01,872 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:30:01,874 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:30:01,877 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:30:01,878 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:30:01,881 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:30:01,881 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:30:01,881 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:30:01,884 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:30:01,885 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:30:01,887 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:30:01,887 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:30:01,889 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:30:01,890 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:30:01,891 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:30:01,895 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:30:01,895 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:30:01,896 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:30:01,896 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:30:01,896 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:30:01,897 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:30:01,897 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:30:01,899 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:30:01,922 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:30:01,922 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:30:01,925 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:30:01,925 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:30:01,925 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:30:01,926 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:30:01,926 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:30:01,926 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:30:01,926 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:30:01,926 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:30:01,928 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:30:01,929 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:30:01,929 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:30:01,929 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:30:01,930 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:30:01,930 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:30:01,930 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:30:01,930 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:30:01,930 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:30:01,930 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:30:01,931 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:30:01,931 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:30:01,931 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:30:01,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:30:01,931 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:30:01,932 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:30:01,932 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:30:01,932 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:30:01,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:30:01,932 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:30:01,985 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:30:01,997 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:30:02,000 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:30:02,001 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:30:02,002 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:30:02,002 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_product19.cil.c [2019-09-10 02:30:02,062 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d52b3f45/f9ecd5aeade14bfc8ca3ca513a4f8c51/FLAG8fba6b0f1 [2019-09-10 02:30:02,640 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:30:02,641 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_product19.cil.c [2019-09-10 02:30:02,662 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d52b3f45/f9ecd5aeade14bfc8ca3ca513a4f8c51/FLAG8fba6b0f1 [2019-09-10 02:30:02,906 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d52b3f45/f9ecd5aeade14bfc8ca3ca513a4f8c51 [2019-09-10 02:30:02,914 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:30:02,915 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:30:02,917 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:30:02,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:30:02,920 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:30:02,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:30:02" (1/1) ... [2019-09-10 02:30:02,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ebbcfaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:30:02, skipping insertion in model container [2019-09-10 02:30:02,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:30:02" (1/1) ... [2019-09-10 02:30:02,930 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:30:02,998 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:30:03,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:30:03,610 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:30:03,765 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:30:03,831 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:30:03,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:30:03 WrapperNode [2019-09-10 02:30:03,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:30:03,833 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:30:03,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:30:03,833 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:30:03,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:30:03" (1/1) ... [2019-09-10 02:30:03,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:30:03" (1/1) ... [2019-09-10 02:30:03,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:30:03" (1/1) ... [2019-09-10 02:30:03,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:30:03" (1/1) ... [2019-09-10 02:30:03,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:30:03" (1/1) ... [2019-09-10 02:30:04,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:30:03" (1/1) ... [2019-09-10 02:30:04,019 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:30:03" (1/1) ... [2019-09-10 02:30:04,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:30:04,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:30:04,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:30:04,046 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:30:04,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:30:03" (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:30:04,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:30:04,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:30:04,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:30:04,114 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-10 02:30:04,114 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-10 02:30:04,115 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-10 02:30:04,115 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-10 02:30:04,115 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-10 02:30:04,115 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-10 02:30:04,116 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-10 02:30:04,116 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-10 02:30:04,116 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-10 02:30:04,116 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-10 02:30:04,117 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-10 02:30:04,117 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-10 02:30:04,117 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-10 02:30:04,117 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-10 02:30:04,118 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-10 02:30:04,118 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-10 02:30:04,118 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-09-10 02:30:04,118 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-10 02:30:04,118 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-10 02:30:04,118 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-10 02:30:04,119 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-09-10 02:30:04,119 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-10 02:30:04,119 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-10 02:30:04,119 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-10 02:30:04,119 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-10 02:30:04,120 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-10 02:30:04,120 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-10 02:30:04,120 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-09-10 02:30:04,120 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-09-10 02:30:04,121 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-10 02:30:04,121 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-10 02:30:04,121 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-09-10 02:30:04,121 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:30:04,122 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:30:04,122 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:30:04,122 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:30:04,122 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:30:04,122 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:30:04,123 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:30:04,123 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:30:04,123 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:30:04,123 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:30:04,123 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:30:04,124 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-10 02:30:04,124 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-10 02:30:04,124 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-10 02:30:04,124 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:30:04,125 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-10 02:30:04,125 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-10 02:30:04,125 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-10 02:30:04,125 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-10 02:30:04,126 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-10 02:30:04,126 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-10 02:30:04,126 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-10 02:30:04,127 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-10 02:30:04,127 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-10 02:30:04,127 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-10 02:30:04,127 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-10 02:30:04,127 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-10 02:30:04,128 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-10 02:30:04,128 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-10 02:30:04,128 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:30:04,128 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-10 02:30:04,129 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:30:04,129 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-10 02:30:04,129 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-10 02:30:04,129 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-10 02:30:04,129 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-10 02:30:04,130 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-10 02:30:04,130 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-10 02:30:04,130 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-10 02:30:04,130 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-10 02:30:04,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:30:04,131 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:30:04,131 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:30:04,131 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-10 02:30:04,131 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-10 02:30:04,131 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-10 02:30:04,132 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-10 02:30:04,132 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-10 02:30:04,132 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-10 02:30:04,132 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-10 02:30:04,132 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-10 02:30:04,133 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-10 02:30:04,133 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-10 02:30:04,133 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-10 02:30:04,133 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-10 02:30:04,133 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-10 02:30:04,134 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-10 02:30:04,134 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-10 02:30:04,134 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-10 02:30:04,134 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-10 02:30:04,134 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-10 02:30:04,134 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-10 02:30:04,135 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-10 02:30:04,135 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-09-10 02:30:04,135 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-09-10 02:30:04,135 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-10 02:30:04,135 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-10 02:30:04,136 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-10 02:30:04,136 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-10 02:30:04,136 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-10 02:30:04,136 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-10 02:30:04,137 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-10 02:30:04,137 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-09-10 02:30:04,137 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-10 02:30:04,137 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-10 02:30:04,138 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-09-10 02:30:04,138 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-10 02:30:04,138 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-10 02:30:04,138 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-10 02:30:04,138 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-09-10 02:30:04,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:30:04,139 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-10 02:30:04,139 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-10 02:30:04,139 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-10 02:30:04,139 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-10 02:30:04,140 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-10 02:30:04,140 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:30:04,140 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-10 02:30:04,140 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-10 02:30:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-10 02:30:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-10 02:30:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:30:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:30:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:30:04,142 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:30:04,142 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:30:04,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:30:04,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:30:04,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:30:04,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:30:04,143 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:30:04,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:30:04,144 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:30:04,144 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:30:04,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:30:04,144 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:30:04,144 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:30:04,145 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:30:04,145 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:30:04,145 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:30:04,145 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:30:04,145 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:30:04,145 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-10 02:30:04,146 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-10 02:30:04,146 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-10 02:30:04,146 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-10 02:30:04,146 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-10 02:30:04,147 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-10 02:30:04,147 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-10 02:30:04,147 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-10 02:30:04,147 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-10 02:30:04,147 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-10 02:30:04,148 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-10 02:30:04,148 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:30:04,148 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-10 02:30:04,148 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:30:04,148 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-10 02:30:04,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:30:04,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:30:04,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:30:06,262 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:30:06,262 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-10 02:30:06,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:30:06 BoogieIcfgContainer [2019-09-10 02:30:06,264 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:30:06,265 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:30:06,265 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:30:06,268 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:30:06,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:30:02" (1/3) ... [2019-09-10 02:30:06,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec522df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:30:06, skipping insertion in model container [2019-09-10 02:30:06,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:30:03" (2/3) ... [2019-09-10 02:30:06,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec522df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:30:06, skipping insertion in model container [2019-09-10 02:30:06,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:30:06" (3/3) ... [2019-09-10 02:30:06,271 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product19.cil.c [2019-09-10 02:30:06,281 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:30:06,292 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:30:06,308 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:30:06,339 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:30:06,339 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:30:06,339 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:30:06,340 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:30:06,340 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:30:06,340 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:30:06,340 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:30:06,340 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:30:06,381 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states. [2019-09-10 02:30:06,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 02:30:06,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:06,423 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:06,425 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:06,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:06,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1411507135, now seen corresponding path program 1 times [2019-09-10 02:30:06,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:06,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:06,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:06,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:06,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:06,960 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:30:06,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:06,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:30:06,962 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:06,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:30:06,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:30:06,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:30:06,986 INFO L87 Difference]: Start difference. First operand 735 states. Second operand 4 states. [2019-09-10 02:30:07,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:07,172 INFO L93 Difference]: Finished difference Result 598 states and 942 transitions. [2019-09-10 02:30:07,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:30:07,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-09-10 02:30:07,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:07,204 INFO L225 Difference]: With dead ends: 598 [2019-09-10 02:30:07,205 INFO L226 Difference]: Without dead ends: 587 [2019-09-10 02:30:07,206 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:30:07,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-09-10 02:30:07,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-09-10 02:30:07,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-09-10 02:30:07,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 928 transitions. [2019-09-10 02:30:07,445 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 928 transitions. Word has length 135 [2019-09-10 02:30:07,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:07,445 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 928 transitions. [2019-09-10 02:30:07,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:30:07,446 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 928 transitions. [2019-09-10 02:30:07,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 02:30:07,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:07,455 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:07,455 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:07,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:07,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1349279833, now seen corresponding path program 1 times [2019-09-10 02:30:07,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:07,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:07,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:07,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:07,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:07,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:07,634 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:30:07,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:07,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:30:07,635 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:07,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:30:07,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:30:07,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:30:07,637 INFO L87 Difference]: Start difference. First operand 587 states and 928 transitions. Second operand 4 states. [2019-09-10 02:30:07,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:07,732 INFO L93 Difference]: Finished difference Result 589 states and 929 transitions. [2019-09-10 02:30:07,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:30:07,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-09-10 02:30:07,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:07,748 INFO L225 Difference]: With dead ends: 589 [2019-09-10 02:30:07,748 INFO L226 Difference]: Without dead ends: 587 [2019-09-10 02:30:07,749 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:30:07,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-09-10 02:30:07,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-09-10 02:30:07,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-09-10 02:30:07,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 927 transitions. [2019-09-10 02:30:07,812 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 927 transitions. Word has length 136 [2019-09-10 02:30:07,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:07,815 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 927 transitions. [2019-09-10 02:30:07,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:30:07,815 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 927 transitions. [2019-09-10 02:30:07,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 02:30:07,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:07,824 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:07,828 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:07,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:07,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1382966461, now seen corresponding path program 1 times [2019-09-10 02:30:07,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:07,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:07,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:07,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:07,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:08,041 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:30:08,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:08,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:30:08,043 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:08,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:30:08,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:30:08,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:30:08,047 INFO L87 Difference]: Start difference. First operand 587 states and 927 transitions. Second operand 4 states. [2019-09-10 02:30:08,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:08,121 INFO L93 Difference]: Finished difference Result 589 states and 928 transitions. [2019-09-10 02:30:08,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:30:08,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-09-10 02:30:08,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:08,129 INFO L225 Difference]: With dead ends: 589 [2019-09-10 02:30:08,129 INFO L226 Difference]: Without dead ends: 587 [2019-09-10 02:30:08,129 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:30:08,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-09-10 02:30:08,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-09-10 02:30:08,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-09-10 02:30:08,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 926 transitions. [2019-09-10 02:30:08,161 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 926 transitions. Word has length 137 [2019-09-10 02:30:08,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:08,162 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 926 transitions. [2019-09-10 02:30:08,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:30:08,162 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 926 transitions. [2019-09-10 02:30:08,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 02:30:08,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:08,168 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:08,169 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:08,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:08,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1519078827, now seen corresponding path program 1 times [2019-09-10 02:30:08,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:08,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:08,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:08,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:08,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:08,361 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:30:08,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:08,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:30:08,362 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:08,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:30:08,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:30:08,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:30:08,364 INFO L87 Difference]: Start difference. First operand 587 states and 926 transitions. Second operand 4 states. [2019-09-10 02:30:08,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:08,426 INFO L93 Difference]: Finished difference Result 589 states and 927 transitions. [2019-09-10 02:30:08,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:30:08,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-10 02:30:08,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:08,432 INFO L225 Difference]: With dead ends: 589 [2019-09-10 02:30:08,433 INFO L226 Difference]: Without dead ends: 587 [2019-09-10 02:30:08,433 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:30:08,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-09-10 02:30:08,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-09-10 02:30:08,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-09-10 02:30:08,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 925 transitions. [2019-09-10 02:30:08,460 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 925 transitions. Word has length 138 [2019-09-10 02:30:08,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:08,460 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 925 transitions. [2019-09-10 02:30:08,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:30:08,461 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 925 transitions. [2019-09-10 02:30:08,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 02:30:08,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:08,466 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:08,466 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:08,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:08,466 INFO L82 PathProgramCache]: Analyzing trace with hash -939532999, now seen corresponding path program 1 times [2019-09-10 02:30:08,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:08,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:08,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:08,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:08,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:08,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:08,601 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:30:08,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:08,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:30:08,602 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:08,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:30:08,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:30:08,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:30:08,603 INFO L87 Difference]: Start difference. First operand 587 states and 925 transitions. Second operand 4 states. [2019-09-10 02:30:08,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:08,653 INFO L93 Difference]: Finished difference Result 589 states and 926 transitions. [2019-09-10 02:30:08,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:30:08,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-09-10 02:30:08,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:08,659 INFO L225 Difference]: With dead ends: 589 [2019-09-10 02:30:08,659 INFO L226 Difference]: Without dead ends: 587 [2019-09-10 02:30:08,659 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:30:08,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-09-10 02:30:08,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-09-10 02:30:08,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-09-10 02:30:08,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 924 transitions. [2019-09-10 02:30:08,679 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 924 transitions. Word has length 139 [2019-09-10 02:30:08,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:08,680 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 924 transitions. [2019-09-10 02:30:08,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:30:08,680 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 924 transitions. [2019-09-10 02:30:08,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 02:30:08,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:08,684 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:08,684 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:08,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:08,685 INFO L82 PathProgramCache]: Analyzing trace with hash 195155025, now seen corresponding path program 1 times [2019-09-10 02:30:08,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:08,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:08,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:08,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:08,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:08,853 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:30:08,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:08,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:30:08,854 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:08,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:30:08,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:30:08,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:30:08,858 INFO L87 Difference]: Start difference. First operand 587 states and 924 transitions. Second operand 10 states. [2019-09-10 02:30:09,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:09,016 INFO L93 Difference]: Finished difference Result 596 states and 936 transitions. [2019-09-10 02:30:09,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:30:09,018 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-09-10 02:30:09,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:09,023 INFO L225 Difference]: With dead ends: 596 [2019-09-10 02:30:09,023 INFO L226 Difference]: Without dead ends: 596 [2019-09-10 02:30:09,023 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:30:09,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-09-10 02:30:09,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 594. [2019-09-10 02:30:09,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-09-10 02:30:09,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 934 transitions. [2019-09-10 02:30:09,051 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 934 transitions. Word has length 140 [2019-09-10 02:30:09,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:09,051 INFO L475 AbstractCegarLoop]: Abstraction has 594 states and 934 transitions. [2019-09-10 02:30:09,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:30:09,052 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 934 transitions. [2019-09-10 02:30:09,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 02:30:09,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:09,057 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:09,058 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:09,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:09,058 INFO L82 PathProgramCache]: Analyzing trace with hash -791427664, now seen corresponding path program 1 times [2019-09-10 02:30:09,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:09,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:09,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:09,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:09,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:09,215 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:30:09,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:09,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:30:09,215 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:09,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:30:09,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:30:09,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:30:09,216 INFO L87 Difference]: Start difference. First operand 594 states and 934 transitions. Second operand 4 states. [2019-09-10 02:30:09,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:09,274 INFO L93 Difference]: Finished difference Result 592 states and 929 transitions. [2019-09-10 02:30:09,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:30:09,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-10 02:30:09,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:09,281 INFO L225 Difference]: With dead ends: 592 [2019-09-10 02:30:09,282 INFO L226 Difference]: Without dead ends: 590 [2019-09-10 02:30:09,282 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:30:09,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-09-10 02:30:09,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-09-10 02:30:09,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-10 02:30:09,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 927 transitions. [2019-09-10 02:30:09,301 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 927 transitions. Word has length 140 [2019-09-10 02:30:09,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:09,302 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 927 transitions. [2019-09-10 02:30:09,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:30:09,302 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 927 transitions. [2019-09-10 02:30:09,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 02:30:09,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:09,306 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:09,306 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:09,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:09,307 INFO L82 PathProgramCache]: Analyzing trace with hash -306965809, now seen corresponding path program 1 times [2019-09-10 02:30:09,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:09,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:09,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:09,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:09,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:09,439 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:30:09,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:09,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:30:09,440 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:09,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:30:09,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:30:09,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:30:09,441 INFO L87 Difference]: Start difference. First operand 590 states and 927 transitions. Second operand 6 states. [2019-09-10 02:30:09,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:09,806 INFO L93 Difference]: Finished difference Result 607 states and 948 transitions. [2019-09-10 02:30:09,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:30:09,806 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-09-10 02:30:09,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:09,815 INFO L225 Difference]: With dead ends: 607 [2019-09-10 02:30:09,816 INFO L226 Difference]: Without dead ends: 598 [2019-09-10 02:30:09,816 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:30:09,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-09-10 02:30:09,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 595. [2019-09-10 02:30:09,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-09-10 02:30:09,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 928 transitions. [2019-09-10 02:30:09,851 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 928 transitions. Word has length 141 [2019-09-10 02:30:09,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:09,852 INFO L475 AbstractCegarLoop]: Abstraction has 595 states and 928 transitions. [2019-09-10 02:30:09,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:30:09,852 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 928 transitions. [2019-09-10 02:30:09,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 02:30:09,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:09,859 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:09,859 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:09,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:09,860 INFO L82 PathProgramCache]: Analyzing trace with hash 394745588, now seen corresponding path program 1 times [2019-09-10 02:30:09,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:09,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:09,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:09,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:09,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:10,038 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:30:10,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:10,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:30:10,038 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:10,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:30:10,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:30:10,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:30:10,040 INFO L87 Difference]: Start difference. First operand 595 states and 928 transitions. Second operand 6 states. [2019-09-10 02:30:10,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:10,267 INFO L93 Difference]: Finished difference Result 598 states and 931 transitions. [2019-09-10 02:30:10,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:30:10,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-09-10 02:30:10,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:10,274 INFO L225 Difference]: With dead ends: 598 [2019-09-10 02:30:10,274 INFO L226 Difference]: Without dead ends: 595 [2019-09-10 02:30:10,275 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:30:10,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-09-10 02:30:10,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2019-09-10 02:30:10,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-09-10 02:30:10,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 924 transitions. [2019-09-10 02:30:10,333 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 924 transitions. Word has length 142 [2019-09-10 02:30:10,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:10,334 INFO L475 AbstractCegarLoop]: Abstraction has 595 states and 924 transitions. [2019-09-10 02:30:10,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:30:10,334 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 924 transitions. [2019-09-10 02:30:10,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:30:10,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:10,338 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:10,338 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:10,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:10,339 INFO L82 PathProgramCache]: Analyzing trace with hash -447409932, now seen corresponding path program 1 times [2019-09-10 02:30:10,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:10,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:10,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:10,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:10,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:10,452 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:30:10,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:10,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:30:10,453 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:10,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:30:10,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:30:10,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:30:10,455 INFO L87 Difference]: Start difference. First operand 595 states and 924 transitions. Second operand 6 states. [2019-09-10 02:30:10,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:10,663 INFO L93 Difference]: Finished difference Result 598 states and 927 transitions. [2019-09-10 02:30:10,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:30:10,664 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-10 02:30:10,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:10,668 INFO L225 Difference]: With dead ends: 598 [2019-09-10 02:30:10,668 INFO L226 Difference]: Without dead ends: 595 [2019-09-10 02:30:10,669 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:30:10,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-09-10 02:30:10,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2019-09-10 02:30:10,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-09-10 02:30:10,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 920 transitions. [2019-09-10 02:30:10,688 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 920 transitions. Word has length 143 [2019-09-10 02:30:10,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:10,688 INFO L475 AbstractCegarLoop]: Abstraction has 595 states and 920 transitions. [2019-09-10 02:30:10,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:30:10,688 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 920 transitions. [2019-09-10 02:30:10,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:30:10,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:10,692 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:10,692 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:10,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:10,693 INFO L82 PathProgramCache]: Analyzing trace with hash -170078860, now seen corresponding path program 1 times [2019-09-10 02:30:10,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:10,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:10,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:10,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:10,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:10,806 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:30:10,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:10,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:30:10,807 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:10,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:30:10,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:30:10,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:30:10,809 INFO L87 Difference]: Start difference. First operand 595 states and 920 transitions. Second operand 7 states. [2019-09-10 02:30:10,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:10,906 INFO L93 Difference]: Finished difference Result 601 states and 927 transitions. [2019-09-10 02:30:10,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:30:10,907 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-09-10 02:30:10,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:10,912 INFO L225 Difference]: With dead ends: 601 [2019-09-10 02:30:10,912 INFO L226 Difference]: Without dead ends: 577 [2019-09-10 02:30:10,913 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:30:10,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-09-10 02:30:10,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 574. [2019-09-10 02:30:10,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-09-10 02:30:10,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 883 transitions. [2019-09-10 02:30:10,933 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 883 transitions. Word has length 143 [2019-09-10 02:30:10,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:10,933 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 883 transitions. [2019-09-10 02:30:10,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:30:10,933 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 883 transitions. [2019-09-10 02:30:10,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 02:30:10,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:10,938 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:10,938 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:10,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:10,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1904799623, now seen corresponding path program 1 times [2019-09-10 02:30:10,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:10,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:10,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:10,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:10,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:11,059 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:30:11,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:11,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:30:11,060 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:11,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:30:11,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:30:11,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:30:11,062 INFO L87 Difference]: Start difference. First operand 574 states and 883 transitions. Second operand 6 states. [2019-09-10 02:30:11,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:11,187 INFO L93 Difference]: Finished difference Result 577 states and 886 transitions. [2019-09-10 02:30:11,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:30:11,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-09-10 02:30:11,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:11,192 INFO L225 Difference]: With dead ends: 577 [2019-09-10 02:30:11,192 INFO L226 Difference]: Without dead ends: 574 [2019-09-10 02:30:11,193 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:30:11,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-09-10 02:30:11,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-09-10 02:30:11,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-09-10 02:30:11,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 882 transitions. [2019-09-10 02:30:11,211 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 882 transitions. Word has length 144 [2019-09-10 02:30:11,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:11,211 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 882 transitions. [2019-09-10 02:30:11,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:30:11,211 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 882 transitions. [2019-09-10 02:30:11,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 02:30:11,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:11,215 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:11,215 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:11,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:11,216 INFO L82 PathProgramCache]: Analyzing trace with hash -959612135, now seen corresponding path program 1 times [2019-09-10 02:30:11,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:11,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:11,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:11,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:11,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:11,365 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:30:11,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:11,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:30:11,365 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:11,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:30:11,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:30:11,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:30:11,366 INFO L87 Difference]: Start difference. First operand 574 states and 882 transitions. Second operand 6 states. [2019-09-10 02:30:11,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:11,502 INFO L93 Difference]: Finished difference Result 577 states and 885 transitions. [2019-09-10 02:30:11,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:30:11,503 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-09-10 02:30:11,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:11,508 INFO L225 Difference]: With dead ends: 577 [2019-09-10 02:30:11,508 INFO L226 Difference]: Without dead ends: 574 [2019-09-10 02:30:11,509 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:30:11,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-09-10 02:30:11,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-09-10 02:30:11,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-09-10 02:30:11,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 881 transitions. [2019-09-10 02:30:11,535 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 881 transitions. Word has length 145 [2019-09-10 02:30:11,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:11,537 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 881 transitions. [2019-09-10 02:30:11,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:30:11,538 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 881 transitions. [2019-09-10 02:30:11,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 02:30:11,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:11,542 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:11,542 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:11,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:11,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1451023870, now seen corresponding path program 1 times [2019-09-10 02:30:11,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:11,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:11,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:11,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:11,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:11,728 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:30:11,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:11,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 02:30:11,729 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:11,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:30:11,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:30:11,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:30:11,731 INFO L87 Difference]: Start difference. First operand 574 states and 881 transitions. Second operand 12 states. [2019-09-10 02:30:11,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:11,994 INFO L93 Difference]: Finished difference Result 583 states and 891 transitions. [2019-09-10 02:30:11,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 02:30:11,994 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-09-10 02:30:11,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:11,999 INFO L225 Difference]: With dead ends: 583 [2019-09-10 02:30:11,999 INFO L226 Difference]: Without dead ends: 581 [2019-09-10 02:30:12,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 02:30:12,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2019-09-10 02:30:12,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 579. [2019-09-10 02:30:12,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-09-10 02:30:12,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 887 transitions. [2019-09-10 02:30:12,021 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 887 transitions. Word has length 146 [2019-09-10 02:30:12,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:12,023 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 887 transitions. [2019-09-10 02:30:12,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:30:12,023 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 887 transitions. [2019-09-10 02:30:12,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 02:30:12,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:12,027 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:12,027 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:12,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:12,027 INFO L82 PathProgramCache]: Analyzing trace with hash 457980586, now seen corresponding path program 1 times [2019-09-10 02:30:12,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:12,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:12,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:12,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:12,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:12,205 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 02:30:12,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:30:12,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:30:12,207 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2019-09-10 02:30:12,209 INFO L207 CegarAbsIntRunner]: [57], [58], [315], [319], [322], [338], [340], [342], [393], [394], [396], [397], [398], [400], [403], [405], [409], [537], [539], [636], [641], [644], [647], [711], [712], [713], [718], [751], [752], [818], [820], [823], [825], [831], [835], [838], [874], [877], [882], [887], [892], [897], [902], [905], [1021], [1024], [1025], [1074], [1079], [1082], [1101], [1286], [1290], [1294], [1298], [1302], [1306], [1309], [1311], [1312], [1325], [1328], [1334], [1338], [1354], [1356], [1359], [1361], [1363], [1368], [1370], [1373], [1479], [1480], [2163], [2167], [2170], [2188], [2357], [2358], [2359], [2360], [2361], [2362], [2363], [2364], [2365], [2375], [2376], [2377], [2378], [2403], [2404], [2405], [2406], [2407], [2408], [2415], [2416], [2417], [2445], [2446], [2475], [2476], [2477], [2478], [2489], [2509], [2510], [2511], [2512], [2517], [2518], [2519], [2545], [2551], [2552], [2553], [2554], [2555], [2556], [2557], [2558], [2559], [2611], [2612], [2613] [2019-09-10 02:30:12,285 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:30:12,285 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:30:12,381 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 02:30:12,383 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 147 root evaluator evaluations with a maximum evaluation depth of 0. Performed 147 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 254 variables. [2019-09-10 02:30:12,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:12,387 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 02:30:12,468 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-10 02:30:12,468 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 02:30:12,481 INFO L420 sIntCurrentIteration]: We unified 146 AI predicates to 146 [2019-09-10 02:30:12,481 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 02:30:12,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:30:12,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [10] total 10 [2019-09-10 02:30:12,483 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:12,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:30:12,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:30:12,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:30:12,484 INFO L87 Difference]: Start difference. First operand 579 states and 887 transitions. Second operand 2 states. [2019-09-10 02:30:12,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:12,484 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-10 02:30:12,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:30:12,485 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 147 [2019-09-10 02:30:12,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:12,485 INFO L225 Difference]: With dead ends: 2 [2019-09-10 02:30:12,485 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:30:12,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:30:12,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:30:12,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:30:12,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:30:12,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:30:12,488 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 147 [2019-09-10 02:30:12,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:12,488 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:30:12,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:30:12,489 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:30:12,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:30:12,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:30:12 BoogieIcfgContainer [2019-09-10 02:30:12,495 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:30:12,497 INFO L168 Benchmark]: Toolchain (without parser) took 9580.99 ms. Allocated memory was 132.6 MB in the beginning and 416.8 MB in the end (delta: 284.2 MB). Free memory was 85.8 MB in the beginning and 118.3 MB in the end (delta: -32.5 MB). Peak memory consumption was 251.7 MB. Max. memory is 7.1 GB. [2019-09-10 02:30:12,499 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 132.6 MB. Free memory is still 106.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-10 02:30:12,500 INFO L168 Benchmark]: CACSL2BoogieTranslator took 916.07 ms. Allocated memory was 132.6 MB in the beginning and 199.8 MB in the end (delta: 67.1 MB). Free memory was 85.4 MB in the beginning and 138.8 MB in the end (delta: -53.4 MB). Peak memory consumption was 34.2 MB. Max. memory is 7.1 GB. [2019-09-10 02:30:12,507 INFO L168 Benchmark]: Boogie Preprocessor took 212.46 ms. Allocated memory is still 199.8 MB. Free memory was 138.8 MB in the beginning and 129.8 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. [2019-09-10 02:30:12,508 INFO L168 Benchmark]: RCFGBuilder took 2218.71 ms. Allocated memory was 199.8 MB in the beginning and 267.9 MB in the end (delta: 68.2 MB). Free memory was 129.8 MB in the beginning and 164.6 MB in the end (delta: -34.8 MB). Peak memory consumption was 92.6 MB. Max. memory is 7.1 GB. [2019-09-10 02:30:12,509 INFO L168 Benchmark]: TraceAbstraction took 6229.60 ms. Allocated memory was 267.9 MB in the beginning and 416.8 MB in the end (delta: 148.9 MB). Free memory was 162.2 MB in the beginning and 118.3 MB in the end (delta: 43.9 MB). Peak memory consumption was 192.8 MB. Max. memory is 7.1 GB. [2019-09-10 02:30:12,518 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 132.6 MB. Free memory is still 106.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 916.07 ms. Allocated memory was 132.6 MB in the beginning and 199.8 MB in the end (delta: 67.1 MB). Free memory was 85.4 MB in the beginning and 138.8 MB in the end (delta: -53.4 MB). Peak memory consumption was 34.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 212.46 ms. Allocated memory is still 199.8 MB. Free memory was 138.8 MB in the beginning and 129.8 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2218.71 ms. Allocated memory was 199.8 MB in the beginning and 267.9 MB in the end (delta: 68.2 MB). Free memory was 129.8 MB in the beginning and 164.6 MB in the end (delta: -34.8 MB). Peak memory consumption was 92.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6229.60 ms. Allocated memory was 267.9 MB in the beginning and 416.8 MB in the end (delta: 148.9 MB). Free memory was 162.2 MB in the beginning and 118.3 MB in the end (delta: 43.9 MB). Peak memory consumption was 192.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2257]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 75 procedures, 878 locations, 1 error locations. SAFE Result, 6.1s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12396 SDtfs, 538 SDslu, 47792 SDs, 0 SdLazy, 1689 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 258 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=735occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.6712328767123288 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 10 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 2116 NumberOfCodeBlocks, 2116 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2101 ConstructedInterpolants, 0 QuantifiedInterpolants, 360237 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 530/540 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...