./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/dll-optional-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab46b01-fe48-4592-ba3f-ed242db2034e/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab46b01-fe48-4592-ba3f-ed242db2034e/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab46b01-fe48-4592-ba3f-ed242db2034e/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab46b01-fe48-4592-ba3f-ed242db2034e/bin/utaipan-UUZaoUuFF8/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-optional-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab46b01-fe48-4592-ba3f-ed242db2034e/bin/utaipan-UUZaoUuFF8/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab46b01-fe48-4592-ba3f-ed242db2034e/bin/utaipan-UUZaoUuFF8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8287e6117d458104c3f33a0e7a83f771b50c3974e23296edc32c92f0b8cae546 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 02:12:50,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 02:12:50,831 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 02:12:50,860 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 02:12:50,861 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 02:12:50,863 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 02:12:50,865 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 02:12:50,871 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 02:12:50,874 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 02:12:50,876 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 02:12:50,878 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 02:12:50,881 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 02:12:50,883 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 02:12:50,887 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 02:12:50,889 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 02:12:50,892 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 02:12:50,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 02:12:50,901 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 02:12:50,903 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 02:12:50,909 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 02:12:50,914 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 02:12:50,916 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 02:12:50,918 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 02:12:50,920 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 02:12:50,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 02:12:50,931 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 02:12:50,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 02:12:50,934 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 02:12:50,935 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 02:12:50,936 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 02:12:50,937 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 02:12:50,938 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 02:12:50,941 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 02:12:50,942 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 02:12:50,945 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 02:12:50,945 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 02:12:50,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 02:12:50,946 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 02:12:50,947 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 02:12:50,947 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 02:12:50,948 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 02:12:50,949 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab46b01-fe48-4592-ba3f-ed242db2034e/bin/utaipan-UUZaoUuFF8/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2021-11-07 02:12:50,970 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 02:12:50,971 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 02:12:50,972 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 02:12:50,972 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 02:12:50,972 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 02:12:50,972 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 02:12:50,972 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 02:12:50,973 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 02:12:50,973 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 02:12:50,973 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 02:12:50,973 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 02:12:50,973 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 02:12:50,974 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 02:12:50,974 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 02:12:50,974 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 02:12:50,975 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 02:12:50,975 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 02:12:50,975 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 02:12:50,975 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 02:12:50,976 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-07 02:12:50,976 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 02:12:50,976 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 02:12:50,976 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 02:12:50,976 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-07 02:12:50,976 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-07 02:12:50,977 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 02:12:50,977 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 02:12:50,977 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 02:12:50,977 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 02:12:50,977 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 02:12:50,978 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 02:12:50,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 02:12:50,978 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 02:12:50,978 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 02:12:50,978 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 02:12:50,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 02:12:50,979 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 02:12:50,979 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 02:12:50,979 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab46b01-fe48-4592-ba3f-ed242db2034e/bin/utaipan-UUZaoUuFF8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab46b01-fe48-4592-ba3f-ed242db2034e/bin/utaipan-UUZaoUuFF8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8287e6117d458104c3f33a0e7a83f771b50c3974e23296edc32c92f0b8cae546 [2021-11-07 02:12:51,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 02:12:51,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 02:12:51,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 02:12:51,351 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 02:12:51,352 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 02:12:51,354 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab46b01-fe48-4592-ba3f-ed242db2034e/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/forester-heap/dll-optional-2.i [2021-11-07 02:12:51,435 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab46b01-fe48-4592-ba3f-ed242db2034e/bin/utaipan-UUZaoUuFF8/data/3770f088e/92d97bd511534ca4a8e71605554be34d/FLAG657c07531 [2021-11-07 02:12:52,065 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 02:12:52,066 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab46b01-fe48-4592-ba3f-ed242db2034e/sv-benchmarks/c/forester-heap/dll-optional-2.i [2021-11-07 02:12:52,081 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab46b01-fe48-4592-ba3f-ed242db2034e/bin/utaipan-UUZaoUuFF8/data/3770f088e/92d97bd511534ca4a8e71605554be34d/FLAG657c07531 [2021-11-07 02:12:52,325 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab46b01-fe48-4592-ba3f-ed242db2034e/bin/utaipan-UUZaoUuFF8/data/3770f088e/92d97bd511534ca4a8e71605554be34d [2021-11-07 02:12:52,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 02:12:52,331 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 02:12:52,333 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 02:12:52,333 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 02:12:52,338 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 02:12:52,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:12:52" (1/1) ... [2021-11-07 02:12:52,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45cf6fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:12:52, skipping insertion in model container [2021-11-07 02:12:52,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:12:52" (1/1) ... [2021-11-07 02:12:52,354 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 02:12:52,430 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 02:12:52,885 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab46b01-fe48-4592-ba3f-ed242db2034e/sv-benchmarks/c/forester-heap/dll-optional-2.i[22706,22719] [2021-11-07 02:12:52,915 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 02:12:52,927 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 02:12:52,973 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab46b01-fe48-4592-ba3f-ed242db2034e/sv-benchmarks/c/forester-heap/dll-optional-2.i[22706,22719] [2021-11-07 02:12:52,977 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 02:12:53,019 INFO L208 MainTranslator]: Completed translation [2021-11-07 02:12:53,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:12:53 WrapperNode [2021-11-07 02:12:53,020 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 02:12:53,021 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 02:12:53,022 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 02:12:53,022 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 02:12:53,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:12:53" (1/1) ... [2021-11-07 02:12:53,051 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:12:53" (1/1) ... [2021-11-07 02:12:53,083 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 02:12:53,084 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 02:12:53,084 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 02:12:53,084 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 02:12:53,095 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:12:53" (1/1) ... [2021-11-07 02:12:53,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:12:53" (1/1) ... [2021-11-07 02:12:53,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:12:53" (1/1) ... [2021-11-07 02:12:53,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:12:53" (1/1) ... [2021-11-07 02:12:53,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:12:53" (1/1) ... [2021-11-07 02:12:53,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:12:53" (1/1) ... [2021-11-07 02:12:53,151 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:12:53" (1/1) ... [2021-11-07 02:12:53,153 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 02:12:53,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 02:12:53,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 02:12:53,154 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 02:12:53,155 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:12:53" (1/1) ... [2021-11-07 02:12:53,171 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 02:12:53,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab46b01-fe48-4592-ba3f-ed242db2034e/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:12:53,217 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab46b01-fe48-4592-ba3f-ed242db2034e/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 02:12:53,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab46b01-fe48-4592-ba3f-ed242db2034e/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 02:12:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-07 02:12:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-07 02:12:53,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-07 02:12:53,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-07 02:12:53,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 02:12:53,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-07 02:12:53,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 02:12:53,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 02:12:53,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 02:12:53,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 02:12:54,318 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 02:12:54,318 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-11-07 02:12:54,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:12:54 BoogieIcfgContainer [2021-11-07 02:12:54,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 02:12:54,324 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 02:12:54,331 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 02:12:54,339 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 02:12:54,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:12:52" (1/3) ... [2021-11-07 02:12:54,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374bc251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:12:54, skipping insertion in model container [2021-11-07 02:12:54,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:12:53" (2/3) ... [2021-11-07 02:12:54,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374bc251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:12:54, skipping insertion in model container [2021-11-07 02:12:54,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:12:54" (3/3) ... [2021-11-07 02:12:54,344 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-optional-2.i [2021-11-07 02:12:54,358 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 02:12:54,360 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 66 error locations. [2021-11-07 02:12:54,416 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 02:12:54,423 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 02:12:54,423 INFO L340 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2021-11-07 02:12:54,445 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 52 states have (on average 2.519230769230769) internal successors, (131), 118 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:12:54,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-11-07 02:12:54,452 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:12:54,453 INFO L513 BasicCegarLoop]: trace histogram [1, 1] [2021-11-07 02:12:54,453 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-11-07 02:12:54,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:12:54,460 INFO L85 PathProgramCache]: Analyzing trace with hash 7847, now seen corresponding path program 1 times [2021-11-07 02:12:54,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:12:54,471 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230284102] [2021-11-07 02:12:54,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:12:54,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:12:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:12:54,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:12:54,664 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:12:54,664 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230284102] [2021-11-07 02:12:54,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230284102] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:12:54,665 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:12:54,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-07 02:12:54,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110919706] [2021-11-07 02:12:54,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:12:54,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:12:54,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:12:54,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:12:54,696 INFO L87 Difference]: Start difference. First operand has 119 states, 52 states have (on average 2.519230769230769) internal successors, (131), 118 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:12:54,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:12:54,902 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2021-11-07 02:12:54,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:12:54,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-11-07 02:12:54,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:12:54,917 INFO L225 Difference]: With dead ends: 118 [2021-11-07 02:12:54,917 INFO L226 Difference]: Without dead ends: 116 [2021-11-07 02:12:54,919 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:12:54,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-11-07 02:12:54,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 111. [2021-11-07 02:12:54,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 55 states have (on average 2.2) internal successors, (121), 110 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:12:54,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2021-11-07 02:12:54,968 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 2 [2021-11-07 02:12:54,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:12:54,969 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2021-11-07 02:12:54,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:12:54,969 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2021-11-07 02:12:54,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-11-07 02:12:54,970 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:12:54,970 INFO L513 BasicCegarLoop]: trace histogram [1, 1] [2021-11-07 02:12:54,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 02:12:54,971 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-11-07 02:12:54,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:12:54,972 INFO L85 PathProgramCache]: Analyzing trace with hash 7848, now seen corresponding path program 1 times [2021-11-07 02:12:54,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:12:54,972 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85155700] [2021-11-07 02:12:54,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:12:54,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:12:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:12:55,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:12:55,033 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:12:55,033 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85155700] [2021-11-07 02:12:55,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85155700] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:12:55,034 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:12:55,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-07 02:12:55,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102027809] [2021-11-07 02:12:55,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:12:55,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:12:55,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:12:55,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:12:55,038 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:12:55,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:12:55,167 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2021-11-07 02:12:55,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:12:55,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-11-07 02:12:55,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:12:55,169 INFO L225 Difference]: With dead ends: 105 [2021-11-07 02:12:55,170 INFO L226 Difference]: Without dead ends: 105 [2021-11-07 02:12:55,170 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:12:55,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-11-07 02:12:55,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2021-11-07 02:12:55,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 55 states have (on average 2.036363636363636) internal successors, (112), 101 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:12:55,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2021-11-07 02:12:55,180 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 2 [2021-11-07 02:12:55,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:12:55,180 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2021-11-07 02:12:55,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:12:55,180 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2021-11-07 02:12:55,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-07 02:12:55,181 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:12:55,181 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:12:55,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 02:12:55,182 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-11-07 02:12:55,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:12:55,182 INFO L85 PathProgramCache]: Analyzing trace with hash -832928076, now seen corresponding path program 1 times [2021-11-07 02:12:55,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:12:55,183 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647208780] [2021-11-07 02:12:55,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:12:55,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:12:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:12:55,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:12:55,321 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:12:55,321 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647208780] [2021-11-07 02:12:55,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647208780] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:12:55,322 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:12:55,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:12:55,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973629834] [2021-11-07 02:12:55,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:12:55,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:12:55,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:12:55,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:12:55,328 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:12:55,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:12:55,584 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2021-11-07 02:12:55,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:12:55,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-07 02:12:55,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:12:55,591 INFO L225 Difference]: With dead ends: 126 [2021-11-07 02:12:55,592 INFO L226 Difference]: Without dead ends: 126 [2021-11-07 02:12:55,592 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:12:55,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-11-07 02:12:55,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 101. [2021-11-07 02:12:55,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 55 states have (on average 2.018181818181818) internal successors, (111), 100 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:12:55,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2021-11-07 02:12:55,620 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 8 [2021-11-07 02:12:55,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:12:55,621 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2021-11-07 02:12:55,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:12:55,622 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2021-11-07 02:12:55,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-07 02:12:55,623 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:12:55,624 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:12:55,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 02:12:55,624 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-11-07 02:12:55,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:12:55,626 INFO L85 PathProgramCache]: Analyzing trace with hash -832928075, now seen corresponding path program 1 times [2021-11-07 02:12:55,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:12:55,626 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232143944] [2021-11-07 02:12:55,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:12:55,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:12:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:12:55,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:12:55,784 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:12:55,785 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232143944] [2021-11-07 02:12:55,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232143944] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:12:55,786 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:12:55,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:12:55,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386711888] [2021-11-07 02:12:55,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:12:55,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:12:55,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:12:55,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:12:55,791 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:12:56,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:12:56,019 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2021-11-07 02:12:56,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:12:56,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-07 02:12:56,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:12:56,022 INFO L225 Difference]: With dead ends: 100 [2021-11-07 02:12:56,023 INFO L226 Difference]: Without dead ends: 100 [2021-11-07 02:12:56,026 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:12:56,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-11-07 02:12:56,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2021-11-07 02:12:56,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 55 states have (on average 2.0) internal successors, (110), 99 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:12:56,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2021-11-07 02:12:56,038 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 8 [2021-11-07 02:12:56,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:12:56,039 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2021-11-07 02:12:56,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:12:56,039 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2021-11-07 02:12:56,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 02:12:56,040 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:12:56,040 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:12:56,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 02:12:56,041 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-11-07 02:12:56,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:12:56,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1417727733, now seen corresponding path program 1 times [2021-11-07 02:12:56,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:12:56,042 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50156570] [2021-11-07 02:12:56,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:12:56,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:12:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:12:56,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:12:56,169 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:12:56,170 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50156570] [2021-11-07 02:12:56,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50156570] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:12:56,170 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:12:56,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:12:56,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434116288] [2021-11-07 02:12:56,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:12:56,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:12:56,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:12:56,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:12:56,175 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:12:56,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:12:56,367 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2021-11-07 02:12:56,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:12:56,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 02:12:56,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:12:56,369 INFO L225 Difference]: With dead ends: 100 [2021-11-07 02:12:56,369 INFO L226 Difference]: Without dead ends: 100 [2021-11-07 02:12:56,369 INFO L786 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 [2021-11-07 02:12:56,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-11-07 02:12:56,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2021-11-07 02:12:56,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.8) internal successors, (108), 92 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:12:56,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2021-11-07 02:12:56,375 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 108 transitions. Word has length 11 [2021-11-07 02:12:56,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:12:56,375 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 108 transitions. [2021-11-07 02:12:56,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:12:56,376 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2021-11-07 02:12:56,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 02:12:56,377 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:12:56,377 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:12:56,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 02:12:56,377 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-11-07 02:12:56,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:12:56,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1417727732, now seen corresponding path program 1 times [2021-11-07 02:12:56,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:12:56,379 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096407325] [2021-11-07 02:12:56,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:12:56,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:12:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:12:56,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:12:56,458 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:12:56,459 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096407325] [2021-11-07 02:12:56,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096407325] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:12:56,459 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:12:56,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 02:12:56,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370206714] [2021-11-07 02:12:56,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:12:56,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:12:56,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:12:56,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:12:56,462 INFO L87 Difference]: Start difference. First operand 93 states and 108 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:12:56,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:12:56,693 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2021-11-07 02:12:56,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:12:56,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 02:12:56,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:12:56,695 INFO L225 Difference]: With dead ends: 130 [2021-11-07 02:12:56,696 INFO L226 Difference]: Without dead ends: 130 [2021-11-07 02:12:56,696 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:12:56,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-11-07 02:12:56,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 111. [2021-11-07 02:12:56,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 78 states have (on average 1.6923076923076923) internal successors, (132), 110 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:12:56,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 132 transitions. [2021-11-07 02:12:56,702 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 132 transitions. Word has length 11 [2021-11-07 02:12:56,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:12:56,702 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 132 transitions. [2021-11-07 02:12:56,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:12:56,703 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 132 transitions. [2021-11-07 02:12:56,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 02:12:56,708 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:12:56,709 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:12:56,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 02:12:56,711 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-11-07 02:12:56,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:12:56,711 INFO L85 PathProgramCache]: Analyzing trace with hash -931567606, now seen corresponding path program 1 times [2021-11-07 02:12:56,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:12:56,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616995338] [2021-11-07 02:12:56,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:12:56,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:12:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:12:56,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:12:56,812 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:12:56,812 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616995338] [2021-11-07 02:12:56,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616995338] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:12:56,813 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:12:56,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:12:56,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011119355] [2021-11-07 02:12:56,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:12:56,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:12:56,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:12:56,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:12:56,816 INFO L87 Difference]: Start difference. First operand 111 states and 132 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:12:56,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:12:56,994 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2021-11-07 02:12:56,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:12:56,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-07 02:12:56,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:12:56,996 INFO L225 Difference]: With dead ends: 110 [2021-11-07 02:12:56,996 INFO L226 Difference]: Without dead ends: 110 [2021-11-07 02:12:56,997 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:12:56,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-11-07 02:12:57,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2021-11-07 02:12:57,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 78 states have (on average 1.6666666666666667) internal successors, (130), 109 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:12:57,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 130 transitions. [2021-11-07 02:12:57,003 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 130 transitions. Word has length 13 [2021-11-07 02:12:57,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:12:57,003 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 130 transitions. [2021-11-07 02:12:57,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:12:57,004 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 130 transitions. [2021-11-07 02:12:57,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 02:12:57,005 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:12:57,005 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:12:57,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 02:12:57,006 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-11-07 02:12:57,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:12:57,007 INFO L85 PathProgramCache]: Analyzing trace with hash -931567605, now seen corresponding path program 1 times [2021-11-07 02:12:57,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:12:57,007 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913769461] [2021-11-07 02:12:57,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:12:57,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:12:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:12:57,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:12:57,094 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:12:57,094 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913769461] [2021-11-07 02:12:57,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913769461] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:12:57,095 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:12:57,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:12:57,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619316184] [2021-11-07 02:12:57,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:12:57,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:12:57,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:12:57,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:12:57,098 INFO L87 Difference]: Start difference. First operand 110 states and 130 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:12:57,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:12:57,282 INFO L93 Difference]: Finished difference Result 109 states and 128 transitions. [2021-11-07 02:12:57,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:12:57,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-07 02:12:57,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:12:57,284 INFO L225 Difference]: With dead ends: 109 [2021-11-07 02:12:57,284 INFO L226 Difference]: Without dead ends: 109 [2021-11-07 02:12:57,285 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:12:57,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-11-07 02:12:57,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-11-07 02:12:57,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 78 states have (on average 1.641025641025641) internal successors, (128), 108 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:12:57,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 128 transitions. [2021-11-07 02:12:57,289 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 128 transitions. Word has length 13 [2021-11-07 02:12:57,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:12:57,290 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 128 transitions. [2021-11-07 02:12:57,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:12:57,290 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 128 transitions. [2021-11-07 02:12:57,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-07 02:12:57,291 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:12:57,291 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:12:57,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 02:12:57,292 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-11-07 02:12:57,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:12:57,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1181636105, now seen corresponding path program 1 times [2021-11-07 02:12:57,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:12:57,293 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018655198] [2021-11-07 02:12:57,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:12:57,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:12:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:12:57,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:12:57,336 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:12:57,336 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018655198] [2021-11-07 02:12:57,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018655198] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:12:57,337 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:12:57,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:12:57,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619189621] [2021-11-07 02:12:57,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:12:57,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:12:57,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:12:57,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:12:57,339 INFO L87 Difference]: Start difference. First operand 109 states and 128 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:12:57,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:12:57,478 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2021-11-07 02:12:57,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:12:57,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-07 02:12:57,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:12:57,480 INFO L225 Difference]: With dead ends: 123 [2021-11-07 02:12:57,480 INFO L226 Difference]: Without dead ends: 123 [2021-11-07 02:12:57,481 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:12:57,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-11-07 02:12:57,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 109. [2021-11-07 02:12:57,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 78 states have (on average 1.6153846153846154) internal successors, (126), 108 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:12:57,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2021-11-07 02:12:57,485 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 14 [2021-11-07 02:12:57,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:12:57,485 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2021-11-07 02:12:57,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:12:57,486 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2021-11-07 02:12:57,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 02:12:57,486 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:12:57,487 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:12:57,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 02:12:57,487 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-11-07 02:12:57,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:12:57,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1883114057, now seen corresponding path program 1 times [2021-11-07 02:12:57,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:12:57,488 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769647513] [2021-11-07 02:12:57,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:12:57,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:12:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:12:57,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:12:57,625 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:12:57,625 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769647513] [2021-11-07 02:12:57,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769647513] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:12:57,626 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:12:57,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-07 02:12:57,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27489391] [2021-11-07 02:12:57,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 02:12:57,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:12:57,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 02:12:57,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-07 02:12:57,629 INFO L87 Difference]: Start difference. First operand 109 states and 126 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:12:58,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:12:58,039 INFO L93 Difference]: Finished difference Result 110 states and 125 transitions. [2021-11-07 02:12:58,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 02:12:58,040 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-07 02:12:58,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:12:58,041 INFO L225 Difference]: With dead ends: 110 [2021-11-07 02:12:58,042 INFO L226 Difference]: Without dead ends: 110 [2021-11-07 02:12:58,042 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:12:58,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-11-07 02:12:58,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2021-11-07 02:12:58,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 78 states have (on average 1.6025641025641026) internal successors, (125), 107 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:12:58,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 125 transitions. [2021-11-07 02:12:58,046 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 125 transitions. Word has length 15 [2021-11-07 02:12:58,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:12:58,046 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 125 transitions. [2021-11-07 02:12:58,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:12:58,047 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 125 transitions. [2021-11-07 02:12:58,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 02:12:58,048 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:12:58,049 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:12:58,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 02:12:58,049 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-11-07 02:12:58,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:12:58,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1883114056, now seen corresponding path program 1 times [2021-11-07 02:12:58,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:12:58,051 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853567588] [2021-11-07 02:12:58,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:12:58,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:12:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:12:58,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:12:58,249 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:12:58,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853567588] [2021-11-07 02:12:58,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853567588] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:12:58,249 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:12:58,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 02:12:58,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675650150] [2021-11-07 02:12:58,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 02:12:58,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:12:58,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 02:12:58,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-07 02:12:58,253 INFO L87 Difference]: Start difference. First operand 108 states and 125 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:12:58,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:12:58,795 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2021-11-07 02:12:58,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 02:12:58,796 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-07 02:12:58,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:12:58,797 INFO L225 Difference]: With dead ends: 100 [2021-11-07 02:12:58,797 INFO L226 Difference]: Without dead ends: 100 [2021-11-07 02:12:58,797 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2021-11-07 02:12:58,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-11-07 02:12:58,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2021-11-07 02:12:58,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 90 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:12:58,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2021-11-07 02:12:58,801 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 15 [2021-11-07 02:12:58,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:12:58,801 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2021-11-07 02:12:58,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:12:58,802 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2021-11-07 02:12:58,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-07 02:12:58,803 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:12:58,803 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:12:58,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 02:12:58,804 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-11-07 02:12:58,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:12:58,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1584318480, now seen corresponding path program 1 times [2021-11-07 02:12:58,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:12:58,805 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383251622] [2021-11-07 02:12:58,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:12:58,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:12:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 02:12:58,821 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 02:12:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 02:12:58,860 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-07 02:12:58,860 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 02:12:58,862 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 02:12:58,864 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-11-07 02:12:58,865 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-11-07 02:12:58,865 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-11-07 02:12:58,865 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-11-07 02:12:58,866 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-11-07 02:12:58,866 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-11-07 02:12:58,866 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-11-07 02:12:58,866 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-11-07 02:12:58,867 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-11-07 02:12:58,867 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-11-07 02:12:58,867 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-11-07 02:12:58,868 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-11-07 02:12:58,868 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-11-07 02:12:58,868 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-11-07 02:12:58,869 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-11-07 02:12:58,869 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-11-07 02:12:58,869 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-11-07 02:12:58,869 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-11-07 02:12:58,870 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-11-07 02:12:58,870 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-11-07 02:12:58,870 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-11-07 02:12:58,871 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-11-07 02:12:58,871 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-11-07 02:12:58,871 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-11-07 02:12:58,871 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-11-07 02:12:58,872 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-11-07 02:12:58,872 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-11-07 02:12:58,872 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-11-07 02:12:58,873 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-11-07 02:12:58,873 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION [2021-11-07 02:12:58,873 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-11-07 02:12:58,873 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION [2021-11-07 02:12:58,874 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION [2021-11-07 02:12:58,874 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-11-07 02:12:58,874 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION [2021-11-07 02:12:58,875 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION [2021-11-07 02:12:58,875 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-11-07 02:12:58,875 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-11-07 02:12:58,875 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-11-07 02:12:58,876 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION [2021-11-07 02:12:58,876 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION [2021-11-07 02:12:58,876 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION [2021-11-07 02:12:58,876 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-11-07 02:12:58,877 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-11-07 02:12:58,877 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION [2021-11-07 02:12:58,877 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION [2021-11-07 02:12:58,878 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-11-07 02:12:58,878 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION [2021-11-07 02:12:58,878 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION [2021-11-07 02:12:58,878 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION [2021-11-07 02:12:58,879 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION [2021-11-07 02:12:58,879 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION [2021-11-07 02:12:58,879 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION [2021-11-07 02:12:58,879 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION [2021-11-07 02:12:58,880 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION [2021-11-07 02:12:58,880 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION [2021-11-07 02:12:58,880 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATION [2021-11-07 02:12:58,880 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION [2021-11-07 02:12:58,881 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 02:12:58,881 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 02:12:58,881 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 02:12:58,882 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 02:12:58,882 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 02:12:58,882 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 02:12:58,883 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 02:12:58,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 02:12:58,887 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:12:58,891 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 02:12:58,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 02:12:58 BoogieIcfgContainer [2021-11-07 02:12:58,919 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 02:12:58,920 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 02:12:58,920 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 02:12:58,921 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 02:12:58,921 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:12:54" (3/4) ... [2021-11-07 02:12:58,924 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-07 02:12:58,966 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab46b01-fe48-4592-ba3f-ed242db2034e/bin/utaipan-UUZaoUuFF8/witness.graphml [2021-11-07 02:12:58,966 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 02:12:58,968 INFO L168 Benchmark]: Toolchain (without parser) took 6636.36 ms. Allocated memory was 102.8 MB in the beginning and 123.7 MB in the end (delta: 21.0 MB). Free memory was 59.9 MB in the beginning and 44.3 MB in the end (delta: 15.6 MB). Peak memory consumption was 36.5 MB. Max. memory is 16.1 GB. [2021-11-07 02:12:58,969 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 102.8 MB. Free memory was 77.9 MB in the beginning and 77.8 MB in the end (delta: 56.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 02:12:58,969 INFO L168 Benchmark]: CACSL2BoogieTranslator took 687.30 ms. Allocated memory is still 102.8 MB. Free memory was 59.7 MB in the beginning and 69.3 MB in the end (delta: -9.6 MB). Peak memory consumption was 6.4 MB. Max. memory is 16.1 GB. [2021-11-07 02:12:58,970 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.92 ms. Allocated memory is still 102.8 MB. Free memory was 69.3 MB in the beginning and 67.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 02:12:58,970 INFO L168 Benchmark]: Boogie Preprocessor took 69.52 ms. Allocated memory is still 102.8 MB. Free memory was 67.0 MB in the beginning and 65.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 02:12:58,971 INFO L168 Benchmark]: RCFGBuilder took 1168.14 ms. Allocated memory was 102.8 MB in the beginning and 123.7 MB in the end (delta: 21.0 MB). Free memory was 65.4 MB in the beginning and 97.1 MB in the end (delta: -31.7 MB). Peak memory consumption was 33.0 MB. Max. memory is 16.1 GB. [2021-11-07 02:12:58,971 INFO L168 Benchmark]: TraceAbstraction took 4595.14 ms. Allocated memory is still 123.7 MB. Free memory was 97.0 MB in the beginning and 46.4 MB in the end (delta: 50.6 MB). Peak memory consumption was 51.6 MB. Max. memory is 16.1 GB. [2021-11-07 02:12:58,972 INFO L168 Benchmark]: Witness Printer took 46.28 ms. Allocated memory is still 123.7 MB. Free memory was 46.4 MB in the beginning and 44.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 02:12:58,975 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39 ms. Allocated memory is still 102.8 MB. Free memory was 77.9 MB in the beginning and 77.8 MB in the end (delta: 56.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 687.30 ms. Allocated memory is still 102.8 MB. Free memory was 59.7 MB in the beginning and 69.3 MB in the end (delta: -9.6 MB). Peak memory consumption was 6.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 61.92 ms. Allocated memory is still 102.8 MB. Free memory was 69.3 MB in the beginning and 67.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 69.52 ms. Allocated memory is still 102.8 MB. Free memory was 67.0 MB in the beginning and 65.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1168.14 ms. Allocated memory was 102.8 MB in the beginning and 123.7 MB in the end (delta: 21.0 MB). Free memory was 65.4 MB in the beginning and 97.1 MB in the end (delta: -31.7 MB). Peak memory consumption was 33.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 4595.14 ms. Allocated memory is still 123.7 MB. Free memory was 97.0 MB in the beginning and 46.4 MB in the end (delta: 50.6 MB). Peak memory consumption was 51.6 MB. Max. memory is 16.1 GB. * Witness Printer took 46.28 ms. Allocated memory is still 123.7 MB. Free memory was 46.4 MB in the beginning and 44.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1009]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L997] SLL* head = malloc(sizeof(SLL)); [L998] head->next = ((void*)0) [L999] head->prev = ((void*)0) [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1000] COND TRUE __VERIFIER_nondet_int() [L1000] head->data = 1 [L1000] head->opt = head [L1001] SLL* x = head; [L1003] COND FALSE !(__VERIFIER_nondet_int()) [L1006] x = head [L1007] COND TRUE x != ((void*)0) [L1009] EXPR x->data [L1009] EXPR x->data == 2 && x->opt == x [L1009] COND TRUE !(x->data == 2 && x->opt == x) [L1009] reach_error() - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 994]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 119 locations, 66 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 673 SDtfs, 745 SDslu, 898 SDs, 0 SdLazy, 1767 SolverSat, 153 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=0, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 84 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 101 ConstructedInterpolants, 0 QuantifiedInterpolants, 593 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-07 02:12:59,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab46b01-fe48-4592-ba3f-ed242db2034e/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)